Modelling the shrinking generator in terms of linear CA

This work analyses the output sequence from a cryptographic non-linear generator, the so-called shrinking generator. This sequence, known as the shrunken sequence, can be built by interleaving a unique PN-sequence whose characteristic polynomial serves as basis for the shrunken sequence's characteristic polynomial. In addition, the shrunken sequence can be also generated from a linear model based on cellular automata. The cellular automata here proposed generate a family of sequences with the same properties, period and characteristic polynomial, as those of the shrunken sequence. Moreover, such sequences appear several times along the cellular automata shifted a fixed number. The use of discrete logarithms allows the computation of such a number. The linearity of these cellular automata can be advantageously employed to launch a cryptanalysis against the shrinking generator and recover its output sequence.

[1]  Amparo Fúster-Sabater,et al.  Performance of the Cryptanalysis over the Shrinking Generator , 2015, CISIS-ICEUTE.

[2]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[3]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[4]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[5]  Dipanwita Roy Chowdhury,et al.  CAR30: A new scalable stream cipher with rule 30 , 2012, Cryptography and Communications.

[6]  P. Pal Chaudhuri,et al.  Efficient characterisation of cellular automata , 1990 .

[7]  Willi Meier,et al.  Analysis of Pseudo Random Sequence Generated by Cellular Automata , 1991, EUROCRYPT.

[8]  Jon C. Muzio,et al.  Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q) , 1996, IEEE Trans. Computers.

[9]  Hideki Imai,et al.  A fast and secure stream cipher based on cellular automata over GF(q) , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[10]  Hugo Krawczyk,et al.  The Shrinking Generator , 1994, CRYPTO.

[11]  Pino Caballero-Gil,et al.  Linear solutions for cryptographic nonlinear sequence generators , 2010, ArXiv.

[12]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[13]  Willi Meier,et al.  The Self-Shrinking Generator , 1994, EUROCRYPT.

[14]  Ali Kanso.  Modified self-shrinking generator , 2010, Comput. Electr. Eng..

[15]  Stephen Wolfram.  Cryptography with Cellular Automata , 1985, CRYPTO.

[16]  Amparo Fúster-Sabater,et al.  Linear Models for the Self-Shrinking Generator Based on CA , 2016, J. Cell. Autom..

[17]  Amparo Fúster-Sabater,et al.  Cryptanalysing the Shrinking Generator , 2015, ICCS.

[18]  P. F. Duvall,et al.  Decimation of Periodic Sequences , 1971 .

[19]  Dipanwita Roy Chowdhury,et al.  Inapplicability of Fault Attacks against Trivium on a Cellular Automata Based Stream Cipher , 2014, ACRI.

[20]  Pino Caballero-Gil,et al.  A simple linearization of the self-shrinking generator by means of cellular automata , 2010, Neural Networks.