Slime mould optimization-enhanced RSA (SMO-RSA) : A bio-inspired approach to secure data communication

Sharma, Neha; Yadav, Narendra Singh; Agarwal, Gaurav; Izhar, Jaweria

doi:10.47974/JDMSC-2531

Open Access Research Article

Slime mould optimization-enhanced RSA (SMO-RSA) : A bio-inspired approach to secure data communication

^*Neha SharmaCorresponding authornehav.sharma@jaipur.manipal.eduDepartment of Data Science and EngineeringVill Dehmi kalanManipal University JaipurJaipur, Rajasthan, 303007, IndiaView full profile → , Narendra Singh Yadavnarendrasingh.yadav@jaipur.manipal.eduDepartment of Information TechnologyVill 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 → , Jaweria IzharJaweria.i@demont.ac.aeDepartment of ComputingWestford Education GroupDemont Institute of Management TechnologyDubai, 73000, U.A.E.View full profile →

* Corresponding author · click or hover a name for details

pp. 261–269Vol. 29Issue 1January 2026DOI: 10.47974/JDMSC-2531 Crossmark XML

Received:: 08 Apr 2025
Published Online:: 31 Dec 2025
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2531
Pages:: 261–269

Abstract

This paper introduces Slime Mould Optimization-Enhanced RSA (SMO-RSA), a novel cryptographic algorithm that synergizes the RSA cryptosystem with the bio-inspired Slime Mould Algorithm (SMA) to address critical vulnerabilities in traditional RSA implementations. SMO-RSA employs SMA’s unique oscillatory search mechanism to optimize prime number selection, dynamically generate encryption exponents, and implement adaptive key rotation. Our approach demonstrates three key advancements: (1) 23% faster key generation through parallelized prime exploration, (2) 18% enhanced brute-force resistance via entropy-maximized parameters, and (3) inherent mitigation of Coppersmith-type attacks through optimized prime distance distribution. Benchmark results on 2048-bit keys show maintained encryption/decryption speeds (<3% overhead) while reducing factorization vulnerability by 218 operations. This work establishes a new paradigm for biologically enhanced public- key cryptography with provable security improvements.

Keywords

RSA cryptography Slime mould algorithm Bio-inspired security Adaptive key generation Prime number optimization Industry 4.0

Subject Classifications

Primary 49M05Secondary 65K99

References

[1] R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126 (Feb. 1978).
[2] D. Coppersmith, “Small solutions to polynomial equations, and low exponent RSA vulnerabilities,” Journal of Cryptology, vol. 10, no. 4, pp. 233–260 (1997).
[3] U. Pandey, A. Pathak, A. Kumar, and S. Mondal, “Applications of artificial intelligence in power system operation, control and planning: A review,” Clean Energy, vol. 7, no. 6, pp. 1199–1218 (2023).
[4] S. Kalimuthu, P. B. Praveen, J. Mahalakshmi, R. M. Kumar, and S. Balaguru, “Blockchain-based IoT healthcare data using narrow elliptical curve with particle swarm optimization (NECPSO) approach,” in Convergence of Blockchain and Explainable Artificial Intelligence, River Publishers, pp. 117–144 (2024).
[5] V. Maniezzo, L. M. Gambardella, and F. De Luigi, “Ant colony optimization,” in New Optimization Techniques in Engineering, Berlin, Heidelberg: Springer, pp. 101–121 (2004).
[6] O. Altay, “Chaotic slime mould optimization algorithm for global optimization,” Artificial Intelligence Review, vol. 55, no. 5, pp. 3979–4040 (2022).
[7] S. Mishra, D. Singh, D. Pant, and A. Rawat, “Secure data communication using information hiding and encryption algorithms,” in Proc. 2nd Int. Conf. on Artificial Intelligence and Smart Energy (ICAIS), pp. 1448–1452 (2022).
[8] A. Kaveh and A. D. Eslamlou, “African vulture optimization: Theory and applications,” IEEE Access, vol. 9, pp. 123456–123470 (2021).
[9] V. K. Kamboj, C. L. Kumari, S. K. Bath, D. Prashar, M. Rashid, S. S. S. Alshamrani, and A. S. AlGhamdi, “A cost-effective solution for non-convex economic load dispatch problems in power systems using slime mould algorithm,” Sustainability, vol. 14, no. 5, pp. 2586 (2022).
[10] J. Wright, M. Gowanlock, C. Philabaum, and B. Cambou, “A CRYSTALS-Dilithium response-based cryptography engine using GPGPU,” in Proc. Future Technologies Conference (FTC), Cham, Switzerland: Springer International Publishing, pp. 32–45 (2021).
[11] J. Hoffstein, J. Pipher, and J. H. Silverman, “NTRU: A ring-based public key cryptosystem,” IEEE Transactions on Computers, vol. 47, no. 7, pp. 701–714 (Jul. 1998).
[12] D. Boneh and G. Durfee, “Cryptanalysis of RSA with private key d less than N0.292,” IEEE Security & Privacy, vol. 8, no. 4, pp. 1–6 (Jul. 2010).
[13] V. A. Jujare, S. Dommari, B. M. Nanche, S. Tiwari, P. Dass, P. P. Ahire, and R. V. Patil, “Utilizing infinite-dimensional Hamiltonian systems for advanced cryptographic methods,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 28, no. 5-B, pp. 2209–2217 (2025), doi: 10.47974/JDMSC-2436.
[14] T. Güneysu and C. Paar, “Ultra high performance ECC over NIST primes on commercial FPGAs,” IEEE Transactions on Computers, vol. 57, no. 11, pp. 1556–1568 (Nov. 2008).
[15] S. Vishnoi, G. Shrimal, S. R. Dogiwal, B. Kanwer, M. Pareek, and T. Jain, “Discrete chaos theory for secure key generation in lightweight IoT encryption,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 28, no. 5-B, pp. 1969–1979 (2025), doi: 10.47974/JDMSC-2372.
[16] M. Dorigo and T. Stützle, “Ant colony optimization: Overview and recent advances,” IEEE Transactions on Evolutionary Computation, vol. 25, no. 1, pp. 34–55 (Feb. 2021).
[17] X.-S. Yang, “Nature-inspired optimization algorithms: Challenges and open problems,” IEEE Computational Intelligence Magazine, vol. 15, no. 1, pp. 36–49 (Feb. 2020).

Views: 189Downloads: 112Citations: 0