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: Yao’s next-bit test | Statement: [Blum–Micali pseudorandom number generator, relatedTo, Yao’s next-bit test]

Target entity: Yao’s next-bit test
Context triple: [Blum–Micali pseudorandom number generator, relatedTo, Yao’s next-bit test]

• 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. 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.
• D. 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.
• 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.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Yao’s next-bit test
Triple: [Blum–Micali pseudorandom number generator, relatedTo, 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.

Target entity: Yao’s next-bit test
Target entity description: 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.

• 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. 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.
• D. 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.
• 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