Exploring the cellular automata phenomenology for cryptographic applications

The aim of the research presented in this paper is the development of a high-performance cryptoscheme with Cellular Automata (CA). As the development of cellular automata applications is generally an experimental effort, the research implies the exploration through simulation of the huge space of cellular automata local rules and global states. The experimental criteria of selection for local rules are presented with some examples, for two types of cryptographic schemes. An experimental hardware platform with FPGAs was afterwards use for prototyping the algorithms proposed for encryption and decryption.

[1]  E. Franti,et al.  Design of cellular automata hardware for cryptographic applications , 2004, 2004 International Semiconductor Conference. CAS 2004 Proceedings (IEEE Cat. No.04TH8748).

[2]  Klaus Sutner Classifying circular cellular automata , 1991 .

[3]  Santanu Chattopadhyay,et al.  Additive cellular automata : theory and applications , 1997 .

[4]  William Stallings,et al.  Cryptography and network security , 1998 .

[5]  Stephen Wolfram,et al.  Cellular Automata And Complexity , 1994 .