Efficient Algorithms for Isogeny Computation on Hyperelliptic Curves: Their Applications in Post-Quantum Cryptography

arXiv:2504.04559 · math.NT · Submitted 2025-04-06 · Read on arXiv

math.NT

Submitted: 2025-04-06

Updated: 2026-10-27

Comments: arXiv admin note: This submission has been withdrawn because it does not meet arXiv's research content quality standards

License: http://creativecommons.org/licenses/by/4.0/

The gist: We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context.

Terminology

Abstract

We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny computations from O(g4) to O(g3) operations for genus 2 curves, achieving significant ciency gains over traditional elliptic curve methods. Detailed pseudocode and comprehensive complexity analyses demonstrate these improvements both theoretically and empirically. Additionally, we provide a thorough security analysis, including proofs of resistance to quantum attacks such as Shor's and Grover's algorithms. Our findings establish hyperelliptic isogeny-based cryptography as a promising candidate for secure and e cient post-quantum cryptographic systems.

Related papers