International Journal of Mathematical Sciences and Computing (IJMSC)
IJMSC Vol. 12, No. 1, 8 Feb. 2026
Cover page and Table of Contents: PDF (size: 881KB)
A Novel RSA Cryptosystem Variant Using Chaotic Exponent Selection and Ciphertext Blinding
PDF (881KB), PP.17-28
Views: 0 Downloads: 0
Author(s)
Arshi Fatima
1
Namita Tiwari
1,*
Index Terms
RSA Cryptosystem, Chaotic Maps, Logistic Map, Dynamic Exponentiation, Ciphertext Blinding, Public- Key Cryptography, Cryptographic Security
Abstract
This paper presents an enhanced variant of the RSA cryptosystem that integrates chaotic exponent selection and ciphertext blinding to address security limitations inherent in classical RSA. Traditional RSA relies on a fixed public exponent, which generates predictable encryption patterns and increases exposure to exponent-based attacks. In the proposed scheme, the encryption exponent is dynamically derived from a logistic-map–based chaotic sequence, introducing high sensitivity to initial conditions and producing session-dependent exponent values. This chaotic exponentiation increases unpredictability without modifying the established RSA framework. Additionally, a ciphertext blinding factor is incorporated to prevent deterministic outputs and strengthen resistance against chosen-ciphertext and side-channel attacks. The paper outlines the mathematical background of the logistic map, details the complete encryption and decryption procedures, and demonstrates the correctness of the method through a numerical example using small primes. A theoretical security analysis shows that the combined effects of chaotic exponent selection and blinding significantly improve resistance to key-related attacks while maintaining compatibility with the original RSA structure. These enhancements offer a lightweight and practical improvement to RSA for environments requiring increased confidentiality and unpredictability in exponent selection.
Cite This Paper
Arshi Fatima, Namita Tiwari, "A Novel RSA Cryptosystem Variant Using Chaotic Exponent Selection and Ciphertext Blinding", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.12, No.1, pp. 17-28, 2026. DOI: 10.5815/ijmsc.2026.01.02
Reference
[1]Jun-Jie Liu, Kang-Too Tsang, and Yu-Hui Deng. A variant rsa acceleration with parallelisation. International Journal of Parallel, Emergent and Distributed Systems, 37(3):318–332, 2022.
[2]Tao Wu, ShuGuo Li, and LiTian Liu. Fast rsa decryption through high-radix scalable montgomery modular multipliers. Science China. Information Sciences, 58(6):1–16, 2015.
[3]Seema Verma. Rsa variant with improved computational performance and memory usage. International Journal of Sensors Wireless Communications and Control, 7(3):211–225, 2017.
[4]Abhishek Rawat, Kartik Sehgal, Amartya Tiwari, Abhishek Sharma, and Ashish Joshi. A novel accelerated implementation of rsa using parallel processing. Journal of Discrete Mathematical Sciences and Cryptography, 22(2):309–322, 2019.
[5]CAM Paixao Filho. Dlg: An efficient variant of the rsa cryptosystem. Eprint Archive, 2003.
[6]Kamal Sehgal, Anurag Tiwari, and R K Bajaj. Fast and area efficient implementation of rsa algorithm. Procedia Computer Science, 152:198–205, 2019.
[7]Unal C¸avus¸o¨ glu, Akif Akg˘ ul, Ahmet Zengin, and Ihsan Pehlivan. The design and implementation of hybrid rsa¨ algorithm using a novel chaos based rng. Chaos, Solitons & Fractals, 104:655–667, 2017.
[8]Y. Wang and L. Zhang. Integrating rsa with chaotic encryption techniques. 2023.
[9]Ronald L. Rivest, Adi Shamir, and Leonard Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126, 1978.
[10]A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
[11]Robert M. May. Simple mathematical models with very complicated dynamics. Nature, 261(5560):459–467, 1976.
[12]Ljupco Kocarev. Chaos-based cryptography: A brief overview. IEEE Circuits and Systems Magazine, 1(3):6–21, 2001.
[13]Dan Boneh and Glenn Durfee. Cryptanalysis of rsa with private key d less than n0.292. 1592:1–11, 1999.
[14]M. Wiener. Cryptanalysis of short rsa secret exponents. In Proceedings of CRYPTO ’90, pages 372–389, 1990.
[15]J. Kelsey, B. Schneier, and D. Wagner. Cryptanalytic attacks on pseudorandom number generators. In Fast Software Encryption, 1998.
[16]Mihir Bellare and Phillip Rogaway. Optimal asymmetric encryption: How to encrypt with rsa. pages 92–111, 1995.
[17]Dan Boneh and Hovav Shacham. Fast variants of rsa. CryptoBytes, 5(1), 2002.
[18]Michael Wiener. Rebalanced rsa. Proceedings of the USENIX Security Symposium, 1990.