Characterization of two-dimensional cellular automata using matrix algebra
Information Sciences: an International Journal
Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
On the dynamical behavior of chaotic cellular automata
Theoretical Computer Science - Special issue: cellular automata
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata
IEEE Transactions on Computers
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 computations and secret key cryptography
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
An Efficient PRNG Based on the Hybrid between One- and Two-Dimensional Cellular Automata
ITNG '09 Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations
A secret key cryptosystem by iterating a chaotic map
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Cryptography and Network Security: Principles and Practice
Cryptography and Network Security: Principles and Practice
Game of Life Cellular Automata
Game of Life Cellular Automata
Classification and generation of disturbance vectors for collision attacks against SHA-1
Designs, Codes and Cryptography
Pseudorandom number generation with self-programmable cellular automata
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 12.05 |
A chaotic encryption algorithm is proposed based on the ''Life-like'' cellular automata (CA), which acts as a pseudo-random generator (PRNG). The paper main focus is to use chaos theory to cryptography. Thus, CA was explored to look for this ''chaos'' property. This way, the manuscript is more concerning on tests like: Lyapunov exponent, Entropy and Hamming distance to measure the chaos in CA, as well as statistic analysis like DIEHARD and ENT suites. Our results achieved higher randomness quality than others ciphers in literature. These results reinforce the supposition of a strong relationship between chaos and the randomness quality. Thus, the ''chaos'' property of CA is a good reason to be employed in cryptography, furthermore, for its simplicity, low cost of implementation and respectable encryption power.