Construct · 1 fields · 1 citations

leftover hash lemma: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
leftoverhash lemma1 CONSTRUCTLeftover hash lemmaIMPAGLIAZZO · RANDOMIZED

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Randomized algorithms

the result that applying a randomly chosen universal hash function to a source with enough min-entropy yields output close to uniform.

In randomized algorithms, leftover hash lemma refers to the result that applying a randomly chosen universal hash function to a source with enough min-entropy yields output close to uniform. This meaning comes from Impagliazzo (1989) in Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how leftover hash lemma sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

function5 fields · 6 citationsjingle · one word, five constructshash2 fields · 3 citationsjingle · one word, two constructslemma1 fields · 3 citationsanchor · a standalone construct

References

  1. Impagliazzo, R., Levin, L. A., & Luby, M. (1989). Pseudo-random generation from one-way functions. Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. https://doi.org/10.1145/73007.73009

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct