Performance Analysis of Cryptographic Pseudorandom Number Generators

Abstract

Pseudorandom number generators (PRNGs) are important in cryptography and have been used in several security applications, such as authentication protocols, session keys, key distribution, and keystream for a one-time pad. Producing PRNGs is a critical issue because they should be uniform in distribution, unpredictable, and independent. Several PRNGs are available, but the problem lies in determining the one with the best performance. The performance of PRNGs is determined by passing a set of statistical tests' set by the National Institute of Standards and Technology (NIST). The NIST also recommends random number generation using advanced encryption standard and triple data encryption standard algorithms with the counter mode of operation. Furthermore, several block cipher algorithms (BCAs) and alternates that are present may produce strong PRNG than NIST recommendations. Therefore, in this paper, different BCAs are explored and implemented, and their results are analyzed and addressed. This paper may help in producing a strong key generation, which is deemed necessary for cryptographic authentication and other security applications.