TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Enhancing RSA algorithm security through advanced combinatorial n! permutations in cryptographic protocols

, * , , , ,

* Corresponding author · click or hover a name for details

pp. 445–452Vol. 29Issue 2-AFebruary 2026DOI: 10.47974/JDMSC-2476 Crossmark XML
Received:
08 Apr 2025
Published Online:
31 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2476
Pages:
445–452

Abstract

Quantum computing and improved cryptanalysis have rendered the RSA algorithm less safe, but it remains a vital aspect of public-key encryption. Newly, this work enhances the RSA algorithm’s secure protocol by adding sophisticated combinatorial n! Permutations. To create a vast and surprising keyspace, factorial-based permutations of key components like ciphertext and plaintext are used. These n! variants are carefully exploited for key creation, encryption, and decoding. They make illegal file decoding tougher without changing the process. This reduces brute-force and factorisation risks. The design additionally employs these padding and message encoding variants to improve spread and confusion, following Shannon’s cryptography principles. The entropy and statistical unpredictability of protected data have improved, and theoretical study supports the assumption that the number of key configurations may expand exponentially without affecting data processing speed.

Keywords

Subject Classifications

11T71

References

[1] G. Barbu, “FA-LLLing for RSA: Lattice-based fault attacks against RSA encryption and signature,” in Proc. 2022 Workshop on Fault Detection and Tolerance in Cryptography (FDTC), Italy, pp. 30–37 (2022).
[2] W. Cao, H. Shi, H. Chen, J. Chen, L. Fan, and W. Wu, “Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA,” in Topics in Cryptology – CT-RSA 2022, Springer (2022).
[3] P. Basaligheh and S. Kothawade, “Biometric authentication systems: Advances in security and usability,” Int. J. Recent Adv. Eng. Technol., vol. 13, no. 1, pp. 20–25 (2025).
[4] A. Godbole, R. Dhabliya, V. Deshpande, S. A. Sivakumar, B. M. Shankar, and V. Khetani, “Ethical hacking and penetration testing strengthening cybersecurity posture through offensive security measures,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 4, pp. 1295–1305 (2024).
[5] Z. Liu, C. Cao, R. Xu, C. Liu, and P. K. M. Bi, “Analysis of two papers based on RSA algorithm: Plagiarism investigation of HRSA algorithm,” in Proc. 2024 14th Int. Conf. Inf. Technol. Med. Educ. (ITME), Guiyang, China, pp. 461–465 (2024).
[6] N. D. Garisto, “This month in physics history September 2002: Schön scandal report is released,” Amer. Phys. Soc. (Aug. 2022).
[7] S. Kumar, H. Singh, I. Gupta, and A. J. Gupta, “Symmetric encryption scheme based on quasigroup using chained mode of operation,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 8, pp. 2337–2364 (2024).
[8] C.-H. Hsia, S.-J. Lou, H.-H. Chang, and D. Xuan, “Novel hybrid public/private key cryptography based on perfect Gaussian integer sequences,” IEEE Access, vol. 9, pp. 145045–145059 (2021).
[9] B. Sankhyan, S. Sharma, and M. Singh, “Exploring modern cryptographic algorithms: An experimental analysis,” in Proc. 2024 15th Int. Conf. Comput., Commun. Netw. Technol. (ICCCNT), Kamand, India, pp. 1–7 (2024).
[10] S. Harsha, K. Aswini, G. Sahith, G. V. N. Abhiram, and D. B. Kumar, “Data integrity verification in images through SHA-based security,” Int. J. Adv. Comput. Eng. Commun. Technol., vol. 14, no. 1, pp. 92–102 (2025).

Views: 114Downloads: 9Citations: 0