Browse > Article

Modular Multiplier based on Cellular Automata Over $GF(2^m)$  

이형목 ((주) 모빌랩 연구원)
김현성 (경일대학교 컴퓨터공학)
전준철 (경북대학교 컴퓨터공학)
유기영 (경북대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.31, no.1_2, 2004 , pp. 112-117 More about this Journal
Abstract
In this paper, we propose a suitable multiplication architecture for cellular automata in a finite field $GF(2^m)$. Proposed least significant bit first multiplier is based on irreducible all one Polynomial, and has a latency of (m+1) and a critical path of $ 1-D_{AND}＋1-D{XOR}$.Specially it is efficient for implementing VLSI architecture and has potential for use as a basic architecture for division, exponentiation and inverses since it is a parallel structure with regularity and modularity. Moreover our architecture can be used as a basic architecture for well-known public-key information service in $GF(2^m)$ such as Diffie-Hellman key exchange protocol, Digital Signature Algorithm and ElGamal cryptosystem.
Keywords
Finite field; Public-key cryptography; Cellular automata; multiplication architecture; Irreducible polynomial;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. E. R. Denning, Cryptography and data security Reading, MA: Addison-Wesley, 1983
2 R. L. Rivest, A. Shamir, and L. Adleman, 'A Method for Obtaining Digital Signatures and Public-key Cryptosystems,' Comm AMC Vol. 21, pp.120-126, 1978   DOI   ScienceOn
3 E. R. Berlekamp, Algebraic Coding Theory, New York: McGraw-Hill, 1986
4 R. J. McEliece, Finite fields for Computer Scientists and Engineers, New York: Kluwer-Academic, 1987
5 C. S. Yeh. S. Reed, and T. K. Truong, 'Systolic multipliers for finite fields (2$^m$),' IEEE Trans. on Computers. Vol. 33, pp.357-360, Apr. 1984   DOI   ScienceOn
6 S. K. Jain and L. Song, 'Efficient Semi systolic Architectures for finite field Arithmetic,' IEEE Trans. on VLSI Systems, Vol. 6, No.1, Mar. 1998   DOI   ScienceOn
7 J. L. Massey and J. K. Omura, Computational method and apparatus for finite field arithmetic, U. S. Patent application, submitted 1981
8 S. W. Wei, 'A systolic power-sum circuit for GF($(2^m)$),' IEEE Trans. Comput., Vol. 43, pp.226-229, Feb. 1994   DOI   ScienceOn
9 T. Itoh and S. Tsujii, 'Structure of parallel multipliers for a class of finite fields GF(2m),' Info. Camp. Vol. 83, pp.21-40, 1989   DOI
10 M. A. Hasan, M. Z. Wang and V. K. Bhargava, 'Modular Construction of low complexity parallel multipliers for a class of finite fields GF(2m),' IEEE Trans. on Computers. Vo1.8. pp.962-971, Aug. 1992   DOI   ScienceOn
11 J. V. Newmann, The theory of self-reproducing automata, Univ. of lllinois Press, Urbana (London, 1966
12 S. T. J. Fenn et ai, 'Bit-serial Multiplication in GF(2$^m$) using irreducible all one polynomials,' lEE. Proc. Comput. Digit. Tech, Vol. 144. ·No. 6. Nov. 1997
13 P. P. Choudhury, 'Cellular Automata Based VLSI Architecture for Computing Multiplication And Inverses In GF($GF(2^m)$),' IEEE 7th International Conference on VLSI Design, pp.279-282. Jan. 1994   DOI