In a World of Pseudorandomness
E122538
"In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
All labels observed (1)
| Label | Occurrences |
|---|---|
| In a World of Pseudorandomness canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1013318 — 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: In a World of Pseudorandomness Context triple: [Oded Goldreich, authorOf, In a World of Pseudorandomness]
-
A.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
B.
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.
-
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.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
E.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
- 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: In a World of Pseudorandomness Target entity description: "In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
-
A.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
B.
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.
-
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.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
E.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
- F. None of above. chosen
Statements (32)
| Predicate | Object |
|---|---|
| instanceOf |
research monograph
ⓘ
theoretical computer science work ⓘ |
| addresses |
how pseudorandomness underlies cryptographic security
ⓘ
how to formalize unpredictability in computation ⓘ how to simulate randomness using deterministic procedures ⓘ |
| aimsTo |
clarify the conceptual foundations of pseudorandomness
ⓘ
connect pseudorandomness with cryptographic applications ⓘ explain the impact of pseudorandomness on algorithm design ⓘ survey key constructions of pseudorandom generators ⓘ |
| describes |
constructions of pseudorandom objects
ⓘ
foundations of pseudorandomness ⓘ implications of pseudorandomness for computation ⓘ implications of pseudorandomness for cryptography ⓘ |
| field |
computational complexity theory
ⓘ
cryptography ⓘ theoretical computer science ⓘ |
| focusesOn |
complexity-theoretic assumptions for pseudorandomness
ⓘ
construction of pseudorandom generators from hard problems ⓘ formal definitions of pseudorandomness ⓘ role of pseudorandomness in secure cryptographic primitives ⓘ use of pseudorandomness to reduce randomness in algorithms ⓘ |
| mainTopic |
applications of pseudorandomness in cryptography
ⓘ
computational indistinguishability ⓘ derandomization ⓘ hardness versus randomness ⓘ pseudorandom generators ⓘ pseudorandomness ⓘ |
| relatedTo |
complexity classes BPP and P
ⓘ
computational hardness assumptions ⓘ one-way functions ⓘ probabilistic proof techniques ⓘ randomized algorithms ⓘ |
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: In a World of Pseudorandomness Description of subject: "In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.