Secret key specification for a variable-length cryptographic cellular automata model

Authors:
Gina M. B. Oliveira;Luiz G. A. Martins;Giordano B. Ferreira;Leonardo S. Alt
Affiliations:
Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, Brazil;Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, Brazil;Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, Brazil;Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, Brazil
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Year:
2010

Citing 7
Cited 0

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
Definition and application of a five-parameter characterization of one-dimensional cellular automata rule space

Artificial Life
Stream Cyphers with One- and Two-Dimensional Cellular Automata

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Cellular Automata Based Cryptosystem (CAC)

ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Secret Key Cryptography with Cellular Automata

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Exhaustive evaluation of radius 2 toggle rules for a variable-length cryptographic cellular automata-based model

ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reverse algorithm was previously evaluated as encryption method concluding that its simple adoption is unviable, since it does not assurance the pre-image existence. Variable-Length Encryption Method (VLE) was proposed where a alternative algorithm with extra bits is adopted when pre-image computation is not possible. If an adequate secret key is used with VLE it is expected that the final ciphertext length is close to plaintext size. Several CA static parameters were calculated for a set formed by all radius 2 right-toggle rules. A database was generated associating rules performance in VLE ciphering with its parameters. A genetic algorithm-based data mining was performed to discover an adequate key specification based on CA parameters. Using such specification, ciphertext length is short, encryption process returns high entropy and VLE has a good protection against differential cryptanalysis.