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.
Aliases (7)
Statements (60)
| Predicate | Object |
|---|---|
| instanceOf |
asymmetric cryptographic algorithm
→
digital signature scheme → encryption scheme → public-key cryptographic algorithm → |
| basedOn |
integer factorization problem
→
|
| commonlyUsedWith |
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 → 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 → 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
→
|