Cellular automata application to the linearization of stream cipher generators. (English) Zbl 1116.68512
Sloot, Peter M. A. (ed.) et al., Cellular automata. 6th international conference on cellular automata for research and industry, ACRI 2004, Amsterdam, The Netherlands, October 25–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23596-5/pbk). Lecture Notes in Computer Science 3305, 612-621 (2004).
Summary: A wide family of LFSR-based sequence generators, the so-called Clock-Controlled Shrinking Generators (CCSGs), has been analyzed and identified with a subset of linear cellular automata. In this way, sequence generators conceived and designed as complex nonlinear models can be written in terms of simple linear models. An easy algorithm to compute the pair of one-dimensional linear hybrid cellular automata that generate the CCSG output sequences has been derived. A cryptanalytic approach based on the phaseshift of cellular automata output sequences is sketched too. From the obtained results, we can create linear cellular automata-based models to analyze/cryptanalyze the class of clock-controlled generators.
For the entire collection see [Zbl 1063.68011].
For the entire collection see [Zbl 1063.68011].
