RSA | |
Designers: | Ron Rivest, Adi Shamir, and Leonard Adleman |
Publish Date: | 1977 |
Type: | Public-Key |
Certification: | PKCS#1, ANSI X9.31, IEEE 1363 |
Key Size: | 1,024 to 4,096 bit typical |
Rounds: | 1 |
Cryptanalysis: | General number field sieve for classical computers; Shor's algorithm for quantum computers. A 795-bit key has been broken. |
dp |
c |
dq |
c |
bigInt.randBetween
uses Math.random
, which is not a cryptographically secure pseudorandom number generator.[21]dP |
c |
q |
p |
Bits | Time |
---|---|
128 | Less than 2 seconds |
192 | 16 seconds |
256 | 35 minutes |
260 | 1 hour |
Bits | Time | Memory used |
---|---|---|
128 | 0.4886 seconds | 0.1 MiB |
192 | 3.9979 seconds | 0.5 MiB |
256 | 103.1746 seconds | 3 MiB |
300 | 1175.7826 seconds | 10.9 MiB |