The linear complexity of the self-shrinking generator

DOI10.1109/18.782139MaRDI QIDQ4503405zbMATH OpenOpenAlexFDO

Authors Simon R. Blackburn

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.782139

zbMATH Keywords

binary linear-feedback shift registerlinear complexityself-shrinking generatorstream cipher

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1088915
• scientific article; zbMATH DE number 820502
• Generalized Self-Shrinking Generator
• Two New Attacks on the Self-Shrinking Generator
• Modified self-shrinking generator

Cited in

(13)

• A simple linearization of the self-shrinking generator by means of cellular automata
• Shrinking generators based on \(\sigma \)-LFSRs
• Linear complexity of generalized sequences by comparison of PN-sequences
• Discrete linear models for the generalized self-shrunken sequences
• On the linear complexity profile of the power generator
• Generalization of the Self-Shrinking Generator in the Galois Field
• Generalized Self-Shrinking Generator
• scientific article; zbMATH DE number 1088915 (Why is no real title available?)
• scientific article; zbMATH DE number 2009965 (Why is no real title available?)
• scientific article; zbMATH DE number 820502 (Why is no real title available?)
• Analysis of the generalized self-shrinking generator
• A computational approach for the study of linear complexity of shrunken sequences
• Self-shrinking chaotic stream ciphers

This page was built for publication: The linear complexity of the self-shrinking generator

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