Renovated RSA Cryptosystem for secure Data Transmission

摘要

Cryptographic techniques are the principal means to provide information security, RSA (Rivest-Shamir-Adleman) is one of the first practical public-key cryptosystems and is widely used for secure data transmission. The first part of this paper describes the functionality of RSA and its attacks, identified 'factoring the N' is the most common one. Now authors have proposed the Renovated RSA (RRSA) cryptosystem through the use of Armstrong prime number(r) in addition to the existing two prime numbers (p, q) to generate the public (e) and private (d) keys. The theoretical proof of the newly developed cryptosystem was shown to ensure the functionality of the original RSA not to be disturbed. In the second part of this paper, strength of RRSA cryptosystem was analysed over size of the variable N, in such a way that it cannot be factored i.e., N with more than 232 decimal digits. The theoretical samples considered as per the algorithm requirements, revealed that the size of the variable N in RRSA can go beyond 232 decimal digits by using an Armstrong prime (r) even with the less number of digits in p, q when compared to RSA. A series of algorithms were also discussed to perform the calculations involved in the encryption and decryption processes at a faster rate even with several hundred digits there in e, d, N.