Rabin cryptosystem
E836301
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Rabin cryptosystem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10018637 — 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: Rabin cryptosystem Context triple: [Michael O. Rabin, knownFor, Rabin cryptosystem]
-
A.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
B.
RSA
RSA is the three-letter World Rugby trigram used to represent the South Africa national rugby union team in international competitions and official records.
-
C.
RSA Design
RSA Design is a creative design division of the production company RSA Films, specializing in visual and graphic solutions for film, advertising, and branded content.
-
D.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
-
E.
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.
- 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: Rabin cryptosystem Target entity description: 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.
-
A.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
B.
RSA
RSA is the three-letter World Rugby trigram used to represent the South Africa national rugby union team in international competitions and official records.
-
C.
RSA Design
RSA Design is a creative design division of the production company RSA Films, specializing in visual and graphic solutions for film, advertising, and branded content.
-
D.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
-
E.
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.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
encryption scheme
ⓘ
public-key cryptosystem ⓘ |
| advantageOverRSA | tighter reduction to factoring ⓘ |
| basedOn | integer factorization problem ⓘ |
| category |
number-theoretic cryptosystem
ⓘ
trapdoor one-way function based scheme ⓘ |
| ciphertextComputation | c ≡ m^2 mod n ⓘ |
| ciphertextSpace | integers modulo n ⓘ |
| contrastWith | RSA where security equivalence to factoring is not proven ⓘ |
| decryptionAmbiguity | 4-to-1 mapping from plaintexts to ciphertexts ⓘ |
| decryptionComplexity | polynomial time in log n given factors ⓘ |
| decryptionStep |
compute square roots of c modulo p and q
ⓘ
use Chinese Remainder Theorem to combine roots ⓘ |
| definedOver | Blum integers NERFINISHED ⓘ |
| disadvantageComparedToRSA | decryption yields four candidates ⓘ |
| encryptionComplexity | polynomial time in log n ⓘ |
| encryptionDeterministic | true ⓘ |
| hasIssue | multiple possible plaintexts per ciphertext ⓘ |
| hasProperty | encryption is as hard as factoring in the worst case ⓘ |
| hasSecurityProperty | provable security equivalence to integer factorization ⓘ |
| influenced | design of provably secure public-key schemes ⓘ |
| introducedBy | Michael O. Rabin NERFINISHED ⓘ |
| introducedInYear | 1979 ⓘ |
| keyGenerationStep |
choose large primes p and q
ⓘ
compute n = p·q ⓘ |
| mathematicalTool |
Chinese Remainder Theorem
NERFINISHED
ⓘ
modular arithmetic ⓘ |
| modulusProperty |
n = p·q where p ≡ 3 (mod 4)
ⓘ
n = p·q where q ≡ 3 (mod 4) ⓘ |
| namedAfter | Michael O. Rabin NERFINISHED ⓘ |
| plaintextSpace | integers modulo n ⓘ |
| privateKey | (p, q) ⓘ |
| privateKeyComponent |
prime factor p of n
ⓘ
prime factor q of n ⓘ |
| provableEquivalence | breaking scheme is equivalent to factoring n ⓘ |
| publicKey | n ⓘ |
| publicKeyComponent | modulus n ⓘ |
| requires | Blum integer modulus ⓘ |
| requiresAssumption | difficulty of factoring large composite integers ⓘ |
| requiresForPracticalUse | CCA-secure padding or transformation ⓘ |
| requiresForUniqueness |
redundancy in plaintext
ⓘ
structured padding scheme ⓘ |
| securityReducesTo | factoring the modulus n ⓘ |
| similarTo | RSA cryptosystem NERFINISHED ⓘ |
| trapdoorFunction | modular squaring with factorization trapdoor ⓘ |
| usedIn | theoretical cryptography ⓘ |
| usesOperation | modular squaring ⓘ |
| vulnerableTo | chosen-ciphertext attacks without proper padding ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Rabin cryptosystem Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Michael O. Rabin