Browse > Article

Synthesis of 90/150 Uniform CA and Computation of Characteristic Polynomial corresponding to uniform CA  

Choi, Un-Sook (동명대학교 미디어공학과)
Cho, Sung-Jin (부경대학교 응용수학과)
Yim, Ji-Mi (부경대학교 응용수학과)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.5, no.1, 2010 , pp. 10-16 More about this Journal
Abstract
90/150 CA is a CA completely specified by using rule 90 and rule 150. Since 90/150 CA whose minimal and characteristic polynomials are identical has outstanding randomness, this CA is more attractive than LFSR. Sarkar proposed a scheme based on the 90 uniform CA and the 150 uniform CA. That scheme provided authentication by digital signature and other basic security requirements like confidentiality. In this paper we analyze 90 or 150 uniform CA and give a synthesis method of 2n-cell uniform CA and (2n+1)-cell uniform CA using a special n-cell 90/150 CA. And we propose an effective method of computation of characteristic polynomial corresponding to uniform CA.
Keywords
uniform CA; 90/150 CA;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Chakraborty, D.R. Chowdhury, P.P. Chaudhuri, "Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines," IEEE Trans. Computers, Vol. 45, pp. 769-781, 1996.   DOI   ScienceOn
2 S. Nandi and P.P. Chaudhuri, "Analysis of periodic and intermediate boundary 90/150 cellular automata," IEEE Trans. Computers, Vol. 45, pp. 1-12, 1996.
3 S.J. Cho, U.S. Choi, Y.H. Hwang, Y.S. Pyo, H.D. Kim and S.H. Heo, "Computing Phase Shifts of Maximum-Length 90/150 Cellular Automata Sequences," LNCS, Vol. 3305, pp. 31-39, 2004.
4 K. Cattell and J. Muzio, "Analysis of one-dimensional linear hybrid cellular automata over GF(q)," IEEE Transactions of Computers, Vol. 45, pp. 782-792, 1996.   DOI   ScienceOn
5 K. Cattell and J. Muzio, "Synthesis of one-dimensional linear hybrid cellular automata," IEEE Transactions on Computer-Aided Design of Integrated Circuit and Systems, Vol. 15, pp. 325-335, 1996.   DOI   ScienceOn
6 S.J. Cho, U.S. Choi, H.D. Kim and Y. H. Hwang, "New synthesis of one-dimensional 90/150 linear hybrid group cellular automata," IEEE Trans. Comput-Aided Des. Integr. Circuits Syst., Vol. 26(9), pp. 1720-1724, 2007.   DOI
7 S. Chattopadhyay, "Some studies on theory and application of additive cellular automata," PhD thesis, I.I.T., Kharagpur, India, 1995.
8 S.J. Cho, U.S. Choi, H.D. Kim and Y. H. Hwang, J.G. Kim, "Analysis of 90/150 Two Predecessor Nongroup Cellular Automata," ACRI 2008 LNCS Vol. 5191, pp. 128-135, 2008.
9 S.K. Sarkar, T. Karmakar, A. Kumar, K. Sharma, P.C. Pradhan and C. Puttamadappa, "A One Dimensional Cellular Automata based Security Sheme providing both Authentication and Confidentiality," IE(I) Journal-CP, Vol. 87, pp. 1-8, 2006.
10 S. Wolfram, O. Martin and A. M. Odlyzko, "Algebraic properties of cellular automata," Communications in Mathematical Physics, 3, pp. 219-258, 1984.
11 A.K. Das, "Additive Cellular Automata: Theory and Applications as a Built-In Self-Test Structure," Ph. D. Thesis, I.I.T. Kharagpur, India, 1990.
12 A.K. Das and P.P. Chaudhuri, "Efficient characterization of cellular automata," Proc. IEE(Part E), Vol. 137, pp. 81-87, 1990.
13 A.K. Das and P.P. Chaudhuri, "Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation," IEEE Trans. Comput., Vol. 42, pp. 340-352, 1993.   DOI   ScienceOn
14 S. Nandi, B.K. Kar and P.P. Chaudhuri, "Theory and applications of cellular automata in cryptography," IEEE Trans. Computers, Vol. 43, pp. 1346-1357, 1994.   DOI   ScienceOn