Low Cost Dual-Basis Multiplier over GF(2m) Using Multiplexer Approach

Abstract

Information security is heavily dependent on public key cryptosystems such as RSA. However, RSA is not available for the resource-constrained devices like embedded systems. Therefore, the new elliptic curve cryptosystem with very low cost as compared to RSA is now available and suggested for information security. Galois/Finite field multiplication is the most important operation in elliptic curve cryptosystem. There are three popular types of bases for representing elements in finite field, termed polynomial basis (PB), normal basis (NB), and dual basis (DB). A novel low-cost bit-parallel DB multiplier which employs multiplexer approach is presented. As compared to traditional DB multiplier using XOR gates, the proposed design saves at least 40% space complexity.KeywordsElliptic curve cryptosystemfinite field arithmeticdual basis multiplierinformation securitycryptography