One-dimensional cellular automata and shrinking generators for pseudorandom sequence generation
Date
2025
Authors
Sheikh, Nafeesa
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). These pseudorandom sequences demonstrate desirable randomness properties such as balance, run, and autocorrelation while exhibiting low linear complexity. One-dimensional Cellular Automata (CA) are employed to produce m-sequences and pseudorandom sequences with high linear complexity and good randomness characteristics. This thesis explores the application of one-dimensional CA with shrinking generators to obtain sequences with high linear complexity and good randomness. Three types of shrinking generators are considered in this thesis. An analysis of the properties of the sequences obtained in relation to the corresponding m-sequences is given.