A fast software implementation for arithmetic operations in GF(2n)

This publication has 10 references indexed in Scilit:

• Public-Key Cryptosystems with Very Small Key Lengths
  Published by Springer Nature ,2001
• Use of Elliptic Curves in Cryptography
  Published by Springer Nature ,2000
• Counting the number of points on elliptic curves over finite fields: strategies and performances
  Published by Springer Nature ,1995
• Fast Key Exchange with Elliptic Curve Systems
  Published by Springer Nature ,1995
• An implementation of elliptic curve cryptosystems over F/sub 2/155
  IEEE Journal on Selected Areas in Communications, 1993
• On computing multiplicative inverses in GF(2/sup m/)
  IEEE Transactions on Computers, 1993
• Elliptic Curve Public Key Cryptosystems
  Published by Springer Nature ,1993
• Optimal normal bases in GF(pn)
  Discrete Applied Mathematics, 1989
• Elliptic curve cryptosystems
  Mathematics of Computation, 1987
• An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
  IEEE Transactions on Information Theory, 1978