Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata

DOI10.1007/978-3-642-15979-4_26zbMath1307.94051OpenAlexW1565118810MaRDI QIDQ4931214

No author found.

Publication date: 4 October 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15979-4_26

Mathematics Subject Classification ID

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

Related Items (1)

One-dimensional cellular automata with random rules: longest temporal period of a periodic solution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random sequence generation by cellular automata
• On the generation of high-quality random numbers by two-dimensional cellular automata
• Analysis of Pseudo Random Sequences Generated by Cellular Automata
• Analysis of periodic and intermediate boundary 90/150 cellular automata

This page was built for publication: Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata