The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems

Designs, Codes, and Cryptography

Volumn 23, Issue 1, 2001, Pages 53-74

  Enge, Andreas ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Average complexity; Euclidian algorithm; Hyperelliptic cryptosystems

Indexed keywords

EID: 0035341693     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011215802656     Document Type: Article

References (32)

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. In: [2] (1994) pp. 28-40.
2. L. M. Adleman and M.-D. Huang (eds.), Algorithmic Number Theory, volume 877 of Lecture Notes in Computer Science, Springer-Verlag, Berlin (1994).
3. E. Artin, Quadratische Körper im Gebiete der höheren Kongruenzen I, Mathematische Zeitschrift, Vol. 19 (1924) pp. 153-206.
4. E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill Series in Systems Science, McGraw-Hill, New York (1968).
5. J. P. Buhler, (ed.). Algorithmic Number Theory - ANTS-III, volume 1422 of Lecture Notes in Computer Science, Springer-Verlag, Berlin (1988).
6. D. G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation, Vol. 48, No. 177 (1987) pp. 95-101.
7. De la Grange, Recherches d'arithmétique, Nouveaux Mémoires de l'Académie Royale des Sciences et Belles-Lettres, (1873) pp. 265-312.
8. A. Enge, Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Mathematics of Computation (to appear).
9. A. Enge, Elliptic Curves and Their Applications to Cryptography - An Introduction, Kluwer Academic Publishers (1999).
10. A. Enge and A. Stein, On the Number of Smooth Divisors in Hyperelliptic Function Fields. Mathematics of Computation (to appear).
11. G. Frey and H.-G. Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves, Mathematics of Computation, Vol. 62, No. 206 (1994) pp. 865-874.
12. C. F. Gauß, Disquisitiones Arithmeticae, Leipzig, Gerh. Fleischer Jun. (1801)
13. A. Knopfmacher and J. Knopfmacher, The exact length of the Euclidian algorithm, Mathematika Vol. 35 (1988) pp. 297-304.
14. D. E. Knuth, The Art of Computer Programming, Seminumerical Algorithms, Addison-Wesley, Reading, MA, 2nd edition (1981).
15. N. Koblitz, Hyperelliptic cryptosystems, Journal of Cryptology, Vol. 1 (1989) pp. 139-150.
16. N. Koblitz, Algebraic aspects of cryptography, Algorithms and Computations in Mathematics, Vol. 3, Springer-Verlag, Berlin (1988).
17. U. Krieger, Signature.c - Anwendung hyperelliptischer Kurven in der Kryptographie, Master's thesis, Universität Essen, Deutschland (1997).
18. D. Lewis, (ed.) Proceedings of Symposia in Pure Mathematics, Vol. 10, Providence (Rhode Island), American Mathematical Society (1971).
19. K. Ma, Analysis of Polynomial GCD Computations over Finite Fields, Master's thesis, University of Toronto, Toronto (1987).
20. K. Ma and J. Gathen, Analysis of Euclidian algorithms for polynomials over finite fields. Journal of Symbolic Computation, Vol. 9 (1990) pp. 429-455.
21. K. S. McCurley, The discrete logarithm problem. In: [26] (1990) pp. 49-74.
22. A. J. Menezes, T. Okamoto, and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory, Vol. 39, No. 5 (1993) pp. 1639-1646.
23. A. J. Menezes, Y.-H. Wu, and R. J. Zuccherato, An elementary introduction to hyperelliptic curves. In: [16]. Springer-Verlag (1998), pp. 155-178.
24. V. Müller, A. Stein, and C. Thiel, Computing discrete logarithms in real quadratic congruence function fields of large genus, Mathematics of Computation, Vol. 98 No. 226 (1999) pp. 807-822.
25. S. Paulus, and A. Stein, Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves. In: [5] (1998) pp. 576-591.
26. C. Pomerance, (ed.), Cryptology and computational number theory. In Proceedings of Symposia in Applied Mathematics, volume 42 Providence, Rhode Island, American Mathematical Society (1990).
27. T. Satoh and K. Araki, Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves, Commentarii Mathematici Universitatis Sancti Pauli, Vol. 47, No. 1 (1998) pp. 81-92.
28. I. A. Semaev, Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p, Mathematics of Computation, Vol. 67 No. 221 (1998) pp. 353-356.
29. D. Shanks, Class number, a theory of factorization and genera. In: [18] (1971) pp. 415-440.
30. J. H. Silverman, The arithmetic of elliptic curves, Graduate Texts in Mathematics. Springer-Verlag, New York (1986).
31. N. P. Smart, The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptology, Vol. 12 No. 3 (1999) pp. 193-196.
32. A.-M. Spallek, Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen, Ph.D. thesis, Universität Gesamthochschule Essen (1994).