Modelling the shrinking generator in terms of linear CA
From MaRDI portal
Publication:340171
DOI10.3934/amc.2016041zbMath1353.37026OpenAlexW2548161634MaRDI QIDQ340171
Sara D. Cardell, Amparo Fúster-Sabater
Publication date: 11 November 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016041
cellular automatacharacteristic polynomialshrinking generatorinterleaved PN-sequencesshrunken sequence
Polynomials in general fields (irreducibility, etc.) (12E05) Dynamical aspects of cellular automata (37B15) Automata sequences (11B85)
Related Items (3)
Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator ⋮ Discrete linear models for the generalized self-shrunken sequences ⋮ Multidimensional linear complexity analysis of periodic arrays
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modified self-shrinking generator
- Linear solutions for cryptographic nonlinear sequence generators
- A simple linearization of the self-shrinking generator by means of cellular automata
- CAR30: a new scalable stream cipher with rule 30
- Understanding Cryptography
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Analysis of one-dimensional linear hybrid cellular automata over GF(q)
- Shift-register synthesis and BCH decoding
- Decimation of Periodic Sequences
This page was built for publication: Modelling the shrinking generator in terms of linear CA