More often, RSA is used to transmit shared keys for symmetric-key cryptography, which are then used for bulk encryption–decryption. Because of this, it is not commonly used to directly encrypt user data. There are no published methods to defeat the system if a large enough key is used. Whether it is as difficult as the factoring problem is an open question.
Breaking RSA encryption is known as the RSA problem. The security of RSA relies on the practical difficulty of factoring the product of two large prime numbers, the " factoring problem". Messages can be encrypted by anyone, via the public key, but can only be decoded by someone who knows the prime numbers. In a public-key cryptosystem, the encryption key is public and distinct from the decryption key, which is kept secret (private).Īn RSA user creates and publishes a public key based on two large prime numbers, along with an auxiliary value. An equivalent system was developed secretly in 1973 at Government Communications Headquarters (GCHQ) (the British signals intelligence agency) by the English mathematician Clifford Cocks. The acronym "RSA" comes from the surnames of Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977.
RSA ( Rivest–Shamir–Adleman) is a public-key cryptosystem, one of the oldest, that is widely used for secure data transmission. General number field sieve for classical computers Ron Rivest, Adi Shamir, and Leonard Adleman
0 kommentar(er)
