One-dimensional cellular automata and shrinking generators for pseudorandom sequence generation

dc.contributor.authorSheikh, Nafeesa
dc.contributor.supervisorGulliver, Aaron
dc.date.accessioned2025-08-14T22:10:49Z
dc.date.available2025-08-14T22:10:49Z
dc.date.issued2025
dc.degree.departmentDepartment of Electrical and Computer Engineering
dc.degree.levelMaster of Applied Science MASc
dc.description.abstractLinear 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.
dc.description.scholarlevelGraduate
dc.identifier.urihttps://hdl.handle.net/1828/22591
dc.languageEnglisheng
dc.language.isoen
dc.rightsAvailable to the World Wide Web
dc.titleOne-dimensional cellular automata and shrinking generators for pseudorandom sequence generation
dc.typeThesis

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Nafeesa_Sheikh_MASc_2025.pdf.pdf
Size:
343.51 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description: