Abstract
The security of most of the cryptosystems depend on the secret key generator. However, implementation for hardwares, of this key generator is inefficient because secret key generators depend on mathematical problem to generate the high randomness quality. Cellular automata (CA) pseudorandom number generator (PRNG) is more efficiently implemented rather than mathematical problem based PRNGs because a structure of CA PRNG is highly regular and simpler than the other PRNGs. In this paper, a virtual three-dimension (3D) CA PRNG based on the Moore neighborhood structure is proposed. The proposed PRNG uses new methods which are the rule numbering function that provides a high-quality randomness and cell position function that diminishes correlations between global states. In order to evaluate the quality of randomness, the ENT and DIEHARD test suites are used. The results of these tests show that the quality of randomness is superior to 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.
