Supersingular Curves in Cryptography

This publication has 24 references indexed in Scilit:

• Identity-Based Encryption from the Weil Pairing
  Published by Springer Nature ,2001
• The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems
  Designs, Codes and Cryptography, 2001
• An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
  Published by Springer Nature ,2000
• A One Round Protocol for Tripartite Diffie–Hellman
  Published by Springer Nature ,2000
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
  IEEE Transactions on Information Theory, 1999
• Speeding up the Discrete Log Computation on Curves with Automorphisms
  Published by Springer Nature ,1999
• Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems
  Bulletin of the Australian Mathematical Society, 1998
• The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm
  Journal of Cryptology, 1998
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
  Mathematics of Computation, 1994
• Computing in the Jacobian of a Hyperelliptic Curve
  Mathematics of Computation, 1987