An efficient reconfigurable multiplier architecture for Galois field GF(2 )

This publication has 9 references indexed in Scilit:

• Selecting Cryptographic Key Sizes
  Journal of Cryptology, 2001
• Fast arithmetic for public-key algorithms in Galois fields with composite exponents
  IEEE Transactions on Computers, 1999
• Low-Energy Digit-Serial/Parallel Finite Field Multipliers
  Journal of Signal Processing Systems, 1998
• Montgomery Multiplication in GF(2k)
  Designs, Codes and Cryptography, 1998
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
  IEEE Transactions on Computers, 1998
• Theory and applications of cellular automata in cryptography
  IEEE Transactions on Computers, 1994
• Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)
  IEEE Transactions on Computers, 1992
• Elliptic curve cryptosystems
  Mathematics of Computation, 1987
• A Fast VLSI Multiplier for GF(2m)
  IEEE Journal on Selected Areas in Communications, 1986