Affiliation:
1. National Taipei University of Technology
2. Chien Hsin University of Science and Technology
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.
Publisher
Trans Tech Publications, Ltd.
Reference10 articles.
1. F. J. MacWilliams, and N. J. A. Sloane: The Theory of Error-Correcting Codes (Amsterdam: North-Holland 1981).
2. R. Lidl, and H. Niederreiter: Introduction to Finite Fields and Their Applications (New York: Cambridge Univ. Press 1994).
3. H. W. Chang, C. W. Chiou, F. H. Chou, and W. -Y. Liang: Concurrent Error Detection in Polynomial Basis Multiplier Over GF(2m) Using Irreducible Trinomial, Journal of computers (Special issue on Computer Arithmetic and Cryptography), Vol. 22, No. 3 (2011).
4. C. W. Chiou, W. -T. Huang, C. H. Chang, C. -Y. Lee, J. -M. Lin, and Y. -C. Yeh: Design of Polynomial Basis Multiplier Over GF(2m) for Resisting Fault-Based Cryptanalysis and Off-Line Testing, Journal of Computers, Vol. 22, No. 3, (2011) pp.26-36.
5. C. W. Chiou, C. -C. Chang, C. -Y. Lee, T. -W. Hou, and J. -M. Lin: Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier Over GF(2m), IEEE Trans. on Computers, Vol. 58, No. 6, (2009) pp.851-857.