Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)

This publication has 19 references indexed in Scilit:

• VLSI design for exponentiation in GF(2n)
  Published by Springer Nature ,2005
• Massively Parallel Computation of Discrete Logarithms
  Published by Springer Nature ,2001
• GF(2/sup m/) multiplication and division over the dual basis
  IEEE Transactions on Computers, 1996
• Finite field inversion over the dual basis
  IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1996
• Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)
  IEEE Transactions on Computers, 1992
• A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequences
  IEEE Transactions on Computers, 1990
• Hyperelliptic cryptosystems
  Journal of Cryptology, 1989
• Vlsi designs for multiplication over finite fields GF(2m)
  Published by Springer Nature ,1989
• A public key cryptosystem and a signature scheme based on discrete logarithms
  IEEE Transactions on Information Theory, 1985
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976