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

Cellular Automata based on VLSI architecture over GF($2^m$)  

전준철 (경북대학교 컴퓨터공학과 정보보호연구실)
김현성 (경일대학교 컴퓨터공학과)
이형목 (경북대학교 컴퓨터공학과 정보보호연구실)
유기영 (경북대학교 컴퓨터공학과 정보보호연구실)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.12, no.3, 2002 , pp. 87-94 More about this Journal
Abstract
This study presents an MSB(Most Significant Bit) Int multiplier using cellular automata, along with a new MSB first multiplication algorithm over GF($2^m$). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of a PBCA(Periodic Boundary Cellular Automata) and with the property of irreducible AOP(All One Polynomial). The proposed multiplier can be used in the effectual hardware design of exponentiation architecture for public-key cryptosystem.
Keywords
public-key cryptosystem; standard basis; cellular automata; AOP(All One Polynomial); Most Significant Bit first multiplication;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. R. Berlekamp, Bit-serial Reed-Solomon encoders, IEEE Trans. IT-28, Vol. 6, pp. 869-874. 1982
2 W. Drescher, K. Bachmann, and G. Fettweis, VLSI Architecture for Non Sequential Inversion over GF($2^{rn}$) using the Euclidean Algorithm, The International Conference on Signal Processing Applications and Technotogy, Vol. 2, pp. 1815-1819, 1997
3 C. K. Koc and B. Sunar, Low complexity Bit-parallel Canonical and Normal basis Multipliers for a class of finite fields. IEEE Trans. Comp.. Vol. 47, No. 3 pp. 353-356, 1998   DOI   ScienceOn
4 T. R. N. Rao and E. Fujiwara, Error-Control Coding for Computer Systems, Engle-wood Cliffs. NJ: Prentice-Hall. 1989
5 D. D. Gajski, Principtes of Digitcd Design, Prentice-Hall International, Inc., 1997
6 J. Von Neumann, The theory of seIf-reproducng automata, University of Illinois Press, Urbana and London, 1966
7 A. K. Das, P. Pal, Chaudhuri. Efficient characterization of cellular automata, IEE Proceedings. Vol. 137. Part. E, pp. 81-87, January 1990
8 C. N. Zhang and M. Y. Deng, and R. Mason, A VLSI Programmable Cellular Automata Array for Multiplication in GF($2^{rn}$), PDPTA 99 Memational Conference
9 K. Hwang, Computer Arithmetic Principles, Architectures, and Design, John Wiley & Sons, 1979
10 P. Pal. Choudhury and R. Barua, Cellular Automata Based VLSI Architecture for Computing Multiplication And Inverses In GF($2^{rn}$), IEEE 7th International Conference on VLSI Design, pp. 279-282, 1994
11 T. Itoh and S. Tsmii. Structure of Parallel Multipliers for a Class of Fields GF($2^{rn}$), Information and Computation 83, pp. 21-40 1989   DOI
12 S. T. J. Fenn, M. G. Parker, M. Benaissa, and D. Tayler, Bit-serial multiplication in GF($2^{rn}$) using irreducible all-one opolynomial, IEEE Proc. Corrput. Digit Tech., Vol. 144, No. 6, pp. 391-393, 1997   DOI   ScienceOn
13 C. H. Liu, N. F. Huang, and C. Y Lee, Computation of AB2 Multiplier in GF($2^{rn}$) Using an Efficient Low-Complexity Cellular Architecture, IEICE Trans. Fun dctmentals, Vol. E83-A, No. 12, pp. 2657-2663, 2000
14 Lidl R., and Niderreiter H.. An intro-duction to finite fietd and their apptications, CUP, Cambridge, 1986