Cryptography primitives based on a cellular automaton

MaRDI QIDQ4485877zbMATH OpenFDO

Authors Jesús Urías

Publication date 20 June 2000

zbMATH Keywords

cellular automatoncryptographycryptosystemspermutationspseudorandom sequences

Mathematics Subject Classification ID

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

Recommendations

• A cryptosystem based on cellular automata
• Nonuniform cellular automata for cryptography
• On the use of cellular automata in symmetric cryptography
• Synchronization in cellular automata and applications to cryptography
• Parallel Processing and Applied Mathematics

Cited in

(10)

• Cryptographic primitives based on cellular transformations
• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• Block cipher based on reversible cellular automata
• A cryptosystem based on cellular automata
• 1-resiliency of bipermutive cellular automata rules
• Cryptoresistant generator of binary key sequences on the basis of cellular automata
• Synchronization in cellular automata and applications to cryptography
• A Walsh exploration of elementary CA rules
• A Cryptosystem Based on the Composition of Reversible Cellular Automata
• Secure and computationally efficient cryptographic primitive based on cellular automaton

This page was built for publication: Cryptography primitives based on a cellular automaton

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