Gaudry's variant against cab curves

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 9, 2000, Pages 1809-1814

  Arita, Seigo ^a  

^a NEC CORPORATION   (Japan)

Author keywords

Cat; Curve; Discrete logarithm; Hyperelliptic curve; Superelliptic curve

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; PROBLEM SOLVING;

DISCRETE LOGARITHM PROBLEMS (DLP); GAUDRY'S VARIANT;

COMPUTATIONAL GEOMETRY;

EID: 0034270001     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. L.M. Adleman, J. DeMarrais, and M.D. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, ANTS-I, LNCS 877, pp.28-40, Springer, 1994.
2. E. Arbarello, M. Cornalba, P.A. Griffiths, and J. Harris, Geometry of Algebraic Curves Volume I, Springer-Verlag, 1984.
3. S. Arita, Algorithms for computations in Jacobian group of Cai, curve and their application to discrete-log-based public key cryptosystems, Conf. on The Mathematics of Public Key Cryptography, Toronto, 1999.
4. D.G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Math. Comput., vol.48, no.177, pp.95-101, 1987.
5. G. Frey and H.-G. Rück, A remark concerning indivisibility and the discrete logarithm in the divisor class group of curves, Math. Comput., vol.62, no.206, pp.865-874, 1994.
6. S.D. Galbraith, S. Paulus, and N.P. Smart, Arithmetic on Superelliptic Curves, to appear in Math. Comput., 1999.
7. P. Gaudry, A variant of the Adleman-DeMarris-Huang algorithm and its application to small genera, Conf. on The Mathematics of Public Key Cryptography, Toronto, 1999.
8. N. Koblitz, A very easy way to generate curves over prime fields for hyperelliptic cryptosystems, Rump-session Crypto'97, 1997.
9. B.A. LaMacchia and A.M. Odlyzko, Solving large sparse linear systems over finite fields, Crypto'90, LNCS 537, pp. 109-133, Springer, 1990.
10. S. Miura, Linear codes on affine algebraic curves, IEICE Trans., vol.J81-A, no.10, pp.1398-1421, Oct. 1998.
11. PARI-GP, ftp://megrez.math.u-bordeaux.fr/pub/pari
12. J.M. Pollard, Monte Carlo methods for index computation mod p, Math. Comput., vol.32, no.143, pp.918-924, 1978.
13. H.-G. Rück, On the discrete logarithm in the divisor class group of curves, Math. Comput., vol.68, no.226, pp.805-806, 1999.
14. Y. Sakai and K. Sakurai, Design of hyperelliptic cryptosystems in small characteristic and a software implementation over F2, Asiacrypt'98, Advances in Cryptology, LNCS 1514, pp.80-94, Springer, 1998.
15. H. Stichtenoth, Algebraic Function Fields and Codes, Springer-Verlag, 1993.
16. A. Weil, Numbers of solutions of equations in finite fields, Bull. Amer. Math. Soc., vol.55, pp.497-508, 1949.
17. A. Weil, Jacobi sums as Grössencharaktere, Trans. Amer. Math. Soc., vol.73, pp.487-495, 1952.