A Key Generation Implementation of Modified RSA Technique in Encryption and Decryption

Abstract

Cryptography was introduced from the concern of securing the sensitive information newlineexchanged over the digital network from being hacked. In cryptography, the sender newlineencrypts the information with some special (secret) key and on the other end, the receiver newlinedecrypts the information by using same or another key. In this way, only the receiver is newlineable to interpret that information. newlineCryptosystems can be divided into two types, first one is secret key cryptosystem newline(symmetric) and second one is public key cryptosystem (asymmetric). In secret key newlinecryptosystem, the same key is given to both the sender and the receiver. With the help of newlinethe key, the sender encrypts the message and on the other hand the receiver decrypts the newlineencrypted message to get the original message. It is easy to implement as only one key is newlineused in the whole process but with this easiness some drawbacks are also there such as newlinekey distribution, non repudiation problem, authentication etc. newlineAround 1975, Whitfield Diffie and Martin Hellman suggested public key (asymmetric newlinekey) cryptography. In this type of cryptography, there are two types of key are used, one newlineis public key and the other one is private key. These keys are mathematically related to newlineeach other. Public key is disclosed to everyone while private key is kept secret. Public newlinekey used for the encryption of the message that is to be sent while the private key helps in newlinedecrypting the encrypted message for the receiver. Private Key cannot be generated by newlinethe attacker using public key even though both keys are interrelated. newlineIn this thesis we have proposed a modified RSA cryptographic algorithm and its results newlineare compared with existing algorithms and it is found that the proposed algorithm works newlinebetter than the existing one.