Computation in artificially evolved, non-uniform cellular automata
Theoretical Computer Science - Special issue: cellular automata
A new kind of science
Secret Key Cryptography with Cellular Automata
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Hi-index | 0.00 |
Based on the basic theory of cellular automata (CA), using genetic algorithm to find the rules of CA, one-dimensional extended non-uniform CA is constructed to generate high quality random bit sequences. A stringent test of randomness is applied to the bit sequences. The results show that our extended CA generator outperforms other generators such as Shift Register Generator, Congruential Generator and Lagged Fibonacci Generator. This generator can meet the requirement of the security for cryptographic modules and provide a new method to generate pseudo-random sequences in cryptography.