Learn More
This article addresses an efficient hardware implementations for multiplication over finite field GF(2 233). Multiplication in GF(2 n) is very commonly used in cryptography and error correcting codes. An efficient hardware could reduce the cost and development for these applications. This work presents the hardware implementation of polynomial basis. In(More)
This article address efficient hardware implementations for multiplication over GF(2 163). Hardware implementations of multiplication algorithms are suitable for elliptic curve cryptoprocessor designs, which allow that elliptic curve based cryptosystems implemented in hardware provide more physical security and higher speed than software implementations. In(More)
  • 1