Browse > Article

(Design of New Architecture for Simultaneously Computing Multiplication and Squaring over $GF(2^m)$ based on Cellular Automata)  

Gu, Gyo-Min (대구교육대학교)
Ha, Gyeong-Ju (경산대학교 정보과학부)
Kim, Hyeon-Seong (경일대학교 컴퓨터공학)
Yu, Gi-Yeong (경북대학교 컴퓨터공학)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SC / v.39, no.3, 2002 , pp. 211-219 More about this Journal
Abstract
In this paper, a new architecture that can simultaneously process modular multiplication and squaring on GF(2$^{m}$ ) in m clock cycles by using the cellular automata is presented. This can be used efficiently for the design of the modular exponentiation on the finite field which is the basic computation in most public key crypto systems such as Diffie-Hellman key exchange, EIGamal, etc. Also, the cellular automata architecture is simple, regular, modular, cascadable and therefore, can be utilized efficiently for the implementation of VLSI.
Keywords
modular multiplication; modular squaring; crytosystem; cellular automata;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R.J. McEliece, Finite Fields for Computer Scientists and Engineerings, New York: Kluwer Academic, 1987
2 W. Diffie and M.E. Hellman, 'New directions in cryptography,' IEEE Trans. on information theory, vol. 22, pp. 644-654, November 1976   DOI
3 A.J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, 1993
4 C.-S. YEH, IRVING S. REED, T.K. TRUONG, 'Systolic Multipliers for Finite Fields $GF(2^m)$,' IEEE Trans. on computers, vol. C-33, no. 4, pp. 357-360, April 1984   DOI   ScienceOn
5 T. ElGamal, 'A public key cryptosystem and a signature scheme based on discrete logarithms,' IEEE Trans. on information theory, vol. 31(4), pp. 469-472, July 1985   DOI
6 P.L. Montgomery, 'Modular multiplication without trial division,' Mathematics of Computation, 44(170) : 519-521, April 1985   DOI
7 M. Delorme, J. Mazoyer, Cellular Automata, KLUWER ACADEMIC PUBLISHERS, 1999
8 STEPHEN WOLFRAM, Cellular Automata and Complexity, Addison-Wesly Publishing Company, 1994
9 C.L. Wang, J.L. Lin, 'Systolic Array Implementation of Multipliers for Finite Fields GF(2m),' IEEE Trans. on circuits and systems, vol. 38, no. 7, pp. 796-800, July 1991   DOI   ScienceOn
10 C.Parr, 'Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents,' IEEE Trans. on computers, vol. 48, no. 10, pp. 1025-1034, October 1999   DOI   ScienceOn
11 P.P. Choudhury, R. Barua, 'Cellular Automata Based VLSI Architecture for Computing Multiplication And Inverse In GF(2m),' IEEE Proceeding of the 7th International Conference on VLSI Design, pp. 279-282, January 1994   DOI
12 ELWYN R. BERLEKAMP, 'Bit-Serial Reed-Solomon Encoders,' IEEE Trans. on information theory, vol. IT-28, no. 6, pp. 869-874, November 1982   DOI
13 Knuth, THE ART OF COMPUTER PROGRAMMING, vol. 2/Seminumerical Algorithms, ADDISON-WESLEY, 1969