Linear solutions for cryptographic nonlinear sequence generators

DOI10.1016/J.PHYSLETA.2007.04.103zbMATH Open1209.94039arXiv1005.0058OpenAlexW1662125104WikidataQ61763367 ScholiaQ61763367MaRDI QIDQ715937FDOQ715937

Authors: Amparo Fúster-Sabater, Pino Caballero-Gil 

Publication date: 19 April 2011

Published in: Physics Letters. A (Search for Journal in Brave)

Abstract: This letter shows that linear Cellular Automata based on rules 90/150 generate all the solutions of linear difference equations with binary constant coefficients. Some of these solutions are pseudo-random noise sequences with application in cryptography: the sequences generated by the class of shrinking generators. Consequently, this contribution show that shrinking generators do not provide enough guarantees to be used for encryption purposes. Furthermore, the linearization is achieved through a simple algorithm about which a full description is provided.

Full work available at URL: https://arxiv.org/abs/1005.0058

Recommendations

• A simple linearization of the self-shrinking generator by means of cellular automata
• Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator
• Modelling the shrinking generator in terms of linear CA
• Linear solutions for irregularly decimated generators of cryptographic sequences
• Discrete linear models for the generalized self-shrunken sequences

zbMATH Keywords

cryptanalysispredictabilitychaotic automatanonlinear science

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Theory of cellular automata: a survey
• Title not available (Why is that?)
• Cryptography with chaos
• Chaotic encryption using discrete-time synchronous chaos
• Cryptography based on delayed chaotic neural networks
• A wide family of nonlinear filter functions with a large linear span
• Comments on L. J. García-Villalba and M. C. Rodríguez-Palánquex, A family of keystream generators with large linear complexity, Appl. Math. Lett. 14, No.5, 545-547 (2001; Zbl 0995.94031)
• Characteristic representation of elementary cellular automata

Cited In (6)

• Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discrete linear models for the generalized self-shrunken sequences
• Modelling the shrinking generator in terms of linear CA
• Криптографически слабые функции усложнения для трехчленных линейных рекуррентных последовательностей

This page was built for publication: Linear solutions for cryptographic nonlinear sequence generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715937)