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: Computing short vectors in lattices | Statement: [Daniel J. Bernstein, thesisTitle, Computing short vectors in lattices]

Target entity: Computing short vectors in lattices
Context triple: [Daniel J. Bernstein, thesisTitle, Computing short vectors in lattices]

• A. Shamir’s attack on RSA with low decryption exponent
  Shamir’s attack on RSA with low decryption exponent is a cryptanalytic method that exploits unusually small private exponents in RSA to efficiently recover the secret key and break the encryption.
• B. 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.
• C. 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.
• D. 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.
• E. 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.
• 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: Computing short vectors in lattices
Triple: [Daniel J. Bernstein, thesisTitle, Computing short vectors in lattices]

"Computing short vectors in lattices" is Daniel J. Bernstein's doctoral thesis, focusing on algorithms and complexity issues related to finding short vectors in mathematical lattices, a central problem in computational number theory and cryptography.

Target entity: Computing short vectors in lattices
Target entity description: "Computing short vectors in lattices" is Daniel J. Bernstein's doctoral thesis, focusing on algorithms and complexity issues related to finding short vectors in mathematical lattices, a central problem in computational number theory and cryptography.

• A. Shamir’s attack on RSA with low decryption exponent
  Shamir’s attack on RSA with low decryption exponent is a cryptanalytic method that exploits unusually small private exponents in RSA to efficiently recover the secret key and break the encryption.
• B. 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.
• C. 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.
• D. 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.
• E. 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.
• F. None of above. chosen