Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
Hierarchical Cellular Automata As An On-Chip Test Pattern Generator
VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Behaviors of single attractor cellular automata over galois field GF(2p)
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
New Synthesis of One-Dimensional 90/150 Linear Hybrid Group Cellular Automata
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.01 |
Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. And CA has been used to model many physical systems. While studying the models of such systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we give the characterization of linear group GF(2p) CA. Especially we analyze the relationship between characteristic polynomial and transition rule of linear group GF(2p) CA.