An Improved Exponentiation Algorithm for RSA Cryptosystem

RSA encryption is one of the public-key methods that has been popular in last decade. Considering increment of security requirements, size of the keys has been larger. With key length growing, delay of exponentiation computation has changed into major problem in selecting longer keys. The binary or in other words square-and-multiply method is the classical exponentiation technique that is used in RSA. In this paper a new algorithm of exponentiation in RSA is presented that works in parallel, needs fewer multiplications and so has less delay. Therefore this technique is more useful in larger key computations.