Arithmetic operations in GF(2m)

New directions in cryptography

Whitfield Diffie, Martin E. Hellman · IEEE Transactions on Information Theory · 1976 · 14.4K citations

Computing, Communication, Computer Science +11

A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Toshiya Itoh, Shigeo Tsujii · Information and Computation · 1988 · 636 citations

Computing, Computer Science, Mathematics +12

On a special class of polynomials

Öystein Ore · Transactions of the American Mathematical Society · 1933 · 233 citations · Full text

Natural Sciences, Mathematics, Algebra +4

An implementation for a fast public-key cryptosystem

Gordon B. Agnew, R. C. Mullin, I. Onyszchuk et al. · Journal of Cryptology · 1991 · 194 citations · Full text

Computing, Computer Engineering, Computer Science +12

Primitive normal bases for finite fields

H. W. Lenstra, René Schoof · Mathematics of Computation · 1987 · 128 citations · Full text

Natural Sciences, Computer Engineering, Elementary +7