Cellular automata encryption method: description, evaluation and tests

Authors:
Lucian Milea;Mihail Teodorescu;Vlad Grosu;Orest Oltu
Affiliations:
Politehnica University of Bucharest, Bucharest, Romania;Politehnica University of Bucharest, Bucharest, Romania;Politehnica University of Bucharest, Bucharest, Romania;Politehnica University of Bucharest, Bucharest, Romania
Venue:
ISPACT'10 Proceedings of the 9th WSEAS international conference on Advances in e-activities, information security and privacy
Year:
2010

Citing 3
Cited 0

Reversibility of 2D cellular automata is undecidable

Physica D
Cellular automata: theory and experiment

Cellular automata: theory and experiment
Cryptography and Network Security (4th Edition)

Cryptography and Network Security (4th Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents the principles of a dynamic key encryption method based on cellular automaton type key generator. The reason of using a cellular automata model for this kind of application is mainly based on its high degree of parallelism and huge number of possible states. Cellular automata can be hardware implemented using hardware devices or circuits which permit such a level of parallelization, like the FPGAs. For research purposes, we evaluated the reliability and performances of such an encryption method and tested a complex implementation using a top level FPGA development board.