Cryptography with cellular automata
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A new kind of science
Shift Register Sequences
Theory and application of cellular automata for pattern classification
Fundamenta Informaticae - Special issue on cellular automata
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Analysis of pseudo random sequences generated by cellular automata
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Concatenated automata in cryptanalysis of stream ciphers
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Generalized self-shrinking generator
IEEE Transactions on Information Theory
Synthesis of one-dimensional linear hybrid cellular automata
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In this paper, a method of generating cryptographic sequences based on discrete linear chaotic cellular automata is presented. The importance of the proposal is due to the fact that such cryptographic sequences are also output sequences of a nonlinear keystream generator known as Generalized Self-Shrinking Generator. Moreover, such a keystream generator is still considered secure in symmetric cryptography. Thus, it must be noticed that the linearity of the proposed chaotic model based on additive one-dimensional cellular automata might be used to mount a cryptanalytic attack against such a nonlinear generator