VLSI implementation of public-key encryption algorithms

This publication has 11 references indexed in Scilit:

• A Fast VLSI Multiplier for GF(2m)
  IEEE Journal on Selected Areas in Communications, 1986
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
  IEEE Transactions on Computers, 1985
• Computing Logarithms in Finite Fields of Characteristic Two
  SIAM Journal on Algebraic Discrete Methods, 1984
• Systolic Multipliers for Finite Fields GF(2^m)
  IEEE Transactions on Computers, 1984
• A Computer Algorithm for Calculating the Product AB Modulo M
  IEEE Transactions on Computers, 1983
• Design for testability—A survey
  Proceedings of the IEEE, 1983
• A method for obtaining digital signatures and public-key cryptosystems
  Communications of the ACM, 1978
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976
• A Cellular-Array Multiplier for GF(2^m)
  IEEE Transactions on Computers, 1971
• Computation with finite fields
  Information and Control, 1963