Computing Phase Shifts of Maximum-Length 90/150 Cellular Automata Sequences
From MaRDI portal
Publication:5464109
DOI10.1007/978-3-540-30479-1_4zbMath1116.68506OpenAlexW1580306028MaRDI QIDQ5464109
Yong-Soo Pyo, Yoon-Hee Hwang, Kwang S. Kim, Un-Sook Choi, Han-Doo Kim, Seong-Hun Heo, Sung Jin Cho
Publication date: 17 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-30479-1_4
Related Items (9)
On the use of cellular automata in symmetric cryptography ⋮ Modelling nonlinear sequence generators in terms of linear cellular automata ⋮ Analysis of 90/150 Two Predecessor Nongroup Cellular Automata ⋮ Analysis of Linear Group GF(2 p ) Cellular Automata ⋮ Nonlinear Pseudorandom Sequences Based on 90/150 LHGCA ⋮ Analysis of complemented CA derived from linear hybrid group CA ⋮ Design of new XOR-based hash functions for cache memories ⋮ A simple linearization of the self-shrinking generator by means of cellular automata ⋮ Synthesis of cryptographic interleaved sequences by means of linear cellular automata
This page was built for publication: Computing Phase Shifts of Maximum-Length 90/150 Cellular Automata Sequences
