Exhaustive evaluation of radius 2 toggle rules for a variable-length cryptographic cellular automata-based model

Authors:
Gina M. B. Oliveira;Luiz G. A. Martins;Leonardo S. Alt;Giordano B. Ferreira
Affiliations:
Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, BRA;Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, BRA;Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, BRA;Faculdade de Computação, Universidade Federal de Uberlândia, Uberlândia, MG, BRA
Venue:
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Year:
2010

Citing 10
Cited 1

Random sequence generation by cellular automata

Advances in Applied Mathematics
Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Computation at the edge of chaos: phase transitions and emergent computation

CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
Classifying cellular automata automatically: finding gliders, filtering, and relating space-time patterns, attractor basins, and the Z parameter

Complexity
Definition and application of a five-parameter characterization of one-dimensional cellular automata rule space

Artificial Life
Cryptography and Network Security: Principles and Practice

Cryptography and Network Security: Principles and Practice
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
Differential Cryptanalysis of DES-like Cryptosystems

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology

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

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A cellular automata (CA) model in cryptography is investigated. A previous work analyzed the usage of reverse algorithm for pre-image computation as an encryption method. The main conclusion was that the simple adoption of such method is not viable, since it does not have 100% of guarantee of pre-image existence. A new approach was proposed that uses extra bits when the pre-image computation is not possible. It is expected that in practice few failures happens and the ciphertext size will be close to the plaintext. Encryption always succeeds and the final length of the ciphertext is not fixed. We better investigate the secret key specification by using a more representative set formed by all radius 2 right-toggle rules, totalizing 65536 rules. An exhaustive analysis of this rule space has shown that using adequate specification the method has a good protection against differential cryptanalysis and a small increase in ciphertext length.