Discrete linear models for the generalized self-shrunken sequences
From MaRDI portal
Publication:2401965
DOI10.1016/j.ffa.2017.06.010zbMath1373.94906OpenAlexW2734798129MaRDI QIDQ2401965
Sara D. Cardell, Amparo Fúster-Sabater
Publication date: 5 September 2017
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2017.06.010
cellular automatacharacteristic polynomialdecimationgeneralized self-shrinking generatormodified self-shrinking generator
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Cellular automata (computational aspects) (68Q80)
Related Items
On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\), List decoding of convolutional codes over integer residue rings, Linear complexity of generalized sequences by comparison of PN-sequences, Multidimensional linear complexity analysis of periodic arrays
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modelling the shrinking generator in terms of linear CA
- Analysis of the generalized self-shrinking generator
- 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
- Generalized Self-Shrinking Generator
- A new family of almost difference sets and some necessary conditions
- Understanding Cryptography
- The linear complexity of the self-shrinking generator
- Shift-register synthesis and BCH decoding