Efficient Algorithms for the Jacobian Variety of Hyperelliptic Curves y2=xp-x+1 Over a Finite Field of Odd Characteristic p

This publication has 23 references indexed in Scilit:

• An improved algorithm for arithmetic on a family of elliptic curves
  Published by Springer Nature ,1997
• On computing logarithms on elliptic curves
  Discrete Mathematics and Applications, 1996
• Reducing elliptic curve logarithms to logarithms in a finite field
  IEEE Transactions on Information Theory, 1993
• On computing factors of cyclotomic polynomials
  Mathematics of Computation, 1993
• Frobenius maps of abelian varieties and finding roots of unity in finite fields
  Mathematics of Computation, 1990
• Elliptic curve cryptosystems
  Mathematics of Computation, 1987
• A public key cryptosystem and a signature scheme based on discrete logarithms
  IEEE Transactions on Information Theory, 1985
• A method for obtaining digital signatures and public-key cryptosystems
  Communications of the ACM, 1978
• An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
  IEEE Transactions on Information Theory, 1978
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976