Ronald Rivest, Adi Shamir, and Leonard M. Addelman of MIT devise a practical implementation of the idea known as RSA, the encryption and decryption algorithm based on the fact that decomposing a large number into its prime factors is a so-called intractable problem.
