2010/06/09 by Amparo Fúster-Sabater, Fúster-Sabater, Amparo, Dolores de la Gu' ia-Martínez +2
Biochemistry, Genetics and Molecular Biology · Computer Science · #11T71 #14G50 #94A60 #Cellular Automata and Applications #Coding theory and cryptography #Cryptography and Security (cs.CR) #DNA and Biological Computing #Discrete Mathematics (cs.DM) #E.3 #F.1.1 #FOS: Computer and information sciences #acm:11T71 #acm:14G50 #acm:94A60 #cs.CR #cs.DM #msc:11T71 #msc:14G50 #msc:94A60
paper · pdf · doi:10.48550/arxiv.1006.1755
10 pages, 0 figures
arxiv created 2010/06/09 · openalex publication_date 2010/06/09 · arxiv updated 2010/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Structural properties of two well-known families of keystream generators, Shrinking Generators and Cellular Automata, have been analyzed. Emphasis is on the equivalence of the binary sequences obtained from both kinds of generators. In fact, Shrinking Generators (SG) can be identified with a subset of linear Cellular Automata (mainly rule 90, rule 150 or a hybrid combination of both rules). The linearity of these cellular models can be advantageously used in the cryptanalysis of those keystream generators.