An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
- 12 May 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Speeding up the Discrete Log Computation on Curves with AutomorphismsPublished by Springer Nature ,1999
- Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystemsBulletin of the Australian Mathematical Society, 1998
- Counting Points on Curves over Finite FieldsJournal of Symbolic Computation, 1998
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of CurvesMathematics of Computation, 1994
- A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fieldsPublished by Springer Nature ,1994
- A Family of Jacobians Suitable for Discrete Log CryptosystemsPublished by Springer Nature ,1990
- Hyperelliptic cryptosystemsJournal of Cryptology, 1989
- A Rigorous Subexponential Algorithm For Computation of Class GroupsJournal of the American Mathematical Society, 1989
- Elliptic Curve CryptosystemsMathematics of Computation, 1987
- Computing in the Jacobian of a Hyperelliptic CurveMathematics of Computation, 1987