Analysis of one-dimensional linear hybrid cellular automata over GF(q)

DOI10.1109/12.508317zbMath1055.68548OpenAlexW1988514506MaRDI QIDQ4420876

Kevin Cattell, J. C. Muzio

Publication date: 1996

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.508317

zbMATH Keywords

linear finite state machines

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (16)

CASca:A CA Based Scalable Stream Cipher ⋮ Error correcting codes via reversible cellular automata over finite fields ⋮ On the use of cellular automata in symmetric cryptography ⋮ Analysis of pseudo-noise sequences generated by null boundary cellular automata ⋮ Modelling the shrinking generator in terms of linear CA ⋮ Preventing Fault Attacks Using Fault Randomization with a Case Study on AES ⋮ Unnamed Item ⋮ On determinantal varieties of Hankel matrices ⋮ Glider Collisions in Hybrid Cellular Automaton with Memory Rule (43,74) ⋮ Achieving Better Security Using Nonlinear Cellular Automata as a Cryptographic Primitive ⋮ Unnamed Item ⋮ BLOCK TRANSFORMATION OF HYBRID CELLULAR AUTOMATA ⋮ Analysis of complemented CA derived from a linear TPMACA. ⋮ Modelling nonlinear sequence generators in terms of linear cellular automata ⋮ (Imperfect) strategies to generate primitive polynomials over GF(2) ⋮ CArrency: an energy-efficient proof-of-work scheme for crypto-currencies

This page was built for publication: Analysis of one-dimensional linear hybrid cellular automata over GF(q)