{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:30:58Z","timestamp":1775068258420,"version":"3.50.1"},"reference-count":110,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Artificial intelligence (AI) is a modern technology that allows plenty of advantages in daily life, such as predicting weather, finding directions, classifying images and videos, even automatically generating code, text, and videos. Other essential technologies such as blockchain and cybersecurity also benefit from AI. As a core component used in blockchain and cybersecurity, cryptography can benefit from AI in order to enhance the confidentiality and integrity of cyberspace. In this paper, we review the algorithms underlying four prominent cryptographic cryptosystems, namely the Advanced Encryption Standard, the Rivest\u2013Shamir\u2013Adleman, Learning with Errors, and the Ascon family of cryptographic algorithms for authenticated encryption. Where possible, we pinpoint areas where AI can be used to help improve their security.<\/jats:p>","DOI":"10.3390\/cryptography7030039","type":"journal-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T12:10:23Z","timestamp":1691755823000},"page":"39","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Applications of Neural Network-Based AI in Cryptography"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0372-1757","authenticated-orcid":false,"given":"Abderrahmane","family":"Nitaj","sequence":"first","affiliation":[{"name":"Department of Mathematics, Normandie University, UNICAEN, CNRS, LMNO, 14000 Caen, France"}]},{"given":"Tajjeeddine","family":"Rachidi","sequence":"additional","affiliation":[{"name":"School of Science and Engineering, Al Akhawayn University in Ifrane, Ifrane 53000, Morocco"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,11]]},"reference":[{"key":"ref_1","unstructured":"Imai, H., Rivest, R.L., and Matsumoto, T. (1991). Advances in Cryptology\u2014ASIACRYPT\u201991, Proceedings of the ASIACRYPT 1991, Fujiyoshida, Japan, 11\u201314 November 1991, Springer. Lecture Notes in Computer Science."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ertel, W. (2017). Introduction to Artificial Intelligence, Springer. [2nd ed.]. Undergraduate Topics in Computer Science.","DOI":"10.1007\/978-3-319-58487-4"},{"key":"ref_3","unstructured":"Tencent Research Institute, CAICT, Tencent AI Lab, and Tencent Open Platform (2021). Artificial Intelligence, A National Strategy, Palgrave Macmillan."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Naccache, D., and Sauveron, D. (2014). Information Security Theory and Practice: Securing the Internet of Things, Proceedings of the WISTP, Heraklion, Crete, Greece, 30 June\u20132 July 2014, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-662-43826-8"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A Method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_7","first-page":"203","article-title":"Twenty years of attacks on the RSA cryptosystem","volume":"46","author":"Boneh","year":"1999","journal-title":"N. Am. Math. Soc."},{"key":"ref_8","unstructured":"Hinek, M.J. (2009). Cryptanalysis of RSA and Its Variants, CRC Press. Chapman & Hall\/CRC Cryptography and Network Security."},{"key":"ref_9","unstructured":"Lek, K., and Rajapakse, N. (2012). Cryptography: Protocols, Design and Applications, Nova Science Publishers."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/09720529.2018.1564201","article-title":"Forty years of attacks on the RSA cryptosystem","volume":"22","author":"Mumtaz","year":"2019","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Regev, O. (2005, January 22\u201324). On lattices, learning with errors, random linear codes, and cryptography. Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), Baltimore, MD, USA.","DOI":"10.1145\/1060590.1060603"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1561\/0400000074","article-title":"A decade of lattice cryptography","volume":"10","author":"Peikert","year":"2016","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"ref_13","unstructured":"National Institute of Standards and Technology (2023, June 30). Post-Quantum Cryptography, Available online: https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Schwabe, P., Seiler, G., and Stehl\u00e9, D. (2018, January 24). CRYSTALS\u2014Kyber: A CCA-Secure Module-Lattice-Based KEM. Proceedings of the 2018 IEEE European Symposium on Security and Privacy (EuroS&P), London, UK.","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., and Stehl\u00e9, D. (2018). CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst., 238\u2013268.","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"ref_16","unstructured":"Prest, T., Fouque, P.-A., Hoffstein, J., Kirchner, P., Lyubashevsky, V., Pornin, T., Ricosset, T., Seiler, G., Whyte, W., and Zhang, Z. (2023, June 30). FALCON. National Institute of Standards and Technology, Available online: https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions."},{"key":"ref_17","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., and Schwabe, P. (2023, June 30). The SPHINCS+ Signature Framework. Cryptology ePrint Archive, Paper 2019\/1086. Available online: https:\/\/eprint.iacr.org\/2019\/1086."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., and Xagawa, K. (2009, January 6\u201310). Efficient public key encryption based on ideal lattices. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan.","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"ref_19","unstructured":"Lyubashevsky, V., Peikert, C., and Regev, O. (June, January 30). On ideal lattices and learning with errors over rings. Proceedings of the Advances in Cryptology\u2014EUROCRYPT, French Riviera, French."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","article-title":"Worst-case to average-case reductions for module lattices","volume":"75","author":"Langlois","year":"2015","journal-title":"Des. Codes Cryptogr."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Bruna, J., Regev, O., Song, M.J., and Tang, Y. (2020). Continuous LWE. arXiv.","DOI":"10.1145\/3406325.3451000"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00145-021-09398-9","article-title":"ASCON v1.2: Lightweight Authenticated Encryption and Hashing","volume":"34","author":"Dobraunig","year":"2021","journal-title":"J. Cryptol."},{"key":"ref_23","unstructured":"Bernstein, D.J. (2023, June 30). The CAESAR Committee Secretary. Caesar: Competition for Authenticated Encryption: Security, Applicability, and Robustness. Available online: https:\/\/competitions.cr.yp.to\/caesar.html."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kocher, P. (1996, January 18\u201322). Timing attacks on implementations of Diffie-Hellmann, RSA, DSS, and other systems. Proceedings of the CRYPTO\u201996, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-68697-5_9"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s13389-011-0006-y","article-title":"Introduction to differential power analysis","volume":"1","author":"Kocher","year":"2011","journal-title":"J. Cryptogr. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0167-4048(85)90046-X","article-title":"Electromagnetic Radiation from Video Display Units: An Eavesdropping Risk","volume":"4","year":"1985","journal-title":"Comput. Secur."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Kaliski, B.S. (1997). Advances in Cryptology\u2014CRYPTO\u201997, Proceedings of the CRYPTO, Santa Barbara, CA, USA, 17\u201321 August 1997, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0052223"},{"key":"ref_28","unstructured":"Genkin, D., Shamir, A., and Tromer, E. (2023, June 30). RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis. Cryptology ePrint Archive, Paper 2013\/857. Available online: https:\/\/eprint.iacr.org\/2013\/857."},{"key":"ref_29","unstructured":"Russell, S., and Norvig, P. (2020). Artificial Intelligence: A Modern Approach, Prentice Hall. [4th ed.]."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Zheng, B., Verma, S., Zhou, J., Tsang, I.W., and Chen, F. (2021). Imitation Learning: Progress, Taxonomies and Challenges. IEEE Trans. Neural Netw. Learn. Syst., 1\u201316.","DOI":"10.1109\/TNNLS.2022.3213246"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Mukhamediev, R.I., and Popova, Y. (2022). Review of Artificial Intelligence and Machine Learning Technologies: Classification, Restrictions, Opportunities and Challenges. Mathematics, 10.","DOI":"10.3390\/math10152552"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Jin, D., and Lin, S. (2012). Advances in Computer Science and Information Engineering, Springer. Advances in Intelligent and Soft Computing.","DOI":"10.1007\/978-3-642-30126-1"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02551274","article-title":"Approximation by Superpositions of Sigmoidal Function","volume":"2","author":"Cybenko","year":"1989","journal-title":"Math. Control. Signals Syst."},{"key":"ref_34","unstructured":"(2023, June 30). CS231n: Deep Learning for Computer Vision, Convolutional Neural Networks for Visual Cognition. Available online: https:\/\/cs231n.github.io\/neural-networks-1."},{"key":"ref_35","unstructured":"Goldman, S. (2023, June 30). Foundation Models: 2022\u2019s AI Paradigm Shift. VentureBeat. Available online: https:\/\/venturebeat.com\/ai\/foundation-models-2022s-ai-paradigm-shift\/."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_37","first-page":"3133","article-title":"Do we need hundreds of classifiers to solve real world classification problems?","volume":"15","author":"Cernadas","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref_38","first-page":"2672","article-title":"Generative adversarial nets","volume":"27","author":"Goodfellow","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_39","unstructured":"Vaswani, A., Shazeer, N.M., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., and Polosukhin, I. (2017, January 4\u20139). Attention is all you need. Proceedings of the Advances in Neural Information Processing Systems 30 (NIPS 2017), Long Beach, CA, USA."},{"key":"ref_40","unstructured":"(2023, June 30). The LLM Index. Available online: https:\/\/sapling.ai\/llm\/index."},{"key":"ref_41","unstructured":"Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., and Heckert, A. (2023, June 30). A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST Special Publication 800-22 (May 2001), Available online: https:\/\/nvlpubs.nist.gov\/nistpubs\/Legacy\/SP\/nistspecialpublication800-22r1a.pdf."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"30039","DOI":"10.1109\/ACCESS.2022.3159694","article-title":"Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network","volume":"10","author":"Lee","year":"2021","journal-title":"IEEE Access"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Levina, A., and Bolozovskii, R. (2023). Application of Neural Networks to Power Analysis. Eng. Proc., 33.","DOI":"10.3390\/engproc2023033027"},{"key":"ref_44","unstructured":"Karras, D.A., and Zorkadis, V. (2003, January 20\u201324). Improving pseudo random bit sequence generation and evaluation for secure internet communication using neural network techniques. Proceedings of the International Joint Conference on Neural Networks (IJCNN 2003), Portland, OR, USA."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"6868506","DOI":"10.1155\/2018\/6868506","article-title":"Research on Plaintext Restoration of AES Based on Neural Network","volume":"2018","author":"Hu","year":"2018","journal-title":"Secur. Commun. Netw."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Hao, Q., and Yao, D.D. (2019, January 23). Neural Cryptanalysis: Metrics, Methodology, and Applications in CPS Ciphers. Proceedings of the IEEE Conference on Dependable and Secure Computing (DSC), Hangzhou, China.","DOI":"10.1109\/DSC47296.2019.8937659"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Sun, L., G\u00e9rault, D., Benamira, A., and Peyrin, T. (2020, January 2\u20133). NeuroGIFT: Using a Machine Learning Based Sat Solver for Cryptanalysis. Proceedings of the International Conference on Cyber Security Cryptography and Machine Learning 2020, Beer Sheva, Israel.","DOI":"10.1007\/978-3-030-49785-9_5"},{"key":"ref_48","unstructured":"Albassal, A., and Wahdan, A. (2004, January 5\u20137). Neural network based cryptanalysis of a feistel type block cipher. Proceedings of the International Conference on Electrical, Electronic and Computer Engineering (ICEEC\u201904), Cairo, Egypt."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Alani, M.M. (2012, January 12\u201315). Neuro-Cryptanalysis of DES and Triple-DES. Proceedings of the International Conference on Neural Information Processing, Doha, Qatar.","DOI":"10.1007\/978-3-642-34500-5_75"},{"key":"ref_50","unstructured":"Yee, L.P., and de Silva, L. (2002, January 12\u201317). Application of MultiLayer Perceptron Network as a one-way hash function. Proceedings of the 2002 International Joint Conference on Neural Networks (IJCNN\u201902 (Cat. No.02CH37290)), Honolulu, HI, USA."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MCI.2008.919075","article-title":"On the use of recurrent neural networks to design symmetric ciphers","volume":"3","author":"Arvandi","year":"2008","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_52","unstructured":"Maghrebi, H., Portigliatti, T., and Prouff, E. (2023, June 30). Breaking Cryptographic Implementations Using Deep Learning Techniques. IACR Cryptology ePrint Archive, Paper 2016\/921. Available online: https:\/\/eprint.iacr.org\/2016\/921."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Hou, B., Li, Y., Zhao, H., and Wu, B. (2020, January 14\u201318). Linear Attack on Round-Reduced DES Using Deep Learning. Proceedings of the European Symposium on Research in Computer Security, Guildford, UK.","DOI":"10.1007\/978-3-030-59013-0_7"},{"key":"ref_54","unstructured":"Gomez, A.N., Huang, S., Zhang, I., Li, B.M., Osama, M., and Kaiser, L. (2018). Unsupervised Cipher Cracking Using Discrete GANs. arXiv."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Gohr, A. (2019, January 18\u201322). Improving Attacks on Round-Reduced Speck32\/64 Using Deep Learning. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-030-26951-7_6"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Arai, K. (2022). Advances in Information and Communication, Proceedings of the FICC 2022, San Francisco, USA, 3\u20134 March 2022, Springer. Lecture Notes in Networks and Systems.","DOI":"10.1007\/978-3-030-98012-2"},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Carbone, M., Conin, V., Corn\u00e9lie, M.-A., Dassance, F., Dufresne, G., Dumas, C., Prouff, E., and Venelli, A. (2019). Deep Learning to Evaluate Secure RSA Implementations. IACR Trans. Cryptogr. Hardw. Embed. Syst., 132\u2013161.","DOI":"10.46586\/tches.v2019.i2.132-161"},{"key":"ref_58","unstructured":"National Institute of Standards and Technology (2023, June 30). Federal Information Processing Standards Publication 197: Announcing the Advanced Encryption Standard (AES), Available online: http:\/\/csrc.nist.gov\/publications\/fips\/fips197\/fips-197.pdf."},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Daemen, J., and Rijmen, V. (2002). The Design of Rijndael: AES\u2014The Advanced Encryption Standard, Springer. Information Security and Cryptography.","DOI":"10.1007\/978-3-662-04722-4"},{"key":"ref_60","unstructured":"(1977). Data Encryption Standard. Standard No. NBS FIPS PUB 46."},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996). A fast quantum mechanical algorithm for database search. arXiv.","DOI":"10.1145\/237814.237866"},{"key":"ref_62","first-page":"386","article-title":"Linear Cryptanalysis Method for DES Cipher","volume":"Volume 765","author":"Helleseth","year":"1993","journal-title":"Advances in Cryptology\u2014EUROCRYPT\u201993, Proceedings of the EUROCRYPT, Lofthus, Norway, 23\u201327 May 1993"},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF00630563","article-title":"Differential cryptanalysis of DES-like cryptosystems","volume":"4","author":"Biham","year":"1991","journal-title":"J. Cryptol."},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Aldini, A., Gorrieri, R., and Martinelli, F. (2005). Foundations of Security Analysis and Design III, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/11554578"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-45238-6_7","article-title":"A Differential Fault Attack Technique against SPN Structures, with Application to the AES and KHAZAD","volume":"Volume 2779","author":"Walter","year":"2003","journal-title":"Cryptographic Hardware and Embedded Systems\u2014CHES 2003"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-60590-8_16","article-title":"Truncated and higher order differentials","volume":"1008","author":"Preneel","year":"1995","journal-title":"Fast Software Encryption"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-48519-8_12","article-title":"The boomerang attack","volume":"1636","author":"Knudsen","year":"1999","journal-title":"Fast Software Encryption"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/978-3-319-78375-8_22","article-title":"Boomerang connectivity table: A New cryptanalysis tool","volume":"Volume 10821","author":"Nielsen","year":"2018","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2018"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","article-title":"Algebraic attacks on stream ciphers with linear feedback","volume":"Volume 2656","author":"Biham","year":"2003","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2003"},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/978-3-540-24676-3_28","article-title":"Algebraic Attacks and Decomposition of Boolean Functions","volume":"Volume 3027","author":"Cachin","year":"2004","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2004"},{"key":"ref_71","doi-asserted-by":"crossref","unstructured":"Carlet, C. (2021). Boolean Functions for Cryptography and Coding Theory, Cambridge University Press.","DOI":"10.1017\/9781108606806"},{"key":"ref_72","unstructured":"Braeken, A. (2006). Cryptographic Properties of Boolean Functions and S-Boxes. [Ph.D. Thesis, Katholieke Universiteit Leuven]."},{"key":"ref_73","first-page":"523","article-title":"On the design of S-boxes","volume":"218","author":"Williams","year":"1986","journal-title":"Advances in Cryptology\u2014CRYPTO\u201985"},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Stern, J. (1999). Advances in Cryptology\u2014EUROCRYPT \u201999, Proceedings of the EUROCRYPT, Prague, Czech Republic, 2\u20136 May 1999, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-48910-X"},{"key":"ref_75","unstructured":"Lim, J., Ng, D., and Ng, R. (2023, July 03). SoK: Security Evaluation of SBox-Based Block Ciphers. Cryptology ePrint Archive, Paper 2022\/1098. Available online: https:\/\/eprint.iacr.org\/2022\/1098."},{"key":"ref_76","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., and Lenstra, H.W. (1993). The Development of the Number Field Sieve, Springer. Lecture Notes in Mathematics.","DOI":"10.1007\/BFb0091534"},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01933667","article-title":"A Monte Carlo method for factorization","volume":"15","author":"Pollard","year":"1975","journal-title":"BIT Numer. Math."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2307\/1971363","article-title":"Factoring integers with elliptic curves","volume":"126","author":"Lenstra","year":"1987","journal-title":"Ann. Math."},{"key":"ref_79","first-page":"89","article-title":"Analysis and Comparison of Some Integer Factoring Algorithms","volume":"Volume 154","author":"Lenstra","year":"1982","journal-title":"Computational Methods in Number Theory, Part I"},{"key":"ref_80","doi-asserted-by":"crossref","unstructured":"Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thom\u00e9, E., and Zimmermann, P. (2023, July 06). Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. Cryptology ePrint Archive, Paper 2020\/697. Available online: https:\/\/eprint.iacr.org\/2020\/697.","DOI":"10.1007\/978-3-030-56880-1_3"},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s001459900030","article-title":"Small solutions to polynomial equations, and low exponent RSA vulnerabilities","volume":"10","author":"Coppersmith","year":"1997","journal-title":"J. Cryptol."},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Nguyen, P., and Vall\u00e9e, B. (2009). The LLL Algorithm, Springer. Information Security and Cryptography.","DOI":"10.1007\/978-3-642-02295-1"},{"key":"ref_83","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/18.54902","article-title":"Cryptanalysis of short RSA secret exponents","volume":"36","author":"Wiener","year":"1990","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_84","first-page":"1","article-title":"Cryptanalysis of RSA with private key d less than N0.292","volume":"Volume 1592","author":"Boneh","year":"1999","journal-title":"Proceedings of the Advances in Cryptology\u2014Eurocrypt\u201999"},{"key":"ref_85","doi-asserted-by":"crossref","unstructured":"Ko\u00e7, \u00c7.K., Naccache, D., and Paar, C. (2001). Cryptographic Hardware and Embedded Systems\u2014CHES 2001, Proceedings of the CHES, Paris, France, 14\u201316 May 2001, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-44709-1"},{"key":"ref_86","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/TC.2004.13","article-title":"Low-cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity","volume":"53","author":"Ciet","year":"2004","journal-title":"IEEE Trans. Comput."},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1109\/TC.2006.135","article-title":"An RSA Implementation Resistant to Fault Attacks and to Simple Power Analysis","volume":"55","author":"Giraud","year":"2006","journal-title":"IEEE Trans. Comput."},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s13389-011-0008-9","article-title":"SPA-Resistant Binary Exponentiation with Optimal Execution Time","volume":"1","author":"Moreno","year":"2011","journal-title":"J. Cryptogr. Eng."},{"key":"ref_89","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., and Chatterjee, S. (2011). Progress in Cryptology\u2014INDOCRYPT 2011, Proceedings of the INDOCRYPT, Chennai, India, 11\u201314 December 2011, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-642-25578-6"},{"key":"ref_90","doi-asserted-by":"crossref","unstructured":"Batina, L., and Robshaw, M. (2014). Cryptographic Hardware and Embedded Systems\u2014CHES 2014, Proceedings of the CHES, Busan, Republic of Korea, 23\u201326 September 2014, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-662-44709-3"},{"key":"ref_91","doi-asserted-by":"crossref","unstructured":"Fumy, W. (1997). Advances in Cryptology\u2014EUROCRYPT\u201997, Proceedings of EUROCRYPT, Konstanz, Germany, 11\u201315 May 1997, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-69053-0"},{"key":"ref_92","first-page":"130","article-title":"RSA with CRT: A New Cost-Effective Solution to Thwart Fault Attacks","volume":"Volume 5154","author":"Oswald","year":"2008","journal-title":"Proceedings of the Cryptographic Hardware and Embedded Systems\u2014CHES"},{"key":"ref_93","doi-asserted-by":"crossref","unstructured":"Sauveron, D., Markantonakis, K., Bilas, A., and Quisquater, J.J. (2007). Information Security Theory and Practices. Smart Cards, Mobile and Ubiquitous Computing Systems, Proceedings of the WISTP, Heraklion, Crete, Greece, 9\u201311 May 2007, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-540-72354-7"},{"key":"ref_94","unstructured":"(2023, July 07). BSI\u2014Technical Guideline, Cryptographic Mechanisms: Recommendations and Key Lengths, BSI TR-02102-1. 9 January 2023. Available online: https:\/\/www.bsi.bund.de\/SharedDocs\/Downloads\/EN\/BSI\/Publications\/TechGuidelines\/TG02102\/BSI-TR-02102-1.pdf?__blob=publicationFile."},{"key":"ref_95","unstructured":"Jansen, B., and Nakayama, K. (August, January 31). Neural networks following a binary approach applied to the integer prime-factorization problem. Proceedings of the 2005 IEEE International Joint Conference on Neural Networks, Montreal, QC, Canada."},{"key":"ref_96","first-page":"1","article-title":"Integer Prime Factorization with Deep Learning","volume":"2","author":"Murat","year":"2021","journal-title":"Adv. Interdiscip. Sci."},{"key":"ref_97","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s002000100088","article-title":"Cryptanalysis of RSA with small prime difference","volume":"13","year":"2002","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"ref_98","first-page":"E4446","article-title":"Unexpected biases in the distribution of consecutive primes","volume":"113","author":"Soundararajan","year":"2016","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_99","unstructured":"Bernstein, D.J. (2023, July 01). How to Find the Smooth Parts of Integers. Available online: http:\/\/cr.yp.to\/factorization\/smoothparts-20040510.pdf."},{"key":"ref_100","doi-asserted-by":"crossref","unstructured":"Nemec, M., S\u00fds, M., Svenda, P., Klinec, D., and Maty\u00e1s, V. (November, January 30). The Return of Coppersmith\u2019s Attack: Practical Factorization of Widely Used RSA Moduli. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3133969"},{"key":"ref_101","doi-asserted-by":"crossref","unstructured":"Jarecki, S., and Tsudik, G. (2009). Public Key Cryptography\u2014PKC 2009, Proceedings of the PKC, Irvine, CA, USA, 18\u201320 March 2009, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-642-00468-1"},{"key":"ref_102","first-page":"70","article-title":"Implicit factoring with shared most significant and middle bits","volume":"Volume 6056","author":"Nguyen","year":"2010","journal-title":"Proceedings of the PKC"},{"key":"ref_103","first-page":"1","article-title":"A generalized Wiener attack on RSA","volume":"Volume 2947","author":"May","year":"2004","journal-title":"Proceedings of the Public Key Cryptography\u2014PKC"},{"key":"ref_104","doi-asserted-by":"crossref","unstructured":"Vaudenay, S. (2008). Progress in Cryptology\u2014AFRICACRYPT 2008, Proceedings of the AFRICACRYPT, Casablanca, Morocco, 11\u201314 June 2008, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-540-68164-9"},{"key":"ref_105","doi-asserted-by":"crossref","unstructured":"Cramer, R. (2005). Advances in Cryptology\u2014EUROCRYPT 2005, Proceedings of the EUROCRYPT, Aarhus, Denmark, 22\u201326 May 2005, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/b136415"},{"key":"ref_106","doi-asserted-by":"crossref","unstructured":"Boneh, D. (2003). Advances in Cryptology\u2014CRYPTO 2003, Proceedings of the CRYPTO, Santa Barbara, CA, USA, 17\u201321 August 2003, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/b11817"},{"key":"ref_107","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-319-13051-4_21","article-title":"Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound","volume":"Volume 8781","author":"Joux","year":"2014","journal-title":"Selected Areas in Cryptography\u2014SAC 2014"},{"key":"ref_108","doi-asserted-by":"crossref","unstructured":"Peikert, C. (2009, January 31). Public-key cryptosystems from the worst-case shortest vector problem. Proceedings of the STOC 2009, Washington, DC, USA.","DOI":"10.1145\/1536414.1536461"},{"key":"ref_109","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., and Stehl\u00e9, D. (2013). Classical Hardness of Learning with Errors. arXiv.","DOI":"10.1145\/2488608.2488680"},{"key":"ref_110","doi-asserted-by":"crossref","unstructured":"Phillips, P., Hahn, C., Fontana, P., Yates, A., Greene, K., Broniatowski, D., and Przybocki, M. (2023, June 30). Four Principles of Explainable Artificial Intelligence. 29 September 2021. Available online: https:\/\/doi:10.6028\/nist.ir.8312.","DOI":"10.6028\/NIST.IR.8312"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/3\/39\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:31:54Z","timestamp":1760128314000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/3\/39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,11]]},"references-count":110,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["cryptography7030039"],"URL":"https:\/\/doi.org\/10.3390\/cryptography7030039","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,11]]}}}