Randomness is a hard problem for computers. For this reason most functions that generate randomness are not considered cryptographically secure. That means that it is possible that an attacker can take a good guess at what number a non-secure randomness generator generated. How can randomness be attacked? Many non-secure randomness (or entropy) generators would do something similar to the following: …
