Massey–Omura cryptosystem
E1403282
UNEXPLORED
The Massey–Omura cryptosystem is a public-key encryption scheme based on exponentiation in finite fields that enables secure communication without prior key exchange.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Massey–Omura cryptosystem canonical | 4 |
How this entity was disambiguated
This entity first appeared as the object of triple T19937638 — 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 cryptosystem Context triple: [James L. Massey, knownFor, Massey–Omura cryptosystem]
-
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.
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.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
D.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Massey–Omura cryptosystem Target entity description: The Massey–Omura cryptosystem is a public-key encryption scheme based on exponentiation in finite fields that enables secure communication without prior key exchange.
-
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.
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.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
D.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
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
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.