A FAST IMPLEMENTATION OF THE RSA ALGORITHM USING THE GNU MP

Organizations in both public and private sectors have become increasingly dependent on electronic data processing. Protecting these important data is of utmost concern to the organizations and cryptography is one of the primary ways to do the job. Public Key Cryptography is used to protect digital data going through an insecure channel from one place to another. RSA algorithm is extensively used in the popular implementations of Public Key Infrastructures. In this paper, we have done a efficient implementation of RSA algorithm using gmp library from GNU. We have also analyzed the changes in the performance of the algorithm by changing the number of characters we are encoding together (we termed this procedure as bitwise incremental RSA).

[1]  Anupam Joshi,et al.  Security in Sensor Networks , 2020, Texts in Computer Science.

[2]  Gene Tsudik,et al.  New multiparty authentication services and key agreement protocols , 2000, IEEE Journal on Selected Areas in Communications.

[3]  David E. Culler,et al.  SPINS: security protocols for sensor networks , 2001, MobiCom '01.

[4]  Daniel M. Gordon,et al.  A Survey of Fast Exponentiation Methods , 1998, J. Algorithms.

[5]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[6]  Jacques Stern,et al.  RSA-OAEP Is Secure under the RSA Assumption , 2001, Journal of Cryptology.

[7]  Shai Halevi,et al.  Computing Inverses over a Shared Secret Modulus , 2000, EUROCRYPT.

[8]  Jacques Stern,et al.  Security Proofs for Signature Schemes , 1996, EUROCRYPT.

[9]  Yuke Wang,et al.  An efficient implementation of multi-prime RSA on DSP processor , 2003, 2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698).

[10]  Markus Jakobsson,et al.  Almost Optimal Hash Sequence Traversal , 2002, Financial Cryptography.