Modelling of Complex Cryptographic Systems in Terms of Simple Cellular Automata

DOI10.1007/11751540_61MaRDI QIDQ5505360zbMATH OpenOpenAlexFDO

Authors M. Eugenia Pazo-Robles, Amparo Fúster-Sabater, Pino Caballero-Gil

Publication date 27 January 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751540_61

zbMATH Keywords

cryptographylinear cellular automatanonlinear sequence generator

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Cryptography (94A60)

Recommendations

• On the use of cellular automata in symmetric cryptography
• Chaotic cellular automata with cryptographic application
• Efficient Application of Hybrid 150/90 Cellular Automata to Symmetric Cryptography
• Cellular automata in stream ciphers
• A cellular automata based method for predicting binary sequences

Cited in

(11)

• Binomial representation of cryptographic binary sequences and its relation to cellular automata
• Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations
• A cellular automata based method for predicting binary sequences
• Nonlinearities on cryptographic shift registers
• Chaotic cellular automata with cryptographic application
• Finite State Machine Modelling of Cryptographic Systems in Loops
• Nonuniform cellular automata for cryptography
• Efficient Application of Hybrid 150/90 Cellular Automata to Symmetric Cryptography
• Synthesis of cryptographic interleaved sequences by means of linear cellular automata
• On the use of cellular automata in symmetric cryptography
• Evolving cellular automata rules for multiple-step-ahead prediction of complex binary sequences

This page was built for publication: Modelling of Complex Cryptographic Systems in Terms of Simple Cellular Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505360)