Loading...
conference paper
Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields
1997
Information Security and Privacy. Second Australasian Conference, ACISP'97
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
Loading...
Name
149485.pdf
Access type
openaccess
Size
1.89 MB
Format
Adobe PDF
Checksum (MD5)
075cc93b6bedd9fb96ef534d3929f1a9