Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Goldreich-Levin hard-core predicate theorem | Statement: [Yao’s pseudorandom generator construction, relatedTo, Goldreich-Levin hard-core predicate theorem]

Target entity: Goldreich-Levin hard-core predicate theorem
Context triple: [Yao’s pseudorandom generator construction, relatedTo, Goldreich-Levin hard-core predicate theorem]

• A. 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.
• B. Yao’s next-bit test
  Yao’s next-bit test is a foundational cryptographic criterion that characterizes pseudorandomness by requiring that no efficient algorithm can predict the next bit of a sequence significantly better than random guessing, given all previous bits.
• C. Naor–Reingold pseudorandom function
  The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
• D. 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.
• E. 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.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Goldreich-Levin hard-core predicate theorem
Target entity description: The Goldreich-Levin hard-core predicate theorem is a foundational result in cryptography that shows how to derive a specific bit of information that is provably hard to predict from any one-way function, enabling the construction of pseudorandom generators and other cryptographic primitives.

• A. 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.
• B. Yao’s next-bit test
  Yao’s next-bit test is a foundational cryptographic criterion that characterizes pseudorandomness by requiring that no efficient algorithm can predict the next bit of a sequence significantly better than random guessing, given all previous bits.
• C. Naor–Reingold pseudorandom function
  The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
• D. 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.
• E. 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.
• F. None of above. chosen