Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
