To Design and Implement Novel Method of Encryption using Modified RSA and Chinese Remainder Theorem
Jaideep Patel, Nitin Janwe · 2014
Security can only be as strong as the weakest link. In this world of cryptography, it is now well established, that the weakest link lies in the implementation of cryptographic algorithms. This paper deals with RSA algorithm with and without Chinese Remainder Theorem. In practice, RSA public exponents are chosen to be small which makes encryption and signature verification reasonably fast. Private exponents however should never be small for obvious security reasons. This makes decryption slow. One way to speed things up is to split things up, calculate modulo p and modulo q using Chinese Remainder Theorem. Random numbers are the numbers, which play an important role for various network security applications. In essence, CRT says it is possible to reconstruct integers in a certain range from their residues modulo a set of pair wise relatively prime modulo.