Full Multiplexers Implementation of Dual Basis Multiplier over GF(2<sup>m</sup>)

Abstract

Information security is getting more important due to the highly-developed computer technologies. The information security is heavily dependent on cryptosystems such as RSA and elliptic curve cryptosystem (ECC). ECC is suitable for the resource-constrained devices such as embedded system or hand-held devices because ECC can achieve the same security level but uses less cost as compared to RSA. Galois/Finite field multiplication is the most crucial operation in ECC. There are three popular bases in finite field in GF(2m), polynomial basis (PB), normal basis (NB), and dual basis (DB). A low-complexity bit-parallel DB multiplier which employs multiplexer approach is presented in this paper. While comparing with other related works, the proposed DB multiplier saves at least 20% space complexity.