Massey–Omura multiplier
E1403283
UNEXPLORED
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Massey–Omura multiplier canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T19937639 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
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
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.