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
A brief history of cellular automata
ACM Computing Surveys (CSUR)
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 Based Cryptosystem (CAC)
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
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
Cryptanalysis of a new cellular automata cryptosystem
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Hi-index | 0.00 |
In this paper we show that the new Cellular Automata Cryptosystem (CAC) is insecure and can be broken by chosen-plaintexts attack with little computation. We also restore the omitted parts clearly by deriving the rotating number δ of plaintext bytes and the procedure of Major CA. The clock circle Δ of Major CA and the key SN are also attacked.