Any secure communication/storage system requires converting data to be transmitted into an unintelligible form called ciphertext, and reconverting the data to its original form, call plaintext.
Rivest, Shamir and Adleman (RSA) have produced a public key cryptosystem by employing discrete exponentiation. The key to this system's success is that finding large prime numbers is computationally easy, but that factoring the product of two such numbers appears to be computationally
infeasible.
Archived content is no longer updated and is made available for historical reference only.