RSA (cryptosystem)
| General | |
|---|---|
| Designers | Ron Rivest, Adi Shamir, and Leonard Adleman |
| First published | 1977 |
| Certification | PKCS#1, ANSI X9.31, IEEE 1363 |
| Cipher detail | |
| Key sizes | 1,024 to 4,096 bit typical |
| Rounds | 1 |
| Best public cryptanalysis | |
|
General number field sieve for classical computers Shor's algorithm for quantum computers A 768-bit key has been broken |
|
RSA is one of the first practical public-key cryptosystems and is widely used for secure data transmission. In such a cryptosystem, the encryption key is public and differs from the decryption key which is kept secret. In RSA, this asymmetry is based on the practical difficulty of factoring the product of two large prime numbers, the factoring problem. RSA is made of the initial letters of the surnames of Ron Rivest, Adi Shamir, and Leonard Adleman, who first publicly described the algorithm in 1977. Clifford Cocks, an English mathematician working for the UK intelligence agency GCHQ, had developed an equivalent system in 1973, but it was not declassified until 1997.
A user of RSA creates and then publishes a public key based on two large prime numbers, along with an auxiliary value. The prime numbers must be kept secret. Anyone can use the public key to encrypt a message, but with currently published methods, if the public key is large enough, only someone with knowledge of the prime numbers can feasibly decode the message. Breaking RSA encryption is known as the RSA problem; whether it is as hard as the factoring problem remains an open question.
RSA is a relatively slow algorithm, and because of this it is less commonly used to directly encrypt user data. More often, RSA passes encrypted shared keys for symmetric key cryptography which in turn can perform bulk encryption-decryption operations at much higher speed.
The idea of an asymmetric public-private key cryptosystem is attributed to Whitfield Diffie and Martin Hellman, who published the concept in 1976. They also introduced digital signatures and attempted to apply number theory; their formulation used a shared secret key created from exponentiation of some number, modulo a prime numbers. However, they left open the problem of realizing a one-way function, possibly because the difficulty of factoring was not well studied at the time.
...
Wikipedia