Computational Time of Modified RSA Approach for Encrypting and Decrypting Text using Multi-Power and K-Nearest Neighbor Algorithm (April 2018)
International journal of research studies in computer science and engineering · 2018
We have used a modified form of RSA cryptosystem with 4 prime numbers and K-Nearest Algorithm to increase the complexity and randomness of the algorithm, resulting in more security. KEY GENERATION Steps for public and private keys generation: Make a set of prime numbers PR, which has 'n' prime numbers. Choose any four prime numbers A, B, C, and D from the set PR. Calculate L (product of prime numbers)L=A*B*C*D. Calculate Φ (L)Φ (L) = (A-1)*(B-1)*(C-1)*(D-1). Calculate J (public key), such that GCD (J, Φ (L)) =1. Calculate K (private key), such that K*J mod Φ (L) =1. Choose random number N and O. Choose two numbers P and Q, such that Q = PJ. EncryptionSteps used for encryption of a message