Yao’s pseudorandom generator construction
E503603
Yao’s pseudorandom generator construction is a foundational cryptographic method that transforms any one-way function into a pseudorandom generator, establishing a deep connection between computational hardness and pseudorandomness.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Yao’s pseudorandom generator construction canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5214014 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Yao’s pseudorandom generator construction Context triple: [Blum–Micali pseudorandom number generator, influenced, Yao’s pseudorandom generator construction]
-
A.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
B.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
"Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
-
C.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
D.
In a World of Pseudorandomness
"In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
-
E.
Håstad’s switching lemma
Håstad’s switching lemma is a fundamental result in computational complexity theory that provides powerful bounds on the simplification of Boolean formulas under random restrictions, with major applications in circuit lower bounds.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Yao’s pseudorandom generator construction Target entity description: Yao’s pseudorandom generator construction is a foundational cryptographic method that transforms any one-way function into a pseudorandom generator, establishing a deep connection between computational hardness and pseudorandomness.
-
A.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
B.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
"Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
-
C.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
D.
In a World of Pseudorandomness
"In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
-
E.
Håstad’s switching lemma
Håstad’s switching lemma is a fundamental result in computational complexity theory that provides powerful bounds on the simplification of Boolean formulas under random restrictions, with major applications in circuit lower bounds.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic construction
ⓘ
pseudorandom generator construction ⓘ theoretical computer science concept ⓘ |
| assumes | existence of a one-way function secure against polynomial-time adversaries ⓘ |
| author | Andrew Chi-Chih Yao NERFINISHED ⓘ |
| basedOn | one-way function ⓘ |
| consequence | equivalence between one-way functions and pseudorandom generators up to standard assumptions ⓘ |
| coreIdea |
extract one pseudorandom bit from a one-way function using a hard-core predicate
ⓘ
iterate the hard-core predicate on related inputs to obtain multiple pseudorandom bits ⓘ |
| establishes | implication from existence of one-way functions to existence of pseudorandom generators ⓘ |
| field |
computational complexity theory
ⓘ
cryptography ⓘ theoretical computer science ⓘ |
| formalizedIn | standard cryptography textbooks ⓘ |
| goal | construct a pseudorandom generator from any one-way function ⓘ |
| hasImpactOn |
derandomization of probabilistic algorithms
ⓘ
design of pseudorandom functions ⓘ understanding of minimal assumptions for cryptography ⓘ |
| hasProperty |
polynomial-time computable given oracle access to the one-way function
ⓘ
security based on hardness of inverting underlying one-way function ⓘ stretchable output length ⓘ |
| implies |
equivalence between next-bit unpredictability and pseudorandomness of distributions
ⓘ
existence of pseudorandom generators if one-way functions exist ⓘ |
| influenced |
modern cryptographic pseudorandomness theory
ⓘ
subsequent constructions of pseudorandom generators from weaker assumptions ⓘ |
| input | one-way function ⓘ |
| introducedIn | paper "Theory and Application of Trapdoor Functions" NERFINISHED ⓘ |
| mathematicalArea |
complexity-theoretic cryptography
ⓘ
probability theory in computation ⓘ |
| namedAfter | Andrew Chi-Chih Yao NERFINISHED ⓘ |
| output | pseudorandom generator ⓘ |
| relatedTo |
Blum-Blum-Shub pseudorandom generator
NERFINISHED
ⓘ
Blum-Micali pseudorandom generator NERFINISHED ⓘ Goldreich-Levin hard-core predicate theorem NERFINISHED ⓘ |
| relatesConcept |
computational hardness
ⓘ
pseudorandomness ⓘ |
| securityArgument | hybrid argument over output bits ⓘ |
| securityNotion | next-bit unpredictability ⓘ |
| taughtIn | graduate cryptography courses ⓘ |
| usedIn |
complexity-theoretic foundations of cryptography
ⓘ
design of stream ciphers ⓘ proofs about derandomization ⓘ |
| usesConcept |
computational indistinguishability
ⓘ
hard-core predicate ⓘ hybrid argument ⓘ |
| yearProposed | 1982 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Yao’s pseudorandom generator construction Description of subject: Yao’s pseudorandom generator construction is a foundational cryptographic method that transforms any one-way function into a pseudorandom generator, establishing a deep connection between computational hardness and pseudorandomness.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
Blum–Micali pseudorandom number generator
→
influenced
→
Yao’s pseudorandom generator construction
ⓘ