Predicting the shrinking generator with fixed connections

DOI10.1007/3-540-39200-9_20MaRDI QIDQ4434884zbMATH OpenFDO

Authors Patrik Ekdahl, Willi Meier, Thomas Johansson

Publication date 26 November 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2656/26560330.htm

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• Correlation analysis of the shrinking generator
• Modelling the shrinking generator in terms of linear CA
• The shrinking generator: some practical considerations
• On some properties of the shrinking generator
• Analysis of the generalized self-shrinking generator
• Cryptography and Coding
• Predicting truncated multiple recursive generators with unknown parameters
• Shrinking generators and statistical leakage
• Algebraic analysis of shrinking generator
• The linear complexity of the self-shrinking generator

Cited in

(7)

• Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator
• Fast Correlation Attacks: Methods and Countermeasures
• Distinguishing Stream Ciphers with Convolutional Filters
• How to Strengthen Pseudo-random Generators by Using Compression
• An Improved Fast Correlation Attack on Stream Ciphers
• The shrinking generator: some practical considerations
• Self-shrinking chaotic stream ciphers

This page was built for publication: Predicting the shrinking generator with fixed connections

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