Abstract
In this paper a new procedure has been proposed to synthesize cellular automata (CA) with hybrid rulesets which are very well suited for designing cryptographic primitives. These rulesets are analyzed with respect to nonlinearity, algebraic degree, d-monomial test etc. A new graph theoretic property has also been proposed to analyze the cryptographic strength of cellular automata rules. The randomness of the sequences generated by the rulesets has been tested by NIST test-suite. The experimental results are compared with the existing related works and have shown to be out-performed. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Chakraborty, K., & Chowdhury, D. R. (2012). CSHR: Selection of cryptographically suitable hybrid cellular automata rule. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 591–600). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
