Quantum-resistant adaptive RSA (QR-ARSA) for secure networks

Jhajharia, Kavita; Sharma, Neha; Agarwal, Gaurav

doi:10.47974/JDMSC-2420

Open Access Research Article

Quantum-resistant adaptive RSA (QR-ARSA) for secure networks

Kavita JhajhariaKavita.jhajharia@jaipur.manipal.eduDepartment of Information TechnologyVillage Dehmi kalanManipal University JaipurJaipur, Rajasthan, 303007, IndiaView full profile → , ^*Neha SharmaCorresponding authornehav.sharma@jaipur.manipal.eduDepartment of Data Science and EngineeringVillage Dehmi kalanManipal University JaipurJaipur, Rajasthan, 303007, IndiaView full profile → , Gaurav Agarwalgaggarwal@amity.uzDepartment of Information Technology and EngineeringAmity University in TashkentTashkent, 100128, UzbekistanView full profile →

* Corresponding author · click or hover a name for details

pp. 2025–2035Vol. 28Issue 5-BAugust 2025DOI: 10.47974/JDMSC-2420 Crossmark XML

Received:: 05 Nov 2024
Published Online:: 30 Aug 2025
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2420
Pages:: 2025–2035

Abstract

This paper introduces Quantum-Resistant Adaptive RSA (QR-ARSA), a groundbreaking cryptographic algorithm that enhances traditional RSA with three innovative mechanisms: (1) dynamic prime morphing to prevent factorization attacks, (2) quantum-entangled key pairing for MITM resistance, and (3) noise-injected modular exponentiation to eliminate side-channel vulnerabilities. QR-ARSA achieves 2256 security against quantum attacks while maintaining <20% overhead over standard RSA-3072. Theoretical analysis proves its resistance to Shor’s algorithm (requiring 4× more qubits) and differential power analysis (SNR < -120dB). Benchmark results on FPGA platforms demonstrate 37% faster key rotation compared to post-quantum NIST finalists. The algorithm is backward compatible with existing PKI infrastructure, making it immediately deployable for secure network protocols.

Keywords

Post-quantum cryptography Adaptive RSA Side-channel resistance Entangled keys

Subject Classifications

Primary 93A30Secondary 49K15

References

[1] P. W. Shor, “Polynomial‑time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, vol. 26, no. 5, pp. 1484–1509 (Oct. 1997).
[2] Hayder Sabeeh Hadi, Ahmed J. Obaid, and Mohammed Ayad Alkhafaji, “Secure and efficient intelligent transport system based on cryptographic authentication mechanism for vehicular ad hoc networks,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 5, pp. 1539–1554 (2024), doi: 10.47974/JDMSC-1936.
[3] Dan Boneh, “Twenty years of attacks on the RSA cryptosystem,” Notices of the American Mathematical Society, vol. 46, no. 2, pp. 203–213 (1999).
[4] Lei Wang, Jian Wu, Rui Yuan, Dawei Zhang, Jingjing Liu, Shu Jiang, et al., “Dynamic adaptive cross‑chain trading mode for multi‑microgrid joint operation,” Sensors, vol. 20, no. 21, Art. no. 6096 (2020).
[5] Robert Avanzi, Joppe Bos, Leo Ducas, Eike Kiltz, Thomas Lepoint, Vadim Lyubashevsky, et al., “CRYSTALS‑Kyber algorithm specifications and supporting documentation,” NIST PQC Round 2, pp. 1–43 (2019).
[6] Tim Güneysu, “Timing attacks meet side‑channel analysis: Breaking RSA‑CRT in practice,” in Proceedings of CHES, vol. 10529, pp. 257–274 (2018).
[7] Doyinsolami Olaoye, Quantum Cryptanalysis: Breaking Classical Encryption with Shor’s and Grover’s Algorithms, 2025. (Full given name found via IEEE DataPort: Doyinsolami Olaoye) IEEE DataPort
[8] Arjen K. Lenstra, “Dynamic RSA variants: Security and performance trade‑offs,” Journal of Cryptology, vol. 33, no. 4, pp. 1989–2021 (Oct. 2020).
[9] K. G. Gupta, Bhuvan Unhelkar, S. Siva Shankar, Tulika Chakrabarti, Prasun Chakrabarti, B. Sivaneasan, and Martin Margala, “A novel optimization‑based time‑enabled proxy re‑encryption approach for securing e‑health data in cloud environments: An interdisciplinary statistical perspective,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 8, pp. 2419–2429 (2024), doi: 10.47974/JDMSC-2015.
[10] F. S. Gharehchopogh, A. Ucan, T. Ibrikci, B. Arasteh, and G. Isik, “Slime mould algorithm: A comprehensive survey of its variants and applications,” Archives of Computational Methods in Engineering, vol. 30, no. 4, pp. 2683–2723 (2023).
[11] Nizar Mouha and Celi Celi, “A vulnerability in implementations of SHA‑3, SHAKE, EdDSA, and other NIST‑approved algorithms,” in Cryptographers’ Track at the RSA Conference, Cham: Springer, pp. 3–28 (Apr. 2023).
[12] Don Coppersmith, “Small solutions to polynomial equations,” in Proceedings of Eurocrypt, vol. 1070, pp. 20–31 (1996).
[13] Daniele Catalano, Phong Q. Nguyen, and Jacques Stern, “The hardness of Hensel lifting: The case of RSA and discrete logarithm,” in Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Berlin, Germany: Springer, pp. 299–310 (Nov. 2002).
[14] N. Sharma, N. S. Yadav, and S. Sharma, “Classification of UNSW‑NB15 dataset using exploratory data analysis using ensemble learning,” EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, vol. 8, no. 29, Art. no. 29 (2021), doi: 10.4108/eai.13‑10‑2021.171319.
[15] N. Sharma and N. S. Yadav, “Ensemble learning‑based classification of UNSW‑NB15 dataset using exploratory data analysis,” in 2021 9th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO), pp. 1–7, IEEE (Sept. 2021).
[16] Nour Moustafa, Jian Hu, and James Slay, “A holistic review of network anomaly detection systems: A comprehensive survey,” Journal of Network and Computer Applications, vol. 128, pp. 33–55 (Feb. 2019), doi: 10.1016/j.jnca.2018.12.006.
[17] Shatha A. Salman, Fatema A. Sadiq, and Viean A. Z. Al‑Aabdeen, “Construction of cubic magic with cryptography application,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 5, pp. 1641–1651 (2024), doi: 10.47974/JDMSC‑2007.

Views: 250Downloads: 65Citations: 0