Pseudo-random number generators

Problems:

• getting many truly random bits is slow

• getting many shared truly random bits is more awkward

• getting “good randomness” is important for many crypto algorithms

Solution:

• theory: pseudo-random strings that are “polynomial time indistinguishable” from truly random strings

• practice: use DES, hash functions generate bits from a random seed (FIPS 186)

Previous slide

Next slide

Back to first slide

View graphic version