Cellular automata computations and secret key cryptography

Authors:
Franciszek Seredynski;Pascal Bouvry;Albert Y. Zomaya
Affiliations:
Polish-Japanese Institute of Information Technologies, Koszykowa 86, 02-008 Warsaw, Poland and Institute of Computer Science of Polish Academy of Sciences, Ordona 21, 01-237 Warsaw, Poland;Faculty of Sciences, Technology and Communication, Luxembourg University 6, rue Coudenhove Kalergi, L-1359 Luxembourg-Kirchberg, Luxembourg;School of Information Technologies, University of Sydney, Sydney, NSW 2006 Australia
Venue:
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Year:
2004

Citing 6
Cited 13

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Parallel Random Number Generation for VLSI Systems Using Cellular Automata

IEEE Transactions on Computers
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A brief history of cellular automata

ACM Computing Surveys (CSUR)
Handbook of Applied Cryptography

Handbook of Applied Cryptography

Optimisation and parallelisation strategies for Monte Carlo simulation of HIV infection

Computers in Biology and Medicine
Short communication: Evolving cellular automata to generate nonlinear sequences with desirable properties

Applied Soft Computing
Cryptographically Strong S-Boxes Based on Cellular Automata

ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Randomness quality of permuted pseudorandom binary sequences

Mathematics and Computers in Simulation
A Cellular Automata based method for predicting binary sequences

AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
Implementing disposable credit card numbers by mobile phones

Electronic Commerce Research
A hardware implementation of lightweight block cipher for ubiquitous computing security

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Low-Complexity authentication scheme based on cellular automata in wireless network

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Weak key analysis and micro-controller implementation of CA stream ciphers

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
Practical attack on the shrinking generator

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Cryptography with asynchronous logic automata

Cryptography and Security
Chaotic encryption method based on life-like cellular automata

Expert Systems with Applications: An International Journal
On the combination of self-organized systems to generate pseudo-random numbers

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, cellular automata (CAs) are used to design a symmetric key cryptography system based on Vernam cipher. CAs are applied to generate a pseudo-random numbers sequence (PNS) which is used during the encryption process. The quality of PNSs highly depends on the set of applied CA rules. Rules of radius r = 1 and 2 for nonuniform one-dimensional CAs have been considered. A new set of rules has been discovered using an evolutionary technique called cellular programming. This set provides very high quality encryption, and the system is very resistant to attempts of breaking the cryptography key.