Full Multiplexers Implementation of Dual Basis Multiplier over GF(2m)

Article Preview

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3423-3427

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] F. J. MacWilliams, and N. J. A. Sloane: The Theory of Error-Correcting Codes (Amsterdam: North-Holland 1981).

Google Scholar

[2] R. Lidl, and H. Niederreiter: Introduction to Finite Fields and Their Applications (New York: Cambridge Univ. Press 1994).

Google Scholar

[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) pp.11-25.

DOI: 10.1049/iet-ifs.2009.0160

Google Scholar

[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.

Google Scholar

[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.

DOI: 10.1109/tc.2008.226

Google Scholar

[6] T.-P Chuang, C. W. Chiou, and S.-S. Lin: "Self-Checking Alternating Logic Bit-Parallel Gaussian Normal Basis Multiplier with Type-t," IET Information Security, Vol. 5, No. 1, (2011) pp.33-43.

DOI: 10.1049/iet-ifs.2010.0254

Google Scholar

[7] C. W. Chiou, W.-Y. Liang, H. W. Chang, J.-M. Lin, and C.-Y. Lee: "Concurrent Error Detection in Semi-Systolic Dual Basis Multiplier Over GF(2m) using self-checking alternating logic," IET Circuits Devices System, Vol. 4, No. 5, (2010) p.382–391.

DOI: 10.1049/iet-cds.2009.0243

Google Scholar

[8] H. W. Chang, W.-Y. Liang, and C. W. Chiou: "Low Cost Dual-Basis Multiplier Over GF(2m) Using Multiplexer Approach," Advances in Intelligent and Soft Computing, Vol. 135, (2012) pp.185-192.

DOI: 10.1007/978-3-642-27708-5_25

Google Scholar

[9] C. Y. Lee, C. W. Chiou, and J. M. Lin: "Low-Complexity Bit-Parallel Dual Basis Multipliers Using The Modified Booth's Algorithm," Journal of Computers and Electrical Engineering, Vol. 31, No. 7, (2005) pp.444-459.

DOI: 10.1016/j.compeleceng.2005.09.002

Google Scholar

[10] N. H. E. Weste, K. Eshraghian, and M. J. S. Smith: Principles of CMOS VLSI Design: A Systems Perspective with Verilog/VHDL Manual (Addison Wesley 2000).

Google Scholar