Abstract:
Many security applications are based on Pseudo Random Number Generators (PRNGs). Random binary
numbers constitute a major reliance in many network security algorithms. For example, common
cryptosystems require a long dynamic key that should be generated from a short secret key and has the
random behavior. Random or pseudorandom inputs are critical requirements in many protocols that need
this issue at certain points. A PRNG is a deterministic algorithm generates a sequence of bits simulates the
truly random numbers sequence behavior. Each generated number should be independent of the previous or
the future numbers, as a result the PRNG become unpredictable. However there are many security and
performance tests can be applied on the PRNG sequence to evaluate it. And then measure the power of the
PRNG. Therefore not all PRNG are good enough to be used in cryptographic applications. This depends on
the kind of application and its data sensitivity. A PRNG that passes these tests can be considered as a
secure PRNG. Furthermore, it can be used in many cryptographic applications. In this survey, some
missing results are reproduced by our team in order to have the same level of assessment for presented
algorithms under the test. Moreover, new test tools are used to evaluate the behavior of the generators and
assess the randomness of them. Finally, details discussions of the new tools are considered in order to
validate the security level of the proposed generators.
