Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
Cellular Automata Based Cryptosystem (CAC)
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Hierarchical Cellular Automata As An On-Chip Test Pattern Generator
VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
Design Of Multiple Attractor Gf (2p) Cellular Automata For Diagnosis Of Vlsi Circuits
VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Analysis of complemented CA derived from linear hybrid group CA
Computers & Mathematics with Applications
Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA
Mathematical and Computer Modelling: An International Journal
Analysis of 90/150 Two Predecessor Nongroup Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Analysis of Linear Group GF(2p) Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Characterization of CA rules for SACA targeting detection of faulty nodes in WSN
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Hi-index | 0.00 |
In this paper, we analyze behaviors of state transitions of a linear Single Attractor Cellular Automata(SACA) C and the complemented SACA C′ derived from C over Galois Field GF(2p) And we propose the algorithm for the construction of the state transition diagram of C and C′ over GF(2p) by using the new concept of basic path These results extend the results over GF(2) of Cho et al for SACA.