[1] D. M. Bressoud, Factorization and primality testing. Springer Science & Business Media (2012).[2] S. Goldwasser and S. Micali, ‘Probabilistic encryption & how to play mental poker keeping secret all partial information’, in Providing sound foundations for cryptography: on the work of Shafi Goldwasser and Silvio Micali, pp. 173–201 (2019).[3] J. Katz and M. Yung, ‘Threshold cryptosystems based on factoring’, in Advances in Cryptology—ASIACRYPT 2002: 8th International Conference on the Theory and Application of Cryptology and Information Security Queenstown, New Zealand, December 1–5, 2002 Proceedings 8, Springer, pp. 192–205 (2002).[4] A. O. Pittenger, An introduction to quantum computing algorithms, vol. 19. Springer Science & Business Media (2012).[5] P. Sharma, A. K. Gupta, and A. Vijay, ‘Notice of violation of IEEE publication principles: Modified integer factorization algorithm using V-Factor method’, in 2012 Second International Conference on Advanced Computing & Communication Technologies, IEEE, pp. 423–425 (2012).[6] S. Y. Yan and S. Y. Yan, ‘Quantum Algorithms for Integer Factorization’, Quantum Comput. Number Theory, pp. 59–119 (2015).[7] B. Kaliski, ‘The mathematics of the rsa public-key cryptosystem’, RSA Lab. (2006).[8] A. E. Mezher, ‘Enhanced RSA cryptosystem based on multiplicity of public and private keys’, Int. J. Electr. Comput. Eng., vol. 8, no. 5, p. 3949 (2018).[9] K. D. Singh, P. Singh, G. L. Saini, and D. Panwar, ‘Privacy-preserving cryptographic solutions for medical image protection : The secure force algorithm and intelligent encryption systems’, J. Discrete Math. Sci. Cryptogr. (2024), doi: https://doi.org/10.47974/JDMSC-1926.[10] Y. V. Lakshmi, K. Naveena, M. Ramya, N. Pravallika, T. Sindhu, and V. Namitha, ‘Medical image encryption using enhanced Rivest Shamir adleman algorithm’, in 2023 Third International Conference on Artificial Intelligence and Smart Energy (ICAIS), IEEE, pp. 1–5 (2023).[11] K. Ahmad, A. Kamal, and K. A. B. Ahmad, ‘Prime number’, in Emerging Security Algorithms and Techniques, Chapman and Hall/CRC, pp. 27–45 (2019).[12] A. Bhattacharjya, X. Zhong, J. Wang, and X. Li, ‘A secure hybrid RSA (SHRSA)-based lightweight and efficient personal messaging communication protocol’, Digit. Twin Technol. Smart Cities, pp. 191–212 (2020).[13] K. Balasubramanian and M. P. Pitchai, ‘A survey of fermat factorization algorithms for factoring RSA composite numbers’, Multidiscip. Sci. J. (2023), [Online]. Available: https://api.semanticscholar.org/CorpusID:267163601[14] R. Imam, Q. M. Areeb, A. Alturki, and F. Anwer, ‘Systematic and critical review of rsa based public key cryptographic schemes: Past and present status’, IEEE Access, vol. 9, pp. 155949–155976 (2021).[15] P. Riess and J. Shawe-Taylor, ‘The RSA Public Key Cryptosystem’ (1989). [Online]. Available: https://api.semanticscholar.org/CorpusID:60326110[16] A. P. U. Siahaan, ‘Factorization Hack of RSA Secret Numbers’, Int. J. Eng. Trends Technol. (2016), doi: 10.14445/22315381/IJETT-V37P204.[17] J. M. Smiljanic and P. Ivanis, ‘Attacks on the RSA cryptosystem using integer factorization’ (2011). doi: 10.1109/FOR.2011.6143608.[18] D. A. Buell, ‘How to Factor a Number’ (2021). doi: 10.1007/978-3-030-73492-3_11.[19] A. S. Shatnawi, M. M. Almazari, Z. AlShara, E. Taqieddin, and D. Mustafa, ‘RSA cryptanalysis—Fermat factorization exact bound and the role of integer sequences in factorization problem’, J. Inf. Secur. Appl., vol. 78, p. 103614 (2023).[20] P. Shiu, ‘Fermat’s method of factorisation’, Math. Gaz., vol. 99, no. 544, pp. 97–103 (2015).[21] M. Nemec, M. Sys, P. Svenda, D. Klinec, and V. Matyas, ‘The return of coppersmith’s attack: Practical factorization of widely used RSA moduli’, in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1631–1648 (2017).[22] P. Singh et al., ‘Understanding RSA Algorithm in Cryptography’ (2024).[23] K. Somsuk and S. Kasemvilas, ‘Possible prime modified fermat factorization: New improved integer factorization to decrease computation time for breaking rsa’, in Recent Advances in Information and Communication Technology: Proceedings of the 10th International Conference on Computing and Information Technology (IC2IT2014), Springer, pp. 325–334 (2014).[24] D. Boneh and M. K. Franklin, ‘Efficient generation of shared RSA keys’, J ACM, vol. 48, pp. 702–722 (2001).[25] P. Sarkar and S. Singh, ‘New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields’, in Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part I 35, Springer, pp. 429–458 (2016).[26] Y. Dasari and V. Dondeti, ‘RSA security in cloud computing: A distributed model for integrated GNFS with Black Wiedemann algorithm for integer factorization’, 4TH Int. Sci. Conf. ALKAFEEL Univ. ISCKU 2022 (2023), [Online]. Available: https://api.semanticscholar.org/CorpusID:266519173[27] H. Arukala, ‘Factorization in Cybersecurity: a Dual Role of Defense and Vulnerability in the Age of Quantum Computing’ (2024).[28] S. Joshi, A. K. Bairwa, A. P. Pljonkin, P. Garg, and K. Agrawal, ‘From Pre-Quantum to Post-Quantum RSA’, Proc. 6th Int. Conf. Netw. Intell. Syst. Secur. (2023), [Online]. Available: https://api.semanticscholar.org/CorpusID:265158671[29] D. J. Bernstein, N. Heninger, P. Lou, and L. Valenta, ‘Post-quantum RSA’, in Post-Quantum Cryptography (2017). [Online]. Available: https://api.semanticscholar.org/CorpusID:31025145[30] A. Ekert and R. Jozsa, ‘Quantum computation and Shor’s factoring algorithm’, Rev. Mod. Phys., vol. 68, no. 3, p. 733 (1996).[31] J. Laflamme, ‘Implementing the Castryck-Decru attack on SIDH with general primes’, Master’s Thesis, University of Waterloo (2024).[32] V. Chamola, A. Jolfaei, V. Chanana, P. Parashari, and V. Hassija, ‘Information security in the post quantum era for 5G and beyond networks: Threats to existing cryptography, and post-quantum cryptography’, Comput. Commun., vol. 176, pp. 99–118 (2021).[33] N. Sood, ‘Cryptography in Post Quantum Computing Era’, SSRN Electron. J. (2024), [Online]. Available: https://api.semanticscholar.org/CorpusID:267673425[34] R. Primas, P. Pessl, and S. Mangard, ‘Single-trace side-channel attacks on masked lattice-based encryption’, in Cryptographic Hardware and Embedded Systems–CHES 2017: 19th International Conference, Taipei, Taiwan, September 25-28, 2017, Proceedings, Springer, pp. 513–533 (2017).[35] X. Lou, T. Zhang, J. Jiang, and Y. Zhang, ‘A survey of microarchitectural side-channel vulnerabilities, attacks, and defenses in cryptography’, ACM Comput. Surv. CSUR, vol. 54, no. 6, pp. 1–37 (2021).[36] P. C. Kocher, ‘Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems’, in Advances in Cryptology—CRYPTO’96: 16th Annual International Cryptology Conference Santa Barbara, California, USA August 18–22, 1996 Proceedings 16, Springer, pp. 104–113 (1996).[37] B. Hettwer, S. Gehrer, and T. Güneysu, ‘Applications of machine learning techniques in side-channel attacks: a survey’, J. Cryptogr. Eng., vol. 10, no. 2, pp. 135–162 (2020).[38] P. C. Kocher, J. Jaffe, B. Jun, and P. Rohatgi, ‘Introduction to differential power analysis’, J. Cryptogr. Eng., vol. 1, pp. 5–27 (2011).[39] J. Kaur and S. Das, ‘A survey on cache timing channel attacks for multicore processors’, J. Hardw. Syst. Secur., vol. 5, no. 2, pp. 169–189 (2021).[40] A. Bauer, E. Jaulmes, V. Lomné, E. Prouff, and T. Roche, ‘Side-channel attack against RSA key generation algorithms’, in International Workshop on Cryptographic Hardware and Embedded Systems, Springer, pp. 223–241 (2014).[41] A. Barenghi, L. Breveglieri, I. Koren, and D. Naccache, ‘Fault Injection Attacks on Cryptographic Devices: Theory, Practice, and Countermeasures’, Proc. IEEE, vol. 100, pp. 3056–3076 (2012).[42] Á. Kiss, J. Krämer, P. Rauzy, and J.-P. Seifert, ‘Algorithmic countermeasures against fault attacks and power analysis for RSA-CRT’, in Constructive Side-Channel Analysis and Secure Design: 7th International Workshop, COSADE 2016, Graz, Austria, April 14-15, 2016, Revised Selected Papers 7, Springer, pp. 111–129 (2016).[43] M. Mumtaz and L. Ping, ‘Forty years of attacks on the RSA cryptosystem: A brief survey’, J. Discrete Math. Sci. Cryptogr., vol. 22, no. 1, pp. 9–29 (2019).[44] Y. Lu, L. Peng, and N. Kunihiro, ‘Recent Progress on Coppersmith’s Lattice-Based Method: A Survey’, in CREST Crypto-Math Project (2017). [Online]. Available: https://api.semanticscholar.org/CorpusID:67692742[45] M. R. Albrecht, M. Haller, L. Mareková, and K. G. Paterson, ‘Caveat implementor! Key recovery attacks on MEGA’, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, pp. 190–218 (2023).[46] E. O. Sodiya, U. J. Umoga, O. O. Amoo, and A. Atadoga, ‘Quantum computing and its potential impact on U.S. cybersecurity: A review: Scrutinizing the challenges and opportunities presented by quantum technologies in safeguarding digital assets’, Glob. J. Eng. Technol. Adv. (2024), [Online]. Available: https://api.semanticscholar.org/CorpusID:268012290[47] P. S. R. Henrique and R. Prasad, 6G: the road to the future wireless technologies 2030. River Publishers (2022).[48] C. Beaver, ‘Adventures in cryptology: Exploration-worthy project topics’, PRIMUS, vol. 34, no. 1, pp. 13–31 (2024).[49] J. Howe, T. Prest, and D. Apon, ‘SoK: How (not) to design and implement post-quantum cryptography’, in Cryptographers’ Track at the RSA Conference, Springer, pp. 444–477 (2021).[50] R. Omollo and A. Okoth, ‘Factorization Algorithm for Semi-primes and the Cryptanalysis of Rivest-Shamir-Adleman (RSA) Cryptography’, Asian J. Res. Comput. Sci. (2024), doi: 10.9734/ajrcos/2024/v17i6458.[51] Y. Min, Z. Wang, and Q. Meng, ‘Preselected integer factorization-based RSA (Rivest, Shamir and Adleman) password cracking system and method’ (2014).[52] A. Samojluk, ‘About special properties of triangular numbers for immediate factorization’, Tech. Sci. (2022), doi: 10.31648/ts.7278.[53] V. Hoggatt Jr and M. Bicknell, ‘Triangular numbers’, Fibonacci Q, vol. 12, pp. 221–230 (1974).