Abstract
The equivalence between the binary sequences obtained from a particular kind of keystream generator, the shrinking generator, and those ones generated from cellular automata has been studied. The class of shrinking generators can be identified with a subset of one-dimensional linear hybrid cellular automata with rules 90 and 150. A cryptanalytic approach based on the phaseshift of cellular automata output sequences is proposed. From the obtained results, we can create linear cellular automata-based models to cryptanalyze the class of keystream generators.
Author supplied keywords
Cite
CITATION STYLE
Fúster-Sabater, A., & De La Guía-Martínez, D. (2003). Keystream generator analysis in terms of cellular automata. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2773 PART 1, pp. 1199–1206). Springer Verlag. https://doi.org/10.1007/978-3-540-45224-9_162
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
