Browse > Article
http://dx.doi.org/10.13089/JKIISC.2006.16.2.105

Modified SMPO for Type-II Optimal Normal Basis  

Yang Dong-Jin (Graduate School of Information Security(GSIS), Korea University)
Chang Nam-Su (Graduate School of Information Security(GSIS), Korea University)
Ji Sung-Yeon (Graduate School of Information Security(GSIS), Korea University)
Kim Chang-Han (Information & Communication System, Semyung University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.16, no.2, 2006 , pp. 105-111 More about this Journal
Abstract
Cryptographic application and coding theory require operations in finite field $GF(2^m)$. In such a field, the area and time complexity of implementation estimate by memory and time delay. Therefore, the effort for constructing an efficient multiplier in finite field have been proceeded. Massey-Omura proposed a multiplier that uses normal bases to represent elements $CH(2^m)$ [11] and Agnew at al. suggested a sequential multiplier that is a modification of Massey-Omura's structure for reducing the path delay. Recently, Rayhani-Masoleh and Hasan and S.Kwon at al. suggested a area efficient multipliers for modifying Agnew's structure respectively[2,3]. In [2] Rayhani-Masoleh and Hasan proposed a modified multiplier that has slightly increased a critical path delay from Agnew at al's structure. But, In [3] S.Kwon at al. proposed a modified multiplier that has no loss of a time efficiency from Agnew's structure. In this paper we will propose a multiplier by modifying Rayhani-Masoleh and Hassan's structure and the area-time complexity of the proposed multiplier is exactly same as that of S.Kwon at al's structure for type-II optimal normal basis.
Keywords
Gaussian Normal Basis; Massey-Omura multiplier; finite field;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. Paar, P. Fleischmann, and P. Roelse, 'Efficient multiplier architectures for Galois fields GF($2^{4n}$),' IEEE Trans. Computers, Vol. 47, pp. 162-170, 1988   DOI   ScienceOn
2 B. Sunar and C.K. Koc, 'An efficient optimal normal basis type-II multiplier,' IEEE Trans. Computers, Vol. 50, pp. 83-87, 2001   DOI   ScienceOn
3 S. Kwon, K. Gaj, C.H. Kim, C.P. hong, 'Efficient Linear Array for Multiplication in GF($2^{m}$) Using a Normal Basis for Elliptic Curve Cryptography,' CHES 2004, LNCS 3156, pp. 76-91, 2004
4 ANSI, 'Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm( ECDSA),' ANSI x9.62, 1988
5 Soonhak Kwon, Chang Hoon Kim and Chun Pyo Hong, 'Efficient Exponentiation for a Class of Finite Fields Determined by Gauss Periods,' CHES 03, LNCS, pp. 228-242
6 A. Reyhani-Masloeh and M.A. Hasan, 'Efficient multiplication beyond optimal normal bases,' IEEE Trans. on Computers, Vol. 52, pp. 428-439, 2003   DOI   ScienceOn
7 J.L. Massey and J.K. Omura, 'Computational method and apparatus for finite field arithmetic,' US Patent no. 458627, 1986
8 NIST, 'Digital Signature Standard,' FIPS Publication, 186-2, February, 2000
9 정석원, 윤중철, 이선옥 'GF($2^{n}$)에서의 직렬- 병렬 곱셈기 구조', 정보보호학회지, 제 13권 3 호, pp.27-34, 2003.6
10 A. Reyhani-Masloeh and M.A. Hasan, 'Efficient Digit-Serial Normal Basis Multipliers over Binary Extension Fields,' ACM Trans. on Embedded Computing Systems(TECS), Special Issue on Embedded Systems and Security, pp.575- 592, Vol.3, Issue 3, August 2004   DOI
11 S. Gao, 'Normal Bases over Finite Fields,' A thesis for Doctor of Philosophy, 1993
12 G.B. Agnew, R.C. Mullin, I. Onyszchuk, and S.A. Vanstone, 'An implementation for a fast public key cryptosystem,' J. Cryptology, Vol.3, pp.63-79, 1991
13 H. Wu, M.A. Hasan, I.F. Blake, and S. Gao, 'Finite field multiplier using redundant representation,' IEEE. Trans. Computers, Vol 51, pp. 1306-1316, 2002   DOI   ScienceOn
14 A. Reyhani-Masloeh and M.A. Hasan, 'Low Complexity Word-Level Sequential Normal Basis Multipliers,' IEEE Trans. on Computers, pp 98-110, Vol. 54, no. 2, February 2005   DOI   ScienceOn
15 E.R. Berlekamp, 'Bit-serial Reed-Solomon encoders,' IEEE Trans. Imform. Theory, Vol. 28, pp. 869-874, 1982   DOI   ScienceOn
16 A. Reyhani-Masloeh and M.A. Hasan, 'A new construction of Massey-Omura parallel multiplier over GF($2^{m}$),' IEEE Trans. Computers, Vol. 51, pp. 511-520, 2002   DOI   ScienceOn