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: short integer solution (SIS) problem | Statement: [Daniele Micciancio, knownFor, short integer solution (SIS) problem]

Target entity: short integer solution (SIS) problem
Context triple: [Daniele Micciancio, knownFor, short integer solution (SIS) problem]

• A. 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.
• B. Merkle–Hellman knapsack cryptosystem
  The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
• 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. 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.
• E. Merkle puzzles
  Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
• 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: short integer solution (SIS) problem
Triple: [Daniele Micciancio, knownFor, short integer solution (SIS) problem]

The short integer solution (SIS) problem is a fundamental lattice-based computational problem that underpins many modern cryptographic constructions, especially in post-quantum cryptography.

Target entity: short integer solution (SIS) problem
Target entity description: The short integer solution (SIS) problem is a fundamental lattice-based computational problem that underpins many modern cryptographic constructions, especially in post-quantum cryptography.

• A. 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.
• B. Merkle–Hellman knapsack cryptosystem
  The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
• 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. 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.
• E. Merkle puzzles
  Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
• F. None of above. chosen