A novel improvement in RSA algorithm

Ranasinghe, Rajitha; Chathurangi, Madusha; Athukorala, Pabasara

doi:10.47974/JDMSC-1628

Open Access Research Article

A novel improvement in RSA algorithm

^*Rajitha RanasingheCorresponding authorrajithamath@sci.pdn.ac.lkDepartment of MathematicsUniversity of PeradeniyaPeradeniya, 20400, Sri LankaView full profile → , Madusha Chathurangimadushac@sci.pdn.ac.lkDepartment of MathematicsUniversity of PeradeniyaPeradeniya, 20400, Sri LankaView full profile → , Pabasara Athukoralapabasara.a@nsbm.ac.lkNSBM Green UniversityPitipana, Homagama, 10206, Sri LankaView full profile →

* Corresponding author · click or hover a name for details

pp. 143–150Vol. 27Issue 1January 2024DOI: 10.47974/JDMSC-1628 Crossmark XML

Received:: 10 Aug 2021
Accepted:: 02 Feb 2022
Published Online:: 24 Jan 2024
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-1628
Pages:: 143–150

Abstract

In this study, we propose a new cryptographic scheme based on the textbook RSA algorithm associating the concept of continued fractions. The algorithm is designed under the three primary steps of key generation, encryption, and decryption. The key generation of the system is improved to generate a large encryption key without affecting the decryption key. The use of continued fractions gives an additional advantage as it encrypts a string of plaintexts by encrypting only two integers which optimizes the time and the memory consumption. The encryption process and the decryption process are similar to that of the standard RSA algorithm, insomuch the implemented algorithm does not affect the security of the original RSA algorithm which depends on the factoring problem. In addition, as the algorithm uses a large encryption key, it has been proven that the system is secure against the Wiener’s attack.

Keywords

Continued fraction Factoring problem RSA cryptosystem Wiener’s attack

Subject Classifications

(2010) 11Z0511A0711T7194A60

References

[1] D. Boneh. Twenty years of attacks on the RSA cryptosystem. Notices of the AMS, 46(2):203–213, 1999.
[2] M. J. Hinek. Cryptanalysis of RSA and its variants. Taylor and Francis group: CRC Press, 2009.
[3] P.G.R.S. Ranasinghe, A.P. Madhushani, and H.M.M. Chathurangi. Novel improvement in RSA algorithm, Proceedings of PGIS Research Congress 2021, Vol. 8, pg. 61., Postgraduate Institute of Science, University of Peradeniya.
[4] M. Mumtaz and L. Ping. Forty years of attacks on the rsa cryptosystem: A brief survey. Journal of Discrete Mathematical Sciences and Cryptography, 22(1):9–29, 2019.
[5] R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126, 1978.
[6] S. Verma and D. Garg. Improvement in RSA Cryptosystem. Journal of Advances in Information Technology, 2(3):146–151, 2011.
[7] M. J. Wiener. Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information theory, 36(3):553–558, 1990.

Views: 476Downloads: 120Citations: 4