A simple linearization of the self-shrinking generator by means of cellular automata.
other · Level V
Where this comes from
- Record sourced from PubMed, PMID 20060262.
- Also identified by DOI 10.1016/j.neunet.2009.12.008.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
In this work, it is shown that the output sequence of a well-known cryptographic generator, the so-called self-shrinking generator, can be obtained from a simple linear model based on cellular automata. In fact, such a cellular model is a linear version of a nonlinear keystream generator currently used in stream ciphers. The linearization procedure is immediate and is based on the concatenation of a basic structure. The obtained cellular automata can be easily implemented with FPGA logic. Linearity and symmetry properties in such automata can be advantageously exploited for the analysis and/or cryptanalysis of this particular type of sequence generator.
Medical subject headings
- Linear Models
- Neural Networks, Computer