Browse > Article

A New Low-complexity Bit-parallel Normal Basis Multiplier for$GF(2^m) $ Fields Defined by All-one Polynomials  

장용희 (한국항공대학교 정보통신공학과)
권용진 (한국항공대학교 전자.정보통신.컴퓨터공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.31, no.1_2, 2004 , pp. 51-58 More about this Journal
Abstract
Most of pubic-key cryptosystems are built on the basis of arithmetic operations defined over the finite field GF$GF(2^m)$ .The other operations of finite fields except addition can be computed by repeated multiplications. Therefore, it is very important to implement the multiplication operation efficiently in public-key cryptosystems. We propose an efficient bit-parallel normal basis multiplier for$GF(2^m)$ fields defined by All-One Polynomials. The gate count and time complexities of our proposed multiplier are lower than or equal to those of the previously proposed multipliers of the same class. Also, since the architecture of our multiplier is regular, it is suitable for VLSI implementation.
Keywords
VLSI; Public-key cryptosystems; Finite fields GF($2^{m}$); Multiplication operation; All-One Polynomials; Normal basis; Multiplier; VLSI;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Reyhani-Masoleh and M.A. Hasan, 'A New Construction of Massey-Omura Parallel Multiplier over GF($2^m$),' IEEE Trans. Computers, vol. 51, no. 5, pp. 511-520, May 2002   DOI   ScienceOn
2 C.K. Koc and B. Sunar, 'Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finites Fields,' IEEE Trans. Computers, vol. 47, no. 3, pp. 353-356, Mar. 1998   DOI   ScienceOn
3 C.Y. Lee, E.H. Lu, and J.Y. Lee, 'Bit-Parallel Systolic Multipliers for GF($2^m$) Fields Defined by All-One and Equally Spaced Polynomials,' IEEE Trans. Computers, vol. 50, no. 5, pp. 385-393, May 2001   DOI   ScienceOn
4 T. Itoh and S. Tsujii, 'Structure of Parallel Multiplier for a Class of Fields GF($2^m$),' Information and Computation, vol. 83, pp. 21-40, 1989   DOI
5 H. Wu and M.A. Hasan, 'Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields,' IEEE Trans. Computers, vol. 47, no. 8, pp. 883-887, Aug. 1998   DOI   ScienceOn
6 R.C. Muffin, I.M. Onyszchuk, S. A. Vanstone, and R.M. Wilson, 'Optimal Normal Bases in GF($p^n$),' Discrete Applied Mathematics, vol. 22, pp. 149-161, 1988/89   DOI   ScienceOn
7 C.C. Wang, T.K. Truong, H.M. Shar, L.J. Deutsch, J.K. Omura, and I.S. Reed, 'VLSI Architecture for Computing Multiplications and Inverses in GF($2^m$),' IEEE Trans. Computers, vol. 34, no. 8, pp. 709-716, Aug. 1985   DOI   ScienceOn
8 M.A. Hasan, M.Z. Wang, and V.K. Bhargava, 'Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF($2^m$),' IEEE Trans. Computers, vol. 41, no. 8, pp. 962-971, Aug. 1992   DOI   ScienceOn
9 M.A. Hasan, M.Z. Wang, and V.K. Bhargava, 'A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields,' IEEE Trans. Computers, vol. 42, no. 10, pp. 1278-1280, Oct. 1993   DOI   ScienceOn