Computer Science – Cryptography and Security
Scientific paper
2010-05-13
Applied Mathematical Modelling. Volume 31, Issue 2, pp. 226-235. February 2007.
Computer Science
Cryptography and Security
15 pages, 0 figures
Scientific paper
10.1016/j.apm.2005.08.013
In this work, a wide family of LFSR-based sequence generators, the so-called Clock-Controlled Shrinking Generators (CCSGs), has been analyzed and identified with a subset of linear Cellular Automata (CA). In fact, a pair of linear models describing the behavior of the CCSGs can be derived. The algorithm that converts a given CCSG into a CA-based linear model is very simple and can be applied to CCSGs in a range of practical interest. The linearity of these cellular models can be advantageously used in two different ways: (a) for the analysis and/or cryptanalysis of the CCSGs and (b) for the reconstruction of the output sequence obtained from this kind of generators.
Fúster-Sabater Amparo
la Guía-Martínez Dolores de
No associations
LandOfFree
Modelling Nonlinear Sequence Generators in terms of Linear Cellular Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Modelling Nonlinear Sequence Generators in terms of Linear Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modelling Nonlinear Sequence Generators in terms of Linear Cellular Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-640440