Recovering decimation-based cryptographic sequences by means of linear CAs

DOI10.1093/JIGPAL/JZZ051MaRDI QIDQ5082334zbMATH OpenOpenAlexFDO

Authors Sara D. Cardell, Diego F. Aranha, Amparo Fúster-Sabater

Publication date 16 June 2022

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1802.02206, https://pure.au.dk/portal/da/publications/recovering-decimationbased-cryptographic-sequences-by-means-of-linear-cas(fdabf223-0820-4627-83fb-529e42831f7a).html

zbMATH Keywords

cellular automatacryptanalysisshrinking generatordecimationZech logarithm

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80)

Abstract: The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata. These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an algorithm that takes advantage of the inherent linearity of these cellular automata and the interleaved m-sequences. Although irregularly decimated generators have been conceived and designed as non-linear sequence generators, in practice they can be easily analysed in terms of simple linear structures.

Recommendations

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

Cited in

(9)

• Linear models for the self-shrinking generator based on CA
• Cryptography with shrinking generators. Fundamentals and applications of keystream sequence generators based on irregular decimation
• Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator
• On binary linear codes and binary pseudo-random sequences
• Cellular automata as generators of interleaving sequences
• Discrete linear models for the generalized self-shrunken sequences
• A computational approach for the study of linear complexity of shrunken sequences
• Linear solutions for irregularly decimated generators of cryptographic sequences
• Modelling the shrinking generator in terms of linear CA

This page was built for publication: Recovering decimation-based cryptographic sequences by means of linear CAs

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