Description: the encryption key is public and it is different from the decryption key which is kept secret (private). In RSA, this asymmetry is based on the practical difficulty of the factorization of the product of two large prime numbers, the "factoring problem". The acronym RSA is made of the initial letters of the surnames of Ron .
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, and if the public key is large enough, only someone with knowledge of the prime numbers can decode the message feasibly.[2] Breaking RSA encryption is known as the RSA problem. Whether it is as difficult as the factoring problem remains an open question.
To Search:
File list (Check if you may need any files):
rsa c+++\rsa-master\.gitignore
rsa c+++\rsa-master\client\client.pro
rsa c+++\rsa-master\client\clientwindow.cpp
rsa c+++\rsa-master\client\clientwindow.h
rsa c+++\rsa-master\client\clientwindow.h.gch
rsa c+++\rsa-master\client\main.cpp
rsa c+++\rsa-master\common\bignumber.cpp
rsa c+++\rsa-master\common\bignumber.h
rsa c+++\rsa-master\common\common.pri
rsa c+++\rsa-master\common\constants.h
rsa c+++\rsa-master\common\rsa.cpp
rsa c+++\rsa-master\common\rsa.h
rsa c+++\rsa-master\RSA_chat.pro
rsa c+++\rsa-master\server\main.cpp
rsa c+++\rsa-master\server\server.cpp
rsa c+++\rsa-master\server\server.h
rsa c+++\rsa-master\server\server.pro
rsa c+++\rsa-master\client
rsa c+++\rsa-master\common
rsa c+++\rsa-master\server
rsa c+++\rsa-master
rsa c+++