Construct · 1 fields · 1 citations

Goldreich-Levin theorem: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
Goldreich-Levintheorem1 CONSTRUCTGoldreich-Levin theoremGOLDREICH · CRYPTOGRAPHY

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

Cryptography

the result that any one-way function can be modified to have a hard-core bit, a single bit of the input that is as hard to guess as inverting the function.

In cryptography, Goldreich-Levin theorem refers to the result that any one-way function can be modified to have a hard-core bit, a single bit of the input that is as hard to guess as inverting the function. This meaning comes from Goldreich (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 Goldreich-Levin theorem 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 constructsone-way function1 fields · 1 citationsanchor · a standalone construct

References

  1. Goldreich, O., & Levin, L. A. (1989). A hard-core predicate for all one-way functions. Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. https://doi.org/10.1145/73007.73010

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