A succinct survey on (Pseudo)-random number generators from a cryptographic perspective

Random numbers find their usefulness and utility in domains which have a significant role, sometimes even critical or obtaining some unpredictable results: Simulations based on Monte Carlo methods, simulations from mathematical modeling simulations, statistics, prime numbers generation, cryptography, spreaded spectrum communication, games, etc. In cryptography, the property of being random is fundamental and must obey strict requirements. The power of an encryption algorithm lies, first, in choosing an encryption key which, with the right size, must have a stream of random bits, with a high grade of entropy, in order to minimize the probability of detection/guessing of these numbers by an attacker. Having said this, the creation of feasible algorithms that generate random sequences of numbers/bits represents a critical problem of cryptography.