Binomial representation of cryptographic binary sequences and its relation to cellular automata

DOI10.1155/2019/2108014zbMath1421.94029OpenAlexW2922621913WikidataQ128148049 ScholiaQ128148049MaRDI QIDQ2325113

Sara D. Cardell, Amparo Fúster-Sabater

Publication date: 9 September 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/2108014

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Dynamical aspects of cellular automata (37B15)

Related Items

On the dynamics of semilattice networks, Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions, Counting periodic points in parallel graph dynamical systems, Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs, Linear complexity of generalized sequences by comparison of PN-sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modified self-shrinking generator
• Parallel discrete dynamical systems on maxterm and minterm Boolean functions
• Parallel dynamical systems over graphs and related topics: a survey
• Shift Register Sequences – A Retrospective Account
• Generalized Self-Shrinking Generator
• Shift-register synthesis and BCH decoding