A study of RSA cryptography algorithms. (c2002)

Abstract

In this report, we provided a review of cryptography, smart card, and some algorithms. We also implement the algorithms: RSA for encryption and decryption of text, RSA for encryption and decryption of text using signature and secrecy, and a non-repudiation protocol. We empirically test these algorithms on a variety of key lengths and message sizes. We find that the algorithms executes very fast. The algorithm requires 0 (log n) linear time to run. Limitations were recorded while testing the algorithms. The letter v produces a wrong character in any place that it appears in the message. The algorithm caused an "overflow" error message on personal computers this problem was resolved by the Modular-Exponentiation algorithm.