{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:48:33Z","timestamp":1753890513216,"version":"3.41.2"},"reference-count":31,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:00:00Z","timestamp":1720051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Comput. Sci."],"abstract":"<jats:p>Various applications use asymmetric cryptography to secure communications between both parties, and it raises the main issue of generating vast amounts of computation and storage. Thus, elliptic curve cryptography (ECC) is a methodology that emerged to overcome this issue using its low computation and generation of small keys with its strong encryption strategy. ECC is becoming mandatory and used mostly for public key encryption protocols. ECC has expanded cumulative acceptance in practice due to the reduced bit magnitude of operands compared to RSA for safety level. Previously, protocols designed for ECC suggested calculation of scalar development and it was accomplished in finite fields as projective, affine, and Jacobian simulations of coordinates. Arithmetic operations in a limited area establish the core benefits of the ECC algorithm. Even though ECC generated an issue of complex key generation using its curve formation, to overcome this issue a hyperelliptic curve cryptosystems (HECC) is proposed in this study. HECC perform ECC in the Public Key Cryptography (PKC) domain. This study presented an optimization-based key generation and made a random selection of integers for encrypting the message. Selecting a prime number as the private key and multiplying it to the encrypted message to generate a public key is done. This encrypted message is mapped to the curve to check whether it satisfies the curve equation or not. Once an encrypted message is obtained, it is then sent to a second party for pursuing the message. On the side of the second party, a reverse process called decryption takes place. Thus, a secured transmission of data communication takes place. Implementing this algorithm in MATLAB resulted in 94% accuracy and an error of 6%, which was a higher performance ratio than previous methods.<\/jats:p>","DOI":"10.3389\/fcomp.2024.1381850","type":"journal-article","created":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T04:55:51Z","timestamp":1720068951000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Mayfly optimistic hyperelliptic curve cryptosystem"],"prefix":"10.3389","volume":"6","author":[{"given":"Ramireddy","family":"Nava Teja Reddy","sequence":"first","affiliation":[]},{"given":"M.","family":"Kavitha","sequence":"additional","affiliation":[]},{"given":"G. Sudarsana","family":"Reddy","sequence":"additional","affiliation":[]},{"given":"Amr","family":"Yousef","sequence":"additional","affiliation":[]},{"given":"Kareem M.","family":"AboRas","sequence":"additional","affiliation":[]},{"given":"Ahmed","family":"Emara","sequence":"additional","affiliation":[]},{"given":"Ch. Rami","family":"Reddy","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2024,7,4]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"175865","DOI":"10.1109\/ACCESS.2019.2957943","article-title":"SE-ENC: a secure and efficient encoding scheme using elliptic curve cryptography","volume":"7","author":"Almajed","year":"2019","journal-title":"IEEE Access"},{"key":"B2","first-page":"338","article-title":"\u201cHandling tactful data in cloud using Pkg Encryption Technique,\u201d","volume-title":"4th Smart City Symposium","author":"Bhageerath Chakravorthy","year":"2021"},{"key":"B3","doi-asserted-by":"publisher","first-page":"101105","DOI":"10.1016\/j.pmcj.2019.101105","article-title":"Energy-aware dynamic Internet of Things security system based on Elliptic Curve Cryptography and Message Queue Telemetry Transport protocol for mitigating Replay attacks","volume":"61","author":"De Rango","year":"2020","journal-title":"Perv. Mob. Comput"},{"key":"B4","doi-asserted-by":"publisher","first-page":"27336","DOI":"10.1109\/ACCESS.2018.2836350","article-title":"A novel efficient pairing-free CP-ABE based on elliptic curve cryptography for IoT","volume":"6","author":"Ding","year":"2018","journal-title":"IEEE Access"},{"key":"B5","doi-asserted-by":"publisher","first-page":"20843","DOI":"10.1038\/s41598-023-46746-0","article-title":"Sliding principal component and dynamic reward reinforcement learning based IIoT attack detection","volume":"13","author":"Ellappan","year":"2023","journal-title":"Sci. Rep."},{"key":"B6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s13389-014-0090-x","article-title":"Fast prime field elliptic-curve cryptography with 256-bit primes","volume":"5","author":"Gueron","year":"2015","journal-title":"J. Cryptogr. Eng"},{"key":"B7","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/JIOT.2014.2360121","article-title":"An analysis of RFID authentication schemes for internet of things in healthcare environment using elliptic curve cryptography","volume":"2","author":"He","year":"2014","journal-title":"IEEE Internet Things J"},{"key":"B8","doi-asserted-by":"publisher","first-page":"194289","DOI":"10.1109\/ACCESS.2020.3032403","article-title":"Efficient image encryption scheme using henon map, dynamic S-boxes and elliptic curve cryptography","volume":"8","author":"Ibrahim","year":"2020","journal-title":"IEEE Access"},{"key":"B9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1386853.1378356","article-title":"Elliptic curve cryptography","volume":"2008","author":"Kapoor","year":"2008","journal-title":"Ubiquity"},{"key":"B10","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1016\/j.jksuci.2019.04.013","article-title":"An elliptic curve cryptography based mutual authentication scheme for smart grid communications using biometric approach","volume":"34","author":"Khan","year":"2019","journal-title":"J. King Saud Univ. Comput. Inform. Sci"},{"key":"B11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tele.2018.09.001","article-title":"A secure elliptic curve cryptography based mutual authentication protocol for cloud-assisted TMIS","volume":"38","author":"Kumar","year":"2019","journal-title":"Telemat. Informat"},{"key":"B12","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.3390\/s21062245","article-title":"Bearing fault diagnosis based on energy spectrum statistics and modified mayfly optimization algorithm","volume":"21","author":"Liu","year":"2021","journal-title":"Sensors"},{"key":"B13","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1109\/TIFS.2015.2491261","article-title":"Efficient implementation of NIST-compliant elliptic curve cryptography for 8-bit AVR-based sensor nodes","volume":"11","author":"Liu","year":"2015","journal-title":"IEEE Trans. Inform. For. Secur"},{"key":"B14","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.future.2017.05.002","article-title":"An elliptic curve cryptography based lightweight authentication scheme for smart grid communication","volume":"81","author":"Mahmood","year":"2018","journal-title":"Fut. Gener. Comput. Syst"},{"key":"B15","first-page":"9053","article-title":"RSA and ECC: a comparative analysis","volume":"12","author":"Mahto","year":"2017","journal-title":"Int. J. Appl. Eng. Res"},{"key":"B16","first-page":"542","article-title":"Secured broadband data access system in WiMAX","volume":"3","author":"Mani","year":"2013","journal-title":"Int. J. Manag. IT Eng."},{"key":"B17","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1109\/TC.2020.3013266","article-title":"Elliptic curve cryptography point multiplication core for hardware security module","volume":"69","author":"Mehrabi","year":"2020","journal-title":"IEEE Trans. Comput"},{"key":"B18","first-page":"185","article-title":"\u201cHigh-performance elliptic curve cryptography by using the CIOS method for modular multiplication,\u201d","volume-title":"International Conference on Risks and Security of Internet and Systems","author":"Mrabet","year":"2016"},{"key":"B19","doi-asserted-by":"publisher","first-page":"e3763","DOI":"10.1002\/dac.3763","article-title":"Provable secure lightweight hyper elliptic curve-based communication system for wireless sensor networks","volume":"31","author":"Naresh","year":"2018","journal-title":"Int. J. Commun. Syst."},{"key":"B20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TIFS.2016.2603974","article-title":"An efficient elliptic curve cryptography signature server with GPU acceleration","volume":"12","author":"Pan","year":"2016","journal-title":"IEEE Trans. Inform. For. Secur"},{"key":"B21","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1038\/s41598-024-51154-z","article-title":"A novel IoT intrusion detection framework using Decisive Red Fox optimization and descriptive back propagated radial basis function models","volume":"14","author":"Rabie","year":"2024","journal-title":"Sci. Rep."},{"key":"B22","doi-asserted-by":"publisher","first-page":"102599","DOI":"10.1016\/j.jisa.2020.102599","article-title":"Tree and elliptic curve based efficient and secure group key agreement protocol","volume":"55","author":"Rawat","year":"2020","journal-title":"J. Inform. Secur. Appl"},{"key":"B23","first-page":"1","article-title":"An implementation of elliptic curve cryptography","volume":"2","author":"Sahoo","year":"2013","journal-title":"Int. J. Eng. Res. Technol"},{"key":"B24","doi-asserted-by":"publisher","first-page":"15681","DOI":"10.1038\/s41598-023-42257-0","article-title":"A conjugate self-organizing migration (CSOM) and reconciliate multi-agent Markov learning (RMML) based cyborg intelligence mechanism for smart city security","volume":"13","author":"Shitharth","year":"","journal-title":"Sci. Rep."},{"key":"B25","doi-asserted-by":"publisher","first-page":"100406","DOI":"10.1016\/j.eij.2023.100406","article-title":"Federated learning optimization: a computational blockchain process with offloading analysis to enhance security","volume":"24","author":"Shitharth","year":"","journal-title":"Egypt. Informat. J"},{"key":"B26","doi-asserted-by":"publisher","first-page":"2154","DOI":"10.1109\/JSYST.2019.2944240","article-title":"An efficient elliptic curve cryptography-based without pairing KPABE for Internet of Things","volume":"14","author":"Sowjanya","year":"2019","journal-title":"IEEE Syst. J"},{"key":"B27","doi-asserted-by":"publisher","first-page":"4947","DOI":"10.1038\/s41598-024-55044-2","article-title":"Dickson polynomial-based secure group authentication scheme for Internet of Things","volume":"14","author":"Syed","year":"2024","journal-title":"Sci. Rep."},{"key":"B28","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.sigpro.2017.04.006","article-title":"Color image encryption based on chaotic systems and elliptic curve ElGamal scheme","volume":"141","author":"Wu","year":"2017","journal-title":"Sign. Process"},{"key":"B29","doi-asserted-by":"publisher","first-page":"106559","DOI":"10.1016\/j.cie.2020.106559","article-title":"A mayfly optimization algorithm","volume":"145","author":"Zervoudakis","year":"2020","journal-title":"Comput. Industr. Eng"},{"key":"B30","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ins.2020.03.069","article-title":"ECC2: error correcting code and elliptic curve based cryptosystem","volume":"526","author":"Zhang","year":"2020","journal-title":"Inform. Sci"},{"key":"B31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-981-10-7590-2_1","article-title":"\u201cIdentity-based combined public key schemes for signature, encryption, and signcryption,\u201d","volume-title":"Information Technology and Applied Mathematics","author":"Zhou","year":"2019"}],"container-title":["Frontiers in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2024.1381850\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T04:56:03Z","timestamp":1720068963000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2024.1381850\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,4]]},"references-count":31,"alternative-id":["10.3389\/fcomp.2024.1381850"],"URL":"https:\/\/doi.org\/10.3389\/fcomp.2024.1381850","relation":{},"ISSN":["2624-9898"],"issn-type":[{"type":"electronic","value":"2624-9898"}],"subject":[],"published":{"date-parts":[[2024,7,4]]},"article-number":"1381850"}}