Analysing Security of Pseudorandom Sequences under Computational Constraints

Abstract

In this thesis, we evaluated Pseudo Random Number Generators (PRNGs) on the basis of a test called Next Bit Test (NBT). To see if a PRNG is suitable for specific purpose, we tested it to see the results. On testing various PRNGs, we got different results that are being discussed in detail. On the basis of our analysis on different PRNGs, we recommend the Logged Fibonacci generator extended to the subtract and borrow generator that holds the properties of NBT and is acceptable to be used in cryptography.