This contribution focuses on a class of Galois field used to achieve fast finite field arithmetic which we call an Optimal Extension Field (OEF), first introduced in . We extend this work by presenting an adaptation of Itoh and Tsujii's algorithm for finite field inversion applied to OEFs. In particular, we use the facts that the action of the Frobenius map in GF (p m ) can be computed with only m-1 subfield multiplications and that inverses in GF (p) may be computed cheaply using known techniques. As a result, we show that one extension field inversion can be computed with a logarithmic number of extension field multiplications. In addition, we provide new extension field multiplication formulas which give a performance increase. Further, we provide an OEF construction algorithm together with tables of Type I and Type II OEFs along with statistics on the number of pseudo-Mersenne primes and OEFs. We apply this new work to provide implementation results using these methods to construct elliptic curve cryptosystems on both DEC Alpha workstations and Pentium-class PCs. These results show that OEFs when used with our new inversion and multiplication algorithms provide a substantial performance increase over other reported methods.
Received 7 July 1999 and revised 29 March 2000 Online publication 15 September 2000
Rights and permissions
About this article
Cite this article
Bailey, D., Paar, C. Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography. J. Cryptology 14, 153–176 (2001). https://doi.org/10.1007/s001450010012
- Key words. Finite fields, Fast arithmetic, Binomials, Modular reduction, Elliptic curves, Inversion.