Arithmetic operations inGF(2m)

This article is concerned with various arithmetic operations inGF(2m). In particular we discuss techniques for computing multiplicative inverses and doing exponentiation. The method used for exponentiation is highly suited to parallel computation. All methods achieve much of their efficiency from exploiting a normal basis representation in the field.

[1]  T. Rosati.  A high speed data encryption processor for public key cryptography , 1989, 1989 Proceedings of the IEEE Custom Integrated Circuits Conference.

[2]  O. Ore.  On a special class of polynomials , 1933 .

[3]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[4]  Gordon B. Agnew,et al.  An implementation for a fast public-key cryptosystem , 2004, Journal of Cryptology.

[5]  T. Itoh,et al.  A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..

[6]  H. Lenstra,et al.  Primitive normal bases for finite fields , 1987 .