January 22, 2002
Practical Aspects of Modern Cryptography
47
Pseudo-Random Numbers
nHow do we make a lot of “good” random bits from a smaller number of “really good” random bits?
nWe want “pseudo-random bits”
nPseudo-random bitstrings are “polynomial time indistinguishable” from truly random bitstrings
nIn practice: use DES, hash functions to generate bits from a random seed (FIPS 186)
n