Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields

The author shows how to use cyclotomic polynomials to construct subgroups of multiplicative groups of finite fields that allow very efficient implementation of discrete logarithm based public key cryptosystems. Depending on the type of application and implementation, the resulting schemes may be up to three times faster than the fastest known schemes of comparable security that use more conventional choices of subgroups or finite fields


Published in:
Information Security and Privacy. Second Australasian Conference, ACISP'97. Proceedings, 127 - 38
Presented at:
Information Security and Privacy. Second Australasian Conference, ACISP'97. Proceedings, Berlin, Germany
Year:
1997
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)