Explicit Methods for Solving the Discrete Logarithm Problem on Algebraic Curves

Read full text Summarise with VIRAT
Authors: Wilke Idäus Trei
Cited by: 0
References: 40

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This dissertation presents a comprehensive analysis of discrete logarithm problems (DLPs) on algebraic curves with at least a single fully ramified point. While elliptic curves - a subset of these curves - typically only allow generic solvers, these more general curves provide additional structure that can be leveraged for novel solution approaches. This work introduces a unified framework for solving these DLPs. The focus lies on new algorithms based on the index calculus principle and an improved sieving method. These demonstrably require fewer arithmetic operations than previously known methods. Furthermore, the smoothness probability of ideals, crucial for the overall complexity, is analyzed in detail and extended to previously unstudied parameterizations. Finally, two optimized implementations prove the high efficiency: The new algorithms enable the solution of previously intractable DLPs using today's resources.

Fields of Study & Subjects

Cryptography and Residue Arithmetic Algebraic Geometry and Number Theory Polynomial and algebraic computation

Publication details

Journal / source
Carl von Ossiezky University of Oldenburg
Publication date
20 March 2026
Language
EN
Document type
Thesis