|
gptkbp:instanceOf
|
gptkb:algorithm
|
|
gptkbp:basedOn
|
asymmetric cryptography
|
|
gptkbp:category
|
gptkb:algorithm
gptkb:security
cryptography
public-key cryptography
|
|
gptkbp:commonIn
|
gptkb:SSL/TLS
gptkb:PGP
SSH
|
|
gptkbp:decryptionProcess
|
ciphertext is raised to the power of private exponent modulo n
|
|
gptkbp:dependsOn
|
integer factorization problem
|
|
gptkbp:developedBy
|
gptkb:Adi_Shamir
gptkb:Leonard_Adleman
gptkb:Ron_Rivest
|
|
gptkbp:encryptionProcess
|
plaintext is raised to the power of public exponent modulo n
|
|
gptkbp:exportControlled
|
in the 1990s
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
RSA encryption
|
|
gptkbp:introducedIn
|
1977
|
|
gptkbp:keyGeneration
|
computes modulus n = p*q
computes public and private exponents
requires two large prime numbers
|
|
gptkbp:keySize
|
typically 1024 to 4096 bits
|
|
gptkbp:messagePadding
|
gptkb:OAEP
gptkb:PKCS_#1_v1.5
|
|
gptkbp:namedAfter
|
gptkb:Adleman
gptkb:Rivest
gptkb:Shamir
|
|
gptkbp:notRecommendedFor
|
large data encryption
|
|
gptkbp:patentExpired
|
2000
|
|
gptkbp:privateKey
|
(n, d)
|
|
gptkbp:publicKey
|
(n, e)
|
|
gptkbp:recommendation
|
digital signatures
key exchange
|
|
gptkbp:standardizedBy
|
gptkb:PKCS_#1
|
|
gptkbp:usedFor
|
digital signatures
secure data transmission
|
|
gptkbp:uses
|
private key
public key
|
|
gptkbp:usesMathematics
|
gptkb:Euler's_totient_function
modular arithmetic
prime numbers
modular exponentiation
|
|
gptkbp:vulnerableTo
|
quantum computers (Shor's algorithm)
|
|
gptkbp:bfsParent
|
gptkb:Laboratory_for_Computer_Science
|
|
gptkbp:bfsLayer
|
4
|