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: Massey–Omura multiplier | Statement: [James L. Massey, knownFor, Massey–Omura multiplier]

Target entity: Massey–Omura multiplier
Context triple: [James L. Massey, knownFor, Massey–Omura multiplier]

• A. 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.
• 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. 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.
• D. Diffie–Hellman key exchange
  Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
• E. 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.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Massey–Omura multiplier
Target entity description: The Massey–Omura multiplier is a hardware-efficient digital circuit architecture designed for fast finite-field multiplication, widely used in error-correcting codes and cryptographic systems.

• A. 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.
• 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. 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.
• D. Diffie–Hellman key exchange
  Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
• E. 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.
• F. None of above. chosen