Abstract
The present paper characterizes a specific class of complemented group cellular automata (CA). The CA rule referred to as the fundamental transformation divides the entire state space into smaller spaces of equal lengths. Some interesting properties of this particular Cellular Automata have been analyzed. The relations developed promise the development of agreement theorems which shall be useful in constructing key agreement algorithms. © Springer-Verlag 2004.
Cite
CITATION STYLE
Mukhopadhyay, D., & Chowdhury, D. R. (2004). Characterization of a class of complemented group cellular automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3305, 775–784. https://doi.org/10.1007/978-3-540-30479-1_80
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
