Random sequence generation by cellular automata
Advances in Applied Mathematics
Cryptanalysis of a Partially Known Cellular Automata Cryptosystem
IEEE Transactions on Computers
Evolutionary computation in computer security and cryptography
New Generation Computing - Evolutionary computation
Block cipher based on reversible cellular automata
New Generation Computing - Evolutionary computation
Effective pair-wise key establishment scheme for wireless sensor networks
Proceedings of the 2nd international conference on Security of information and networks
Improving quality of DES S-boxes by cellular automata-based S-boxes
The Journal of Supercomputing
On the combination of self-organized systems to generate pseudo-random numbers
Information Sciences: an International Journal
| Hi-index | 0.00 |
This abstract discusses a stream cipher based on a simple one-dimensional cellular automaton. The cellular automaton consists of a circular register with N cells, each having value ai equal to 0 or 1. The values are updated synchronously in discrete time steps according to the rule ai驴 = ai-1 XOR (ai OR ai+1), (1a) or, equivalently, ai驴 = (ai-1 + ai + ai+1 + aiai+1) mod 2. (1b) The initial state of the register is used as a seed or key. The values a(i) attained by a particular cell through time can then serve as a random sequence. Ciphertext C can be obtained from binary plaintext P as usual according to Ci = Pi XOR a(i); the plaintext can be recovered by repeating the same operation, but only if the sequence a(i) is known.