Discrete logarithm problem over hyperelliptic curves : Computational complexity and cryptographic implications
Bijaya Kumar Sethibijayakumar1540@vardhaman.orgDepartment of Computer Science and Engineering (Data Science)Vardhaman College of EngineeringShamshabad, Hyderabad, Telangana, 501218, IndiaView full profile → , Debanjana Prasaddebanjana.prasad@niu.edu.inDepartment of BiotechnologyNoida International UniversityGreater Noida, Uttar Pradesh, 203201, IndiaView full profile → , Vivek Saraswatvivek.saraswat.orp@chitkara.edu.inCentre for Research Impact & OutcomeChitkara University Institute of Engineering and TechnologyChitkara UniversityRajpura, Punjab, 140401, IndiaView full profile → , Udita Goyaludita@quantumeducation.inQuantum University Research CenterQuantum UniversityRoorkee, Uttarakhand, 247667, IndiaView full profile → , Kasturi Rohinikasturirohini2024@protonmail.comCentre for Multidisciplinary ResearchAnurag UniversityHyderabad, Telangana, 500088, IndiaView full profile → , Kartikkumar A. Patelhod.cvl.hcet@gokuluniversity.ac.inFaculty of EngineeringGokul Global UniversitySidhpur, Gujarat, 384151, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2026
- Published Online:
- 31 Oct 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-3081
- Pages:
- 4659–4669
Abstract
HECC is a cryptography approach that builds upon classical discrete logarithm schemes, using Jacobians as its underlying group, and provides greater security per unit of key size but with different tradeoffs. This paper defines the discrete logarithm problem (DLP) in hyperelliptic Jacobians, examines computational complexity and compares it with the elliptic curve DLP over generic and index-calculus models. Foundations in mathematics such as finite fields, divisor class groups and Mumford representations are explored in order to define group operations and hardness assumptions. We consider sub-exponential index calculus attacks, which are Lq[1/2] in small genus, and this means that security margins are lower with elliptic curves. The findings show that recovery of keys up to 28.6% faster in genus-3 environments and 22.4% fewer successful security bits with the optimal parameters. The design implications are addressed with suggestions of increased genus constraints, field size, or hybrid post-quantum schemes to ensure the security guarantees remain strong all around the world.
Keywords
Subject Classifications
References
[1] G. Routis, P. Dagas, and I. Roussaki, “Enhancing privacy in the Internet of Vehicles via hyperelliptic curve cryptography,” Electronics, vol. 13, no. 4, Art. no. 730 (2024), doi: 10.3390/electronics13040730.
[2] S. S. Ullah, S. Hussain, M. Uddin, R. Alroobaea, J. Iqbal, A. M. Baqasah, M. Abdelhaq, and R. Alsaqour, “A computationally efficient online/offline signature scheme for underwater wireless sensor networks,” Sensors, vol. 22, no. 14, Art. no. 5150 (2022), doi: 10.3390/s22145150.
[3] S. L. Nita and M. I. Mihailescu, “Elliptic curve-based query authentication protocol for IoT devices aided by blockchain,” Sensors, vol. 23, no. 3, Art. no. 1371 (2023), doi: 10.3390/s23031371.
[4] J. Khan, C. Zhu, W. Ali, M. Asim, and S. Ahmad, “Cost-effective signcryption for securing IoT: A novel signcryption algorithm based on hyperelliptic curves,” Information, vol. 15, no. 5, Art. no. 282 (2024), doi: 10.3390/info15050282.
[5] L. Jyotsna and L. P. Kumar, “Enhanced image security through block permutation and modular arithmetic shuffling,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 3, pp. 1313–1333 (2026), doi: 10.47974/JDMSC-2617.
[6] M. A. Khan, I. Ullah, A. M. Abdullah, S. A. H. Mohsan, and F. Noor, “An efficient and conditional privacy-preserving heterogeneous signcryption scheme for the Internet of Drones,” Sensors, vol. 23, no. 3, Art. no. 1063 (2023), doi: 10.3390/s23031063.
[7] A. K. Singh, A. Solanki, A. Nayyar, and B. Qureshi, “Elliptic curve signcryption-based mutual authentication protocol for smart cards,” Appl. Sci., vol. 10, no. 22, Art. no. 8291 (2020), doi: 10.3390/app10228291.
[8] R. C. Poonia, R. Almakki, A. K. J. Saudagar, A. Altameem, and M. Albathan, “A detailed examination of LSTM networks for large-scale text generation with optimizing sequence models,” J. Inf. Optim. Sci., vol. 45, no. 5, pp. 1477–1486 (2024), doi: 10.47974/JIOS-1769.
[9] R. Ifrim and D. Popescu, “BPAP: FPGA design of a RISC-like processor for elliptic curve cryptography using task-level parallel programming in high-level synthesis,” Cryptography, vol. 9, no. 1, Art. no. 20 (2025), doi: 10.3390/cryptography9010020.
[10] B. Denge, B. Denge, Y. Channe, K. Chaudhari, and M. Naralkar, “Security and challenges in embedded systems protecting against cyber threats,” Int. J. Adv. Comput. Theory Eng., vol. 14, no. 1, pp. 236–239 (2025), doi: 10.65521/ijacte.v14i1.472.
[11] S. Szymoniak and S. Kesar, “Key agreement and authentication protocols in the Internet of Things: A survey,” Appl. Sci., vol. 13, no. 1, Art. no. 404 (2023), doi: 10.3390/app13010404.
