Extractors and pseudorandom generators

By Luca Trevisan. JACM, 2001

352 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Leftover Hashing Against Quantum Side Information (2010, methodology): “However, to achieve even shorter seed lengths, more advanced techniques such as Trevisan’s extractor [23] have been studied in [24]–[26].”
Free randomness can be amplified (2011, methodology): “Using Trevisan’s extractor [25, 26], for example, in the first case we could generate random bits at the entropy rate of the partially free source.”
Quantum random number generators (2016, background): “A first notable result is the Trevisan extractor (Trevisan, 2001), an explicit construction which has some”
Private randomness expansion with untrusted devices (2010, methodology): “In particular, privacy amplification schemes based on Trevisan’s extractor [30] have recently been shown to be secure even when the information E is quantum, and in general require a shorter seed than schemes using two-universal hash functions [31].”
Quantum random number generation (2015, background): “Trevisan’s extractor 97,98 has been proven secure against quantum adversaries 99 .”