Cellular Automata based on VLSI architecture over GF() |
전준철
(경북대학교 컴퓨터공학과 정보보호연구실)
김현성 (경일대학교 컴퓨터공학과) 이형목 (경북대학교 컴퓨터공학과 정보보호연구실) 유기영 (경북대학교 컴퓨터공학과 정보보호연구실) |
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( |
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 | A. K. Das, P. Pal, Chaudhuri. Efficient characterization of cellular automata, IEE Proceedings. Vol. 137. Part. E, pp. 81-87, January 1990 |
7 | J. Von Neumann, The theory of seIf-reproducng automata, University of Illinois Press, Urbana and London, 1966 |
8 |
C. N. Zhang and M. Y. Deng, and R. Mason, A VLSI Programmable Cellular Automata Array for Multiplication in GF( |
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( |
11 | Lidl R., and Niderreiter H.. An intro-duction to finite fietd and their apptications, CUP, Cambridge, 1986 |
12 |
T. Itoh and S. Tsmii. Structure of Parallel Multipliers for a Class of Fields GF( |
13 |
C. H. Liu, N. F. Huang, and C. Y Lee, Computation of AB2 Multiplier in GF( |
14 |
S. T. J. Fenn, M. G. Parker, M. Benaissa, and D. Tayler, Bit-serial multiplication in GF( |