论文信息 - Performance of the Cryptanalysis over the Shrinking Generator

Performance of the Cryptanalysis over the Shrinking Generator

The shrinking generator is a decimation-based nonlinear sequence generator with cryptographic application. Its output sequence can be modelled as one of the sequences generated by a linear cellular automata. Taking advantage of this linear structure, in this work a cryptanalysis of the shrinking generator has been introduced. The algorithm here developed recovers the secret key of the shrinking generator.

Amparo Fúster-Sabater | Sara D. Cardell

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

[2] Aggelos Kiayias,et al. Traceable Signatures , 2004, EUROCRYPT.

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

[4] Jon C. Muzio,et al. Synthesis of one-dimensional linear hybrid cellular automata , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

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

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

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

[10] Amparo Fúster-Sabater,et al. Modelling the shrinking generator in terms of linear CA , 2016, Adv. Math. Commun..