Technical Writing

Pseudo Random Number Generator

Random numbers are heavily used in cryptography. Session keys, initialization vectors (IV), unique parameters in digital signature operations, are assumed to be random by cryptographer. What random means here is the numbers generated by system are hard to be predicted by an attacker. Unfortunately, in practice, it is very difficult to get pure random numbers. Many cryptographic application don't have a reliable source of real random bits. So, a cryptographic mechanism called a Pseudo-Random Number Generator (PRNG) is used to generate these numbers. The numbers are said to be Pseudo-Random because they are produced by some mathematical formulas and so periodically repeat themselves. A well-defined Pseudo-Random Number Generator - used for cryptography application - is called Cryptographically Secure Pseudo-Random Number Generator. It should statistically has good characteristic and endure all serious attacks.

Things that will be explained in this paper :
• Requirement for PRNG
• Implementation of Old PRNG Algorithm
• Implementation of Modern PRNG Algorithm
• Cryptanalytic Attacks on Real-World PRNG

Author :
13504060 dani
13504080 stevens jethefer

posted by dani @ 7:28 PM