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: Naor–Reingold pseudorandom function | Statement: [Moni Naor, notableWork, Naor–Reingold pseudorandom function]

Target entity: Naor–Reingold pseudorandom function
Context triple: [Moni Naor, notableWork, Naor–Reingold pseudorandom function]

• A. Naor–Yung encryption paradigm
  The Naor–Yung encryption paradigm is a foundational cryptographic framework that uses double encryption and zero-knowledge proofs to transform semantically secure public-key schemes into ones secure against chosen-ciphertext attacks.
• 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–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.
• D. Fiat–Shamir heuristic
  The Fiat–Shamir heuristic is a cryptographic technique that transforms interactive proof systems into non-interactive ones using hash functions, widely used in digital signatures and zero-knowledge proofs.
• E. 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.
• 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: Naor–Reingold pseudorandom function
Triple: [Moni Naor, notableWork, 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.

Target entity: Naor–Reingold pseudorandom function
Target entity description: 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.

• A. Naor–Yung encryption paradigm
  The Naor–Yung encryption paradigm is a foundational cryptographic framework that uses double encryption and zero-knowledge proofs to transform semantically secure public-key schemes into ones secure against chosen-ciphertext attacks.
• 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–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.
• D. Fiat–Shamir heuristic
  The Fiat–Shamir heuristic is a cryptographic technique that transforms interactive proof systems into non-interactive ones using hash functions, widely used in digital signatures and zero-knowledge proofs.
• E. 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.
• F. None of above. chosen