A Modified RSA Approach for Encrypting and Decrypting Text and Images Using Multi- Power, Multi Public Keys, Multi Prime Numbers and K-nearest Neighbor Algorithm

Abstract

One of public key algorithm is RSA cryptosystem used for encryption and decryption. This paper suggest a new algorithm by presenting the modified form of RSA algorithm in order to increase security of data during data exchange over the network. In our proposed algorithm it includes exponential form of rsa with four prime numbers and multiple (i.e. two) public keys and k-nearest neighbor algorithm. In exponential RSA we use exponential form of rsa which is based factorization problem, and at same time we are using four prime number instead of two prime numbers, and multiple public keys, to provide more security over the network and 'n' prime numbers are not easily factorable and increased the efficiency. Simultaneously, I have included k-nearest neighbor algorithm. Sometimes there is a situation in which the cipher text is the same as the plaintext and in such cases attacker can easily encrypt original message. We can also apply our algorithm for special characters like @, #. $, %, &, *. Proposed algorithm also implemented on images. And in future we will apply our algorithm on audio and video encryption and decryption also. Finally we compare proposed RSA with the original RSA algorithm.