Browse > Article

Construction of Complemented Hybrid Group Cellular Automata with Maximum Equal Lengths  

Cho S.J. (부경대학교)
Choi U.S. (동명대학교)
Hwang Y.H. (부경대학교)
Kim J.G. (부경대학교)
Pyo Y.S. (부경대학교)
Kim H.D. (인제대학교)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.10, no.9, 2006 , pp. 1565-1572 More about this Journal
Abstract
Recently with the ever increasing growth of data communication, the need for security and privacy has become a necessity. The advent of wireless communication and other handheld devices like Personal Digital Assistants and smart cards have made the implementation of cryptosystems a major issue. The Cellular Automata(CA) can be programmed to implement hardware sharing between the encryption and decryption. In this paper, we give conditions for a linear hybrid cellular automata with 60, 102 or 204 to be a linear hybrid group cellular automata C. And we present the conditions which the complemented hybrid group cellular automata C' with complement vectors derived from C has maximum equal lengths in the state transition diagram of C' Also we analyze the relationship among cycles of C' These results generalize Mukhopadhyay's results.
Keywords
셀룰라 오토마타;선형 하이브리드 그룹 CA;여원 CA;전이규칙;상태전이행렬;여원벡터;주기;최소다항식;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
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, 1996, pp. 769-781   DOI   ScienceOn
2 S.J. Cho, U.S. Choi, H.D. Kim and Y.H. Hwang, Characterization of a class of the Complemented CA Derived from Linear Uniform Group CA, Submitted
3 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
4 S.J. Cho, U.S. Choi, Y.H. Hwang, H.D. Kim and Y.S. Pyo, Analysis of state-transition of SACA over $GF(2^{P})$, J. Kor. Info. Security and Cryptology, Vol. 15, 2005, pp.105-111   과학기술학회마을
5 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, 2004, pp. 31-39
6 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, 1996, pp. 325-335   DOI   ScienceOn
7 A.K. Das and P.P. Chaudhuri, Efficient characterization of cellular automata, Proc. IEE(Part E), Vol. 137, 1990, pp.81-87
8 S. Nandi, B.K. Kar and P.P. Chaudhuri, Theory and applications of cellular automata in cryptography, IEEE Trans. Computers, Vol. 43, 1994, pp. 1346-1357   DOI   ScienceOn
9 S. Nandi and P.P. Chaudhuri, Analysis of periodic and intermediate boundary 90/150 cellular automata, IEEE Trans. Computers, Vol. 45, 1996, pp. 1-12
10 D. Mukhopadhyay and D.R. Chowdhury, Characterization of a Class of Complemented Group Cellular Automata, LNCS, Vol. 3305, 2004, pp. 775-784
11 S.J. Cho, U.S. Choi, and H.D. Kim, Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA, Mathematical and Computer modelling, Vol. 36, 2002, pp. 979-986   DOI   ScienceOn
12 K. Cattell and J. Muzio, Analysis of one-dimensional linear hybrid cellular automata over GF(q), IEEE Transactions of Computers, Vol. 45, 1996, pp. 782-792   DOI   ScienceOn
13 S.J. Cho, U.S. Choi, and H.D. Kim, Analysis of complemented CA derived from a linear TPMACA, Computers and Mathematics with Applications, Vol. 45, 2003, pp. 689-698   DOI   ScienceOn
14 B. Elspas, The Theory of autonomous linear sequential networks, TRE Trans. on Circuits Vol. CT-6, 1959, pp. 45-60
15 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, 1993, pp. 340-352   DOI   ScienceOn