Evolving collective behavior of cellular automata for cryptography

Evolving collective behavior of cellular automata for cryptography

We consider 1D cellular automata (CA) and apply genetic algorithm (GA) to discover subsets of rules controlling CA cells, which collective behavior results in a high quality of pseudorandom number sequences (PNSs) suitable for symmetric key cryptography. The search of subsets of rules is performed i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Szaban, M., Seredynski, F., Bouvry, P.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Automatic control
Computer science
Genetic algorithms
Lattices
Public key
Public key cryptography
Safety
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider 1D cellular automata (CA) and apply genetic algorithm (GA) to discover subsets of rules controlling CA cells, which collective behavior results in a high quality of pseudorandom number sequences (PNSs) suitable for symmetric key cryptography. The search of subsets of rules is performed in a set of predefined rules. We discover new subsets of CA rules providing very high quality of PNSs, which can be used in cryptographic modules
ISSN:2158-8473
2158-8481
DOI:10.1109/MELCON.2006.1653219