Abstract
The security of a One-time Pad Cryptography system depends on the keystream generator, which has been studied to produce a high randomness quality over the last thirty years. A Cellular Automata (CA) Pseudorandom Number Generator (PRNG) is more efficiently implement rather than LFSR, Linear Congruential generator, Fibonacci generator, etc.. Moreover, a CA structure-based PRNG is highly regular and simpler than previous PRNGs. Accordingly, we propose a new PRNG based on a virtual three-dimension (3-D) CA with the Moore neighborhood structure. In order to evaluate the quality of randomness, the ENT and the DIEHARD test suites are used. The results of these tests show that the quality of randomness is better than previous PRNGs.
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.
