The Hardware Implementation of Improved RSA Algorithm

Abstract- RSA algorithm is an asymmetric key cryptography. It is a block cipher. RSA has stronger security than single key cryptography. RSA has a pair of key- a private key a and public key. Sender sends the message encrypting it with the public key of receiver. Receiver receives the message by decrypting it with its private key. RSA provides authentication and integrity. So it is used in SSL for key exchange. At present 512 bit is considered insecure after the implementation of General Field Sieve Number [1].So in reference paper the idea of bit stuffing is introduced. RSA is bit stuffed after encryption that means a random number is appended to the cipher text and sent. At receiver, stuffed bit that is that random number is removed and then the cipher text is decrypted. Bit stuffing is suggested as a logic or measure to be used instead of increasing the number of bits in RSA. Since larger bit numbers will require more time and effort for calculation, bit stuffing will save time and effort. In this paper, this idea is implemented in hardware. Same security as with larger bit number say 1024 can be get in almost same time with lesser bit numbers say 512 bits with lesser band width requirement. In this paper, improving the SSL using modified RSA algorithm, coding is done in MATLAB