Discrete logarithm problem in hyperelliptic curve groups
*Shweta S. AladakattiCorresponding authorshweta.aladakatti@manipal.eduBengaluru0000-0002-7555-4353View full profile → , Vikram V. Patelvikrampatel@gokuluniversity.ac.inFaculty of EngineeringGokul Global UniversitySidhpur, Gujarat, 384151, India0009-0006-4834-6766View full profile → , Rahul Rajendra Papalkarrahul.papalkar@vupune.ac.inDepartment of Computer EngineeringVishwakarma UniversityPune, Maharashtra, 411048, IndiaView full profile → , Harshada Bhushan Magarharshada.magar@aissmsioit.orgDepartment of Electronics & TelecommunicationAISSMS Institute of Information TechnologyKennedy Road, Shivaji Nagar, Pune, Maharashtra, 411001, IndiaView full profile → , Veerendra Yadavveerendra.yadav@niu.edu.inDepartment of Computer Science & EngineeringNoida International UniversityNoida, Uttar Pradesh, 203201, IndiaView full profile → , Syed FarhanSyedFarhan2024@yahoo.comCentre for Multidisciplinary ResearchAnurag UniversityHyderabad, Telangana, 500088, 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-3049
- Pages:
- 4261–4272
Abstract
The Discrete Logarithm Problem in Hyperelliptic Curve Groups (HECDLP) is a fundamental basis to more advanced cryptographic systems, and is more secure per key size than classical techniques using elliptic curves. This paper discusses the computational complexity and security consequences of HECDLP by considering the mathematical structure of it on finite field and divisor class groups. The aim is the evaluation of efficient algorithms, such as index calculus and rho versions of Pollard, and the proposal of a hybrid cryptographic model, taking advantage of the properties of hyperelliptic curves. The algorithm combines algebraic geometry, group theory and algorithmic optimization approaches to measure performance using security and efficiency measures. The preliminary performance comparison reports a security-strength score of 92.6% and a computation time of 118 ms for the proposed HECC framework. The reported computation time is 24.36% lower than that of the ECC-based method and 58.45% lower than that of the classical DLP method. These findings require validation through a reproducible experimental protocol and a formally defined security evaluation metric. The suggested model improves the immunity of classical and quantum-inspired attacks, making HECC an effective and scalable cryptography alternative with high security levels to be used in the next-generation applications.
Keywords
Subject Classifications
References
[1] A. Meneghetti, M. Sala, and D. Taufer, “A new ECDLP-based PoW model,” Mathematics, vol. 8, no. 8, Art. no. 1344 (2020), doi: 10.3390/math8081344.
[2] D. Shaltykova, Y. Vitulyova, K. Kadyrzhan, and I. Suleimenov, “Application of partial discrete logarithms for discrete logarithm computation,” Computers, vol. 14, no. 9, Art. no. 343 (2025), doi: 10.3390/computers14090343.
[3] Z. Jamroz, I. Ullah, B. Hassan, N. U. Amin, M. A. Khan, P. Lorenz, and N. Innab, “An optimal authentication scheme through dual signature for the Internet of Medical Things,” Future Internet, vol. 15, no. 8, Art. no. 258 (2023), doi: 10.3390/fi15080258.
[4] A. Iqbal, M. Zubair, M. A. Khan, I. Ullah, G. Ur-Rehman, A. V. Shvetsov, and F. Noor, “An efficient and secure certificateless aggregate signature scheme for vehicular ad hoc networks,” Future Internet, vol. 15, no. 8, Art. no. 266 (2023), doi: 10.3390/fi15080266.
[5] I. Ullah, M. A. Khan, A. M. Abdullah, F. Noor, N. Innab, and C.-M. Chen, “Enabling secure communication in wireless body area networks with heterogeneous authentication scheme,” Sensors, vol. 23, no. 3, Art. no. 1121 (2023), doi: 10.3390/s23031121.
[6] I. Ullah, M. A. Khan, A. Alkhalifah, R. Nordin, M. H. Alsharif, A. H. Alghtani, and A. A. Aly, “A multi-message multi-receiver signcryption scheme with edge computing for secure and reliable wireless Internet of Medical Things communications,” Sustainability, vol. 13, no. 23, Art. no. 13184 (2021), doi: 10.3390/su132313184.
[7] 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.
[8] R. C. Poonia, R. Almakki, A. K. J. Saudagar, A. Altameem, and M. Albathan, “An optimization approach for real-time object detection in IoT devices through edge computing and deep learning,” Journal of Information and Optimization Sciences, vol. 45, no. 5, pp. 1465–1475 (2024), doi: 10.47974/JIOS-1768.
[9] A. D. l. Piedra, A. Braeken, and A. Touhafi, “Extending the IEEE 802.15.4 security suite with a compact implementation of the NIST P-192/B-163 elliptic curves,” Sensors, vol. 13, no. 8, pp. 9704–9728 (2013), doi: 10.3390/s130809704.
[10] Z. Xu, F. Li, H. Deng, M. Tan, J. Zhang, and J. Xu, “A blockchain-based authentication and dynamic group key agreement protocol,” Sensors, vol. 20, no. 17, Art. no. 4835 (2020), doi: 10.3390/s20174835.
[11] Ł. Chmielewski, P. M. C. Massolino, J. Vliegen, L. Batina, and N. Mentens, “Completing the complete ECC formulae with countermeasures,” Journal of Low Power Electronics and Applications, vol. 7, no. 1, Art. no. 3 (2017), doi: 10.3390/jlpea7010003.
