{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T20:49:04Z","timestamp":1771793344981,"version":"3.50.1"},"reference-count":78,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000},"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>Elliptic Curve Cryptography (ECC) is a technology based on the arithmetic of elliptic curves used to build strong and efficient cryptosystems and infrastructures. Several ECC systems, such as the Diffie\u2013Hellman key exchange and the Elliptic Curve Digital Signature Algorithm, are deployed in real-life applications to enhance the security and efficiency of digital transactions. ECC has gained even more importance since the introduction of Bitcoin, the peer-to-peer electronic cash system, by Satoshi Nakamoto in 2008. In parallel, the integration of artificial intelligence, particularly machine learning, in various applications has increased the demand for robust cryptographic systems to ensure safety and security. In this paper, we present an overview of machine learning and Elliptic Curve Cryptography algorithms. We begin with a detailed review of the main ECC systems and evaluate their efficiency and security. Subsequently, we investigate potential applications of machine learning-based techniques to enhance the security and performance of ECC. This study includes the generation of optimal parameters for ECC systems using machine learning algorithms.<\/jats:p>","DOI":"10.3390\/cryptography9010003","type":"journal-article","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T12:37:19Z","timestamp":1735648639000},"page":"3","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Elliptic Curve Cryptography with Machine Learning"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9992-2747","authenticated-orcid":false,"given":"Jihane","family":"Jebrane","sequence":"first","affiliation":[{"name":"Mathematics, Computer Science and Applications TEAM, Abdelmalek Essa\u00e2di University, ENSA, Tangier 90000, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7937-1108","authenticated-orcid":false,"given":"Akram","family":"Chhaybi","sequence":"additional","affiliation":[{"name":"Mathematics, Computer Science and Applications TEAM, Abdelmalek Essa\u00e2di University, ENSA, Tangier 90000, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3426-4050","authenticated-orcid":false,"given":"Saiida","family":"Lazaar","sequence":"additional","affiliation":[{"name":"Mathematics, Computer Science and Applications TEAM, Abdelmalek Essa\u00e2di University, ENSA, Tangier 90000, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0372-1757","authenticated-orcid":false,"given":"Abderrahmane","family":"Nitaj","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Normandie University, UNICAEN, CNRS, LMNO, 14000 Caen, France"}]}],"member":"1968","published-online":{"date-parts":[[2024,12,30]]},"reference":[{"key":"ref_1","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_2","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_3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve cryptosystems","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","article-title":"Use of elliptic curves in cryptography","volume":"Volume 218","author":"Miller","year":"1986","journal-title":"Advances in Cryptology\u2014CRYPTO \u201985 Proceedings. CRYPTO 1985"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"IT-22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","first-page":"469","article-title":"A public key cryptosystem and signature scheme based on discrete logarithms","volume":"IT-31","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/s102070100002","article-title":"The elliptic curve digital signature algorithm (ECDSA)","volume":"1","author":"Johnson","year":"2001","journal-title":"Int. J. Inf. Secur."},{"key":"ref_8","first-page":"84","article-title":"A pseudo-random bit generator based on elliptic logarithms","volume":"Volume 263","author":"Odlyzko","year":"1986","journal-title":"Advances in Cryptology\u2014CRYPTO\u201986"},{"key":"ref_9","unstructured":"Nakamoto, S. (2024, December 25). Bitcoin: A Peer-to-Peer Electronic Cash System. Available online: http:\/\/bitcoin.org\/bitcoin.pdf."},{"key":"ref_10","unstructured":"Rescorla, E. (2024, December 25). The Transport Layer Security (TLS) Protocol Version 1.3. IETF TLS Workgroup. RFC 8446. Proposed Standard. Available online: https:\/\/www.rfc-editor.org\/info\/rfc8446."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Imai, H., Rivest, R.L., and Matsumoto, T. (1993). Cryptography and machine learning. Advances in Cryptology\u2014ASIACRYPT \u201991, Springer.","DOI":"10.1007\/3-540-57332-1"},{"key":"ref_12","unstructured":"Volna, E., Kotyrba, M., Kocian, V., and Janosek, M. (June, January 29). Cryptography based on neural network. Proceedings of the ECMS, Koblenz, Germany."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Noura, H., Samhat, A.E., Harkouss, Y., and Yahiya, T.A. (2015, January 8\u20139). Design and realization of a new neural block cipher. Proceedings of the 2015 International Conference on Applied Research in Computer Science and Engineering (ICAR), Beirut, Lebanon.","DOI":"10.1109\/ARCSE.2015.7338131"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Sagar, V., and Kumar, K. (2014, January 14\u201316). A symmetric key cryptographic algorithm using counter propagation network (cpn). Proceedings of the 2014 International Conference on Information and Communication Technology for Competitive Strategies, Udaipur Rajasthan, India.","DOI":"10.1145\/2677855.2677906"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10916-017-0851-z","article-title":"DNA Cryptography and Deep Learning using Genetic Algorithm with NW algorithm for Key Generation","volume":"42","author":"Kalsi","year":"2018","journal-title":"J. Med. Syst."},{"key":"ref_16","unstructured":"Abadi, M., and Andersen, D.G. (2016). Learning to protect communications with adversarial neural cryptography. arXiv."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"14148","DOI":"10.48084\/etasr.7181","article-title":"Enhancing Data Security through Machine Learning-based Key Generation and Encryption","volume":"14","author":"Saini","year":"2024","journal-title":"Eng. Technol. Appl. Sci. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"e8226","DOI":"10.1002\/cpe.8226","article-title":"Leveraging generative adversarial networks for enhanced cryptographic key generation","volume":"36","author":"Singh","year":"2024","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Kumar, S., and Sharma, D. (2023). Key Generation in Cryptography Using Elliptic-Curve Cryptography and Genetic Algorithm. Eng. Proc., 59.","DOI":"10.3390\/engproc2023059059"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Nitaj, A., and Rachidi, T. (2023). Applications of Neural Network-Based AI in Cryptography. Cryptography, 7.","DOI":"10.3390\/cryptography7030039"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Canteaut, A., and Standaert, F.X. (2021). A Deeper Look at Machine Learning-Based Cryptanalysis. Advances in Cryptology EUROCRYPT 2021. EUROCRYPT 2021, Springer.","DOI":"10.1007\/978-3-030-77870-5"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/MSEC.2022.3188190","article-title":"Oprea: Machine Learning Security and Privacy","volume":"20","author":"Baracaldo","year":"2022","journal-title":"IEEE Secur. Priv."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1186\/s40537-024-00886-w","article-title":"Machine learning-based network intrusion detection for big and imbalanced data using oversampling, stacking feature embedding and feature extraction","volume":"11","author":"Talukder","year":"2024","journal-title":"J. Big Data"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Dini, P., Elhanashi, A., Begni, A., Saponara, S., Zheng, Q., and Gasmi, K. (2023). Overview on Intrusion Detection Systems Design Exploiting Machine Learning for Networking Cybersecurity. Appl. Sci., 13.","DOI":"10.3390\/app13137507"},{"key":"ref_25","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_26","doi-asserted-by":"crossref","unstructured":"Maghrebi, H., Portigliatti, T., and Prouff, E. (2016). Breaking cryptographic implementations using deep learning techniques. Security, Privacy, and Applied Cryptography Engineering\u2014Proceedings of the International Conference on Security, Privacy, and Applied Cryptography Engineering Hyderabad, India, 14\u201318 December 2016, Springer.","DOI":"10.1007\/978-3-319-49445-6_1"},{"key":"ref_27","first-page":"1539","article-title":"Comparing AI Algorithms for Optimizing Elliptic Curve Cryptography Parameters in E-Commerce Integrations: A Pre-Quantum Analysis","volume":"15","author":"Tellez","year":"2024","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Villegas, F.I.L., and Cordero, C.V. (2021, January 6\u20139). Machine Learning Analysis for Side-Channel Attacks over Elliptic Curve Cryptography. Proceedings of the 2021 IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON), Valpara\u00c3so, Chile.","DOI":"10.1109\/CHILECON54041.2021.9702996"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Bhasin, S., Mendelson, A., and Nandi, M. (2019). One Trace Is All It Takes: Machine Learning-Based Side-Channel Attack on EdDSA. Security, Privacy, and Applied Cryptography Engineering, SPACE 2019, Springer.","DOI":"10.1007\/978-3-030-35869-3"},{"key":"ref_30","unstructured":"W\u00f8ien, M.C., Catak, F.O., Kuzlu, M., and Cali, U. (2024). Neural Networks Meet Elliptic Curve Cryptography: A Novel Approach to Secure Communication. arXiv."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Chinbat, T., Madanian, S., Airehrour, D., and Hassandoust, F. (2024). Machine learning cryptography methods for IoT in healthcare. BMC Med. Inform. Decis. Mak., 24.","DOI":"10.1186\/s12911-024-02548-6"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1037\/h0042519","article-title":"The Perceptron: A probabilistic model for information storage and organization in the brain","volume":"65","author":"Rosenblatt","year":"1958","journal-title":"Psychol. Rev."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","article-title":"A normal form for elliptic curves","volume":"44","author":"Edwards","year":"2007","journal-title":"Bull. Amer. Math. Soc."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., and Lange, T. (2007). Faster addition and doubling on elliptic curves. Advances in Cryptology\u2014ASIACRYPT 2007, Springer.","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","article-title":"Speeding the Pollard and elliptic curve methods of factorization","volume":"48","author":"Montgomery","year":"1987","journal-title":"Math. Comput."},{"key":"ref_36","first-page":"279","article-title":"CM-curves with good cryptographic properties","volume":"Volume 576","author":"Koblitz","year":"1992","journal-title":"Advances in Cryptology-Crypto\u201991"},{"key":"ref_37","unstructured":"Pornin, T. (2024, December 25). Efficient and Complete Formulas for Binary Curves Cryptology ePrint Archive, Paper 2022\/1325. Available online: https:\/\/eprint.iacr.org\/2022\/1325."},{"key":"ref_38","unstructured":"ANSI X9.62 (2024, December 25). Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA). Available online: https:\/\/standards.globalspec.com\/std\/1955141\/ansi-x9-62."},{"key":"ref_39","unstructured":"(2000). IEEE Standard Specifications for Public-Key Cryptography (Standard No. IEEE Std 1363-2000). Available online: https:\/\/ieeexplore.ieee.org\/document\/891000."},{"key":"ref_40","unstructured":"Hankerson, D., Vanstone, S., and Menezes, A. (2004). Guide to Elliptic Curve Cryptography, Springer."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01933190","article-title":"An improved monte carlo factorization algorithm","volume":"20","author":"Brent","year":"1980","journal-title":"Bit Numer. Math."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1090\/S0025-5718-00-01213-8","article-title":"On random walks for Pollard\u2019s rho method","volume":"70","author":"Teske","year":"2000","journal-title":"Math. Comput."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00003816","article-title":"Parallel collision search with cryptanalytic applications","volume":"12","author":"Oorschot","year":"1999","journal-title":"J. Cryptol."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","article-title":"An improved algorithm for computing logarithms over GF(p) and its cryptographic significance","volume":"24","author":"Pohlig","year":"1977","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Kocher, P. (1996). Timing attacks on implementations of Diffie-Hellmann, RSA, DSS, and other systems. CRYPTO\u201996, Springer.","DOI":"10.1007\/3-540-68697-5_9"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Kocher, P., Jaffe, J., and Jun, B. (1999, January 15\u201319). Differential power analysis. Proceedings of the 19th International Advances in Cryptology Conference, CRYPTO\u201999, Barbara, CA, USA.","DOI":"10.1007\/3-540-48405-1_25"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Fumy, W. (1997). On the Importance of Checking Cryptographic Protocols for Faults. Advances in Cryptology, Proc. EUROCRYPT\u201997, Springer.","DOI":"10.1007\/3-540-69053-0"},{"key":"ref_48","first-page":"283","article-title":"Elliptic curves and side-channel analysis","volume":"4","author":"Joye","year":"2003","journal-title":"ST J. Syst. Res."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Brier, E., and Joye, M. (2002). Weierstrass elliptic curves and side-channel attacks. PKC 2002, Springer.","DOI":"10.1007\/3-540-45664-3_24"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Izu, T., and Takagi, T. (2002). A fast parallel elliptic curve multiplication resistant against side channel attacks. PKC 2002, Springer.","DOI":"10.1007\/3-540-45664-3_20"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Biehl, I., Meyer, B., and M\u00fcller, V. (2000). Differential fault attacks on elliptic curve cryptosystems. CRYPTO 2000: Advances in Cryptology, Springer.","DOI":"10.1007\/3-540-44598-6_8"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Proos, J., and Zalka, C. (2003). Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. arXiv.","DOI":"10.26421\/QIC3.4-3"},{"key":"ref_54","unstructured":"Hhan, M., Yamakawa, T., and Yun, A. (2024, December 25). Quantum Complexity for Discrete Logarithms and Related Problems, Cryptology ePrint Archive, Paper 2023\/1054. Available online: https:\/\/eprint.iacr.org\/2023\/1054."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1186\/s42400-023-00181-w","article-title":"Minimizing CNOT-count in quantum circuit of the extended Shor\u2019s algorithm for ECDLP","volume":"6","author":"Liu","year":"2023","journal-title":"Cybersecurity"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1090\/pspum\/020\/0316385","article-title":"Class Number, A Theory of Factorization, and Genera","volume":"20","author":"Shanks","year":"1971","journal-title":"Am. Math. Soc. Proc. Symp. Pure Math."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/18.259647","article-title":"Reducing elliptic curve logarithms to logarithms in a finite field","volume":"39","author":"Menezes","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1090\/S0025-5718-98-00887-4","article-title":"Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p","volume":"67","author":"Semaev","year":"1998","journal-title":"Math. Comput."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/s001459900052","article-title":"The discrete logarithm problem on elliptic curves of trace one","volume":"12","author":"Smart","year":"1999","journal-title":"J. Cryptol."},{"key":"ref_60","first-page":"81","article-title":"Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves","volume":"47","author":"Satoh","year":"1998","journal-title":"Comment. Math. Univ. Sancti Pauli"},{"key":"ref_61","first-page":"865","article-title":"A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves","volume":"62","author":"Frey","year":"1994","journal-title":"Math. Comp."},{"key":"ref_62","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_63","doi-asserted-by":"crossref","unstructured":"Ko\u00e7, \u00c7. (2014). The Past, Evolving Present, and Future of the Discrete Logarithm. Open Problems in Mathematics and Computational Science, Springer.","DOI":"10.1007\/978-3-319-10683-0"},{"key":"ref_64","unstructured":"Bernstein, D.J., and Lange, T. (2024, December 25). SafeCurves: Choosing Safe Curves for Elliptic-Curve Cryptography. Available online: https:\/\/safecurves.cr.yp.to."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Singh, P., Dutta, S., and Pranav, P. (2024). Optimizing GANs for Cryptography: The Role and Impact of Activation Functions in Neural Layers Assessing the Cryptographic Strength. Appl. Sci., 14.","DOI":"10.3390\/app14062379"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"1969","DOI":"10.11591\/ijece.v14i2.pp1969-1978","article-title":"System call frequency analysis based generative adversarial network model for zero day detection on mobile devices","volume":"14","author":"Chhaybi","year":"2024","journal-title":"Int. J. Electr. Comput. Eng. (IJECE)"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s40031-018-0324-x","article-title":"Authentication and encryption using modified elliptic curve cryptography with particle swarm optimization and cuckoo search algorithm","volume":"99","author":"Kota","year":"2018","journal-title":"J. Inst. Eng. Ser. B"},{"key":"ref_68","unstructured":"Athanasopoulos, E., and Mennink, B. (2023). Privacy-Preserving Medical Data Generation Using Adversarial Learning. Information Security. ISC 2023, Springer."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10462-024-10719-0","article-title":"A chaotic-based image encryption scheme using elliptic curve cryptography and genetic algorithm","volume":"57","author":"Kumar","year":"2024","journal-title":"Artif. Intell. Rev."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"3691","DOI":"10.1007\/s10207-024-00906-z","article-title":"An enhanced and verifiable lightweight authentication protocol for securing the Internet of Medical Things (IoMT) based on CP-ABE encryption","volume":"23","author":"Jebrane","year":"2024","journal-title":"Int. J. Inf. Secur."},{"key":"ref_71","doi-asserted-by":"crossref","unstructured":"Maimu\u0163, D., and Matei, A.C. (2022). Speeding-Up Elliptic Curve Cryptography Algorithms. Mathematics, 10.","DOI":"10.3390\/math10193676"},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Ribaric, T., and Houghten, S. (2017, January 5\u20138). Genetic programming for improved cryptanalysis of elliptic curve cryptosystems. Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), San Sebasti\u00e1n, Spain.","DOI":"10.1109\/CEC.2017.7969342"},{"key":"ref_73","first-page":"551","article-title":"Enhancing the security in RSA and elliptic curve cryptography based on addition chain using simplified Swarm Optimization and Particle Swarm Optimization for mobile devices","volume":"13","author":"Mullai","year":"2020","journal-title":"Int. J. Inf. Technol."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Selvi, S., Gobi, M., Kanchana, M., and Mary, S. (2017, January 18\u201319). Hyper elliptic curve cryptography in multi cloud-security using DNA (genetic) techniques. Proceedings of the 2017 International Conference on Communication and Multimedia Computing (ICCMC), Erode, India.","DOI":"10.1109\/ICCMC.2017.8282604"},{"key":"ref_75","unstructured":"Kashyap, U., Padhi, S.K., and Ali, S.S. (2024). Attack GAN (AGAN): A new Security Evaluation Tool for Perceptual Encryption. arXiv."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.cose.2018.07.018","article-title":"Marino Anthony James: Security analysis and new models on the intelligent symmetric key encryption","volume":"80","author":"Zhou","year":"2019","journal-title":"Comput. Secur."},{"key":"ref_77","unstructured":"Bernstein, D., Duif, N., Lange, T., Schwabe, P., and Yang, B. (2024, December 25). High-Speed High-Security Signatures, Cryptology ePrint Archive, Paper 2011\/368. Available online: https:\/\/eprint.iacr.org\/2011\/368."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0028457","article-title":"Minimizing the use of random oracles in authenticated encryption schemes","volume":"Volume 1334","author":"Bellare","year":"1997","journal-title":"Information and Communications Security"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/1\/3\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:56:50Z","timestamp":1760115410000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/1\/3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,30]]},"references-count":78,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["cryptography9010003"],"URL":"https:\/\/doi.org\/10.3390\/cryptography9010003","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,30]]}}}