PERFORMANCE EVALUATION OF MODIFIED MODULAR EXPONENTIATION FOR RSA ALGORITHM

S. Satheeshkumar, S. Nithin Padmakumar, S. Sivakumar

Abstract: Authentication is a very important application of public-key cryptography. Cryptographic algorithms make use of secret keys known to send and receive information. When the keys are known the encryption / decryption process is an easy task, however decryption will be impossible without knowing the correct key. The shared public key is managed by the sender, to produce a message authentication code (MAC) for every transmitted message. There are many algorithms to enable security for message authentication (secret key). RSA is one such best algorithm for public key based message authentication approaches. But it takes more time for encryption and/or decryption process, when it has large key length. This research work evaluates the performance of RSA algorithm with modified modular exponentiation technique for message authentication. As a result modified modular exponent based RSA algorithm reduces execution time for encryption and decryption process.

Keywords: Cryptography, Message authentication, RSA, Modular Exponentiation.

DOI: https://doi.org/10.15623/ijret.2015.0412049