Rivest–Shamir–Adleman (RSA) Algorithm
GPTKB entity
Statements (47)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
currency
|
| gptkbp:application |
VPNs
digital signatures secure web browsing email encryption SSL/TLS_protocols |
| gptkbp:basedOn |
factorization of large integers
|
| gptkbp:canAllocate |
uses private key to decrypt
|
| gptkbp:developedBy |
gptkb:Adi_Shamir
gptkb:Ron_Rivest Leonard Adleman |
| gptkbp:firstIntroduced |
1977
|
| gptkbp:historicalSignificance |
foundation for modern cryptography
influenced cryptographic research led to development of other algorithms one of the first practical public-key systems widely used in secure communications |
| https://www.w3.org/2000/01/rdf-schema#label |
Rivest–Shamir–Adleman (RSA) Algorithm
|
| gptkbp:influencedBy |
number theory
|
| gptkbp:keyIssues |
requires secure key storage
commonly 2048 or 4096 bits calculating public and private exponents certificate authorities involved computing modulus n involves selecting two large prime numbers key distribution challenges revocation of compromised keys public_key_infrastructure_(PKI)_usage |
| gptkbp:notableFeature |
gptkb:Microsoft_CryptoAPI
gptkb:Java_Cryptography_Architecture OpenSSL Bouncy Castle GnuPG |
| gptkbp:operates |
various programming languages
|
| gptkbp:patentStatus |
patented until 2000
|
| gptkbp:performance |
slower than symmetric key algorithms
|
| gptkbp:relatedTo |
gptkb:Elliptic_Curve_Cryptography
cryptographic hash functions Diffie-Hellman key exchange |
| gptkbp:security |
asymmetric encryption
difficulty of factoring large primes uses public key to encrypt |
| gptkbp:skills |
exposed to quantum attacks
requires large key sizes for security |
| gptkbp:standardFeatures |
RFC 3447
|
| gptkbp:usedFor |
secure data transmission
|
| gptkbp:uses |
public and private keys
|