RSA
E5909
asymmetric cryptographic algorithm
digital signature scheme
encryption scheme
public-key cryptographic algorithm
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
All labels observed (10)
| Label | Occurrences |
|---|---|
| RSA canonical | 28 |
| RSA public-key cryptosystem | 7 |
| RSA cryptosystem | 6 |
| RSA Cryptography Standard | 2 |
| RSA encryption schemes | 2 |
| RSA algorithm | 1 |
| RSA encryption | 1 |
| RSA encryption algorithm | 1 |
| RSA public-key cryptography | 1 |
| RSASSA-PSS | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T63829 — 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: RSA Context triple: [TLS, supportsAlgorithmFamily, RSA]
-
A.
TLS
TLS (Transport Layer Security) is a cryptographic protocol that secures data transmitted over networks by providing encryption, authentication, and integrity between communicating applications.
-
B.
Martin Hellman
Martin Hellman is an American cryptologist best known as a co-inventor of public-key cryptography, which revolutionized secure digital communication.
-
C.
Whitfield Diffie
Whitfield Diffie is an American cryptographer best known as a pioneer of public-key cryptography, whose work revolutionized secure digital communication.
-
D.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
E.
Wired Equivalent Privacy
Wired Equivalent Privacy (WEP) is an early and now largely obsolete Wi‑Fi security protocol known for its weak encryption and significant vulnerabilities.
- 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: RSA Target entity description: RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
A.
TLS
TLS (Transport Layer Security) is a cryptographic protocol that secures data transmitted over networks by providing encryption, authentication, and integrity between communicating applications.
-
B.
Martin Hellman
Martin Hellman is an American cryptologist best known as a co-inventor of public-key cryptography, which revolutionized secure digital communication.
-
C.
Whitfield Diffie
Whitfield Diffie is an American cryptographer best known as a pioneer of public-key cryptography, whose work revolutionized secure digital communication.
-
D.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
E.
Wired Equivalent Privacy
Wired Equivalent Privacy (WEP) is an early and now largely obsolete Wi‑Fi security protocol known for its weak encryption and significant vulnerabilities.
- F. None of above. chosen
Statements (60)
| Predicate | Object |
|---|---|
| instanceOf |
asymmetric cryptographic algorithm
ⓘ
digital signature scheme ⓘ encryption scheme ⓘ public-key cryptographic algorithm ⓘ |
| basedOn | integer factorization problem ⓘ |
| commonlyUsedWith |
Advanced Encryption Standard
ⓘ
surface form:
AES
|
| comparedWith | Elliptic Curve Cryptography ⓘ |
| consideredInsecureAtKeySize |
512 bits
ⓘ
768 bits ⓘ |
| hasComponent |
decryption algorithm
ⓘ
encryption algorithm ⓘ key generation algorithm ⓘ signature generation algorithm ⓘ signature verification algorithm ⓘ |
| inventedBy |
Adi Shamir
ⓘ
Leonard Adleman ⓘ Ronald L. Rivest ⓘ
surface form:
Ron Rivest
|
| keyGenerationStep |
choose public exponent e
ⓘ
compute n = p × q ⓘ compute private exponent d as modular inverse of e modulo φ(n) ⓘ compute φ(n) ⓘ select two large random primes p and q ⓘ |
| namedAfter |
Adi Shamir
ⓘ
Leonard Adleman ⓘ Ronald L. Rivest ⓘ
surface form:
Ron Rivest
|
| privateKeyComponent |
modulus n
ⓘ
private exponent d ⓘ |
| publicKeyComponent |
modulus n
ⓘ
public exponent e ⓘ |
| requires |
large prime numbers
ⓘ
random number generation ⓘ |
| securityDependsOn | difficulty of factoring large composite integers ⓘ |
| slowerThan | symmetric-key algorithms for bulk encryption ⓘ |
| standardizedIn |
PKCS #1
ⓘ
RFC 8017 ⓘ |
| supports |
decryption
ⓘ
digital signatures ⓘ encryption ⓘ key encapsulation ⓘ |
| typicalKeySize |
1024 bits
ⓘ
2048 bits ⓘ 3072 bits ⓘ 4096 bits ⓘ |
| usedFor |
certificate authentication
ⓘ
digital signatures ⓘ secure email ⓘ secure key exchange ⓘ software code signing ⓘ |
| usedInProtocol |
IPsec
ⓘ
PGP ⓘ S/MIME ⓘ SSH ⓘ SSL ⓘ TLS ⓘ |
| uses |
Euler’s totient function
ⓘ
modular exponentiation ⓘ private key ⓘ public key ⓘ |
| vulnerableTo | quantum attacks via Shor’s algorithm ⓘ |
| yearOfInvention | 1977 ⓘ |
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: RSA Description of subject: RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
Referenced by (50)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
RSA public-key cryptosystem
this entity surface form:
RSA cryptosystem
this entity surface form:
RSA public-key cryptosystem
this entity surface form:
RSA cryptosystem
this entity surface form:
RSA public-key cryptosystem
this entity surface form:
RSA public-key cryptosystem
this entity surface form:
RSA public-key cryptosystem
this entity surface form:
RSA public-key cryptosystem
this entity surface form:
RSA cryptosystem
this entity surface form:
RSA cryptosystem
subject surface form:
Hardware security module
subject surface form:
JSON Web Token
this entity surface form:
RSA public-key cryptography
subject surface form:
Adi Shamir
this entity surface form:
RSA encryption algorithm
this entity surface form:
RSA cryptosystem
this entity surface form:
RSA cryptosystem
subject surface form:
MTProto