Premium
A comparative study and analysis of some pseudorandom number generator algorithms
Author(s) -
Sinha Shobhit,
Islam SK Hafizul,
Obaidat Mohammad S.
Publication year - 2018
Publication title -
security and privacy
Language(s) - English
Resource type - Journals
ISSN - 2475-6725
DOI - 10.1002/spy2.46
Subject(s) - pseudorandom number generator , nist , equidistributed sequence , random number generation , linear congruential generator , generator (circuit theory) , algorithm , computer science , statistical analysis , mathematics , discrete mathematics , statistics , engineering , physics , electrical engineering , speech recognition , quantum mechanics , power (physics) , magnet
In this article, we have investigated the statistical nature of popular pseudorandom number generators (PRNGs) present in the literature and have analyzed their performance against the battery of tests prescribed in NIST SP800‐22rev1a. Different tests performed in this article provide an insight into the PRNGs and have revealed if they are statistically random or not, which is the first criteria in being cryptographically secure. In our study, we have considered the following PRNGs: (a) Linear Congruential Generator, (b) WichMann‐Hill Algorithm, (c) Well Equidistributed Long Period Generator and (d) MIXMAX.