Randomness is crucial to computer science, both in theory and applications. In complexity theory, randomness augments computers to offer more powerful models. In cryptography, randomness is essential for seed generation, where the computational model used is generally probabilistic. However, ideal randomness, which is usually assumed to be available in computer science theory and applications, might not be available to real systems. Randomness extractors are objects that turn “weak” randomness into almost “ideal” randomness (pseudorandomness). In this paper, we will build the framework to work with such objects and present explicit constructions. We will discuss a well-known construction of seeded extractors via universal hashing and present a simple argument to extend such results to two-source extractors.
Omer Egecioglu, Department of Computer Science, University of California, Santa Barbara
"Randomness Extractors -- An Exposition,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 17
, Article 7.
Available at: http://scholar.rose-hulman.edu/rhumj/vol17/iss1/7