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
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A Universal Statistical Test for Random Bit Generators
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Stream Cyphers with One- and Two-Dimensional Cellular Automata
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
A Complexity-Theoretic Approach to the Design of Good Measures of Cryptographic Strength
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
A multisecret sharing scheme for color images based on cellular automata
Information Sciences: an International Journal
Generating cryptographically suitable non-linear maximum length cellular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Chaotic cellular automata with cryptographic application
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
d-monomial tests of nonlinear cellular automata for cryptographic design
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Practical attack on the shrinking generator
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A new secret sharing scheme for images based on additive 2-dimensional cellular automata
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I
CAR30: A new scalable stream cipher with rule 30
Cryptography and Communications
| Hi-index | 0.00 |
The security of cellular automata for stream cipher applications is investigated. A cryptanalytic algorithm is developed for a known plaintext attack where the plaintext is assumed to be known up to the unicity distance. The algorithm is shown to be successful on small computers for key sizes up to N between 300 and 500 bits. For a cellular automaton to be secure against more powerful adversaries it is concluded that the key size N needs to be about 1000 bits. The cryptanalytic algorithm takes advantage of an equivalent description of the cryptosystem in which the keys are not equiprobable. It is shown that key search can be reduced considerably if one is contented to succeed only with a certain success probability. This is established by an information theoretic analysis of arbitrary key saurces with non-uniform probability distribution.