A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields

This publication has 8 references indexed in Scilit:

• Use of Elliptic Curves in Cryptography
  Published by Springer Nature ,2000
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
  SIAM Journal on Computing, 1989
• Computing in the Jacobian of a hyperelliptic curve
  Mathematics of Computation, 1987
• Elliptic Curve Cryptosystems
  Mathematics of Computation, 1987
• Probabilistic Algorithms in Finite Fields
  SIAM Journal on Computing, 1980
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
  SIAM Journal on Computing, 1979
• Algebraic Geometry
  Published by Springer Nature ,1977
• Factoring polynomials over large finite fields
  Mathematics of Computation, 1970