HP Labs Technical Reports
Click here for full text:
Experiments Using an Analogue of the Number Field Sieve Algorithm to Solve the Discrete Logarithm Problem in the Jacobians of Hyperelliptic Curves
Keyword(s): discrete logarithm; hyperelliptic curves; cryptography
Abstract: In this paper we report on an implementation of the algorithm of Aldeman, De Marrais and Huang for the solution of the discrete logarithm problem on Jacobians of hyperelliptic curves. The method of Aldeman, De Marrais and Huang is closely related to the Number Field Sieve factoring method which leads us to consider a "lattice sieve" version of the original method.
Back to Index