Description: 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):
crypto rsa\CryptoRSA\dist\CryptoRSA.jar
crypto rsa\CryptoRSA\README.md
crypto rsa\CryptoRSA\src\cryptorsa\CryptoRSA.java
crypto rsa\CryptoRSA\src\cryptorsa\GUICryptoRSA.form
crypto rsa\CryptoRSA\src\cryptorsa\GUICryptoRSA.java
crypto rsa\CryptoRSA\src\cryptorsa\RSATools\RSA.java
crypto rsa\CryptoRSA\src\cryptorsa\RSATools
crypto rsa\CryptoRSA\src\cryptorsa
crypto rsa\CryptoRSA\dist
crypto rsa\CryptoRSA\src
crypto rsa\CryptoRSA
crypto rsa