Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Leftover hash lemma
open-in-new
<h2 id="see-also">See also</h2> <ul><li><a href="/facts/Universal_hashing/NICffew4">Universal hashing</a></li> <li><a href="/facts/Min-entropy/U0j0SNcp">Min-entropy</a></li> <li><a href="/facts/R%25C3%25A9nyi_entropy/SlrvqKNv">Rényi entropy</a></li> <li><a href="/facts/Information-theoretic_security/DG2q6XeI">Information-theoretic security</a></li></ul> <ul><li><a href="http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=45477">C. H. Bennett, G. Brassard, and J. M. Robert. <i>Privacy amplification by public discussion</i>. SIAM Journal on Computing, 17(2):210-229, 1988.</a></li> <li><a href="https://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=10153&arnumber=476316&type=ref">C. Bennett, G. Brassard, C. Crepeau, and U. Maurer. <i>Generalized privacy amplification</i>. IEEE Transactions on Information Theory, 41, 1995.</a></li> <li><a href="http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=312213">J. Håstad, R. Impagliazzo, L. A. Levin and M. Luby. <i>A Pseudorandom Generator from any One-way Function</i>. SIAM Journal on Computing, v28 n4, pp. 1364-1396, 1999.</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Impagliazzo, Russell; Levin, Leonid A.; Luby, Michael (1989), "Pseudo-random Generation from one-way functions", in Johnson, David S. (ed.), Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA, {ACM}, pp. 12–24, doi:10.1145/73007.73009, S2CID 18587852 <a href="/wiki/Russell_Impagliazzo" target="_blank">/wiki/Russell_Impagliazzo</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Rubinfeld, Ronnit; Drucker, Andy (April 30, 2008), "Lecture 22: The Leftover Hash Lemma and Explicit Extractions" (PDF), Lecture notes for MIT course 6.842, Randomness and Computation, MIT, retrieved 2019-02-19 <a href="/wiki/Ronitt_Rubinfeld" target="_blank">/wiki/Ronitt_Rubinfeld</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> </ol>