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: NTRU Cryptosystems | Statement: [Yiqun Lisa Yin, hasEmployer, NTRU Cryptosystems]

Target entity: NTRU Cryptosystems
Context triple: [Yiqun Lisa Yin, hasEmployer, NTRU Cryptosystems]

• A. Cramer–Shoup cryptosystem
  The Cramer–Shoup cryptosystem is a public-key encryption scheme designed to be secure against adaptive chosen-ciphertext attacks, improving on earlier systems like ElGamal in terms of robustness and security guarantees.
• B. Massey–Omura cryptosystem
  The Massey–Omura cryptosystem is a public-key encryption scheme based on exponentiation in finite fields that enables secure communication without prior key exchange.
• C. Damgård–Jurik cryptosystem
  The Damgård–Jurik cryptosystem is a public-key encryption scheme that generalizes the Paillier cryptosystem to support larger message spaces and flexible homomorphic properties.
• D. 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.
• E. Rabin cryptosystem
  The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: NTRU Cryptosystems
Target entity description: NTRU Cryptosystems is a cryptography company best known for developing the NTRU public-key cryptosystem, an early and influential lattice-based, post-quantum encryption scheme.

• A. Cramer–Shoup cryptosystem
  The Cramer–Shoup cryptosystem is a public-key encryption scheme designed to be secure against adaptive chosen-ciphertext attacks, improving on earlier systems like ElGamal in terms of robustness and security guarantees.
• B. Massey–Omura cryptosystem
  The Massey–Omura cryptosystem is a public-key encryption scheme based on exponentiation in finite fields that enables secure communication without prior key exchange.
• C. Damgård–Jurik cryptosystem
  The Damgård–Jurik cryptosystem is a public-key encryption scheme that generalizes the Paillier cryptosystem to support larger message spaces and flexible homomorphic properties.
• D. 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.
• E. Rabin cryptosystem
  The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
• F. None of above. chosen