M. Leonard, J. Adleman, and . Demarrais, A subexponential algorithm for discrete logarithms over all finite fields, Mathematics of Computation, issue.203, pp.611-626, 1993.

M. Leonard, J. Adleman, M. Demarrais, and . Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, pp.28-40, 1994.

]. E. Art24a and . Artin, Quadratische Körper im Gebiete der höheren Kongruenzen I, Mathematische Zeitschrift, vol.19, pp.153-206, 1924.

]. E. Art24b and . Artin, Quadratische Körper im Gebiete der höheren Kongruenzen II, Mathematische Zeitschrift, vol.19, pp.207-246, 1924.

E. Artin, Algebraic Numbers and Algebraic Functions. Notes on Mathematics and its Applications, 1967.

E. Artin and O. Schreier, Eine Kennzeichnung der reell abgeschlossenen Körper Abhandlungen aus dem mathematischen Seminar der hamburgischen Universität, pp.225-231, 1927.

E. Bach, Explicit bounds for primality testing and related problems, Mathematics of Computation, vol.55, issue.191, pp.355-380, 1990.
DOI : 10.1090/S0025-5718-1990-1023756-8

E. R. Berlekamp, Algebraic Coding Theory. McGraw-Hill Series in Systems Science, 1968.

E. Bombieri, Counting points on curves over finite fields, pp.234-241, 1974.
DOI : 10.1007/BFb0057311

R. Bender and C. Pomerance, Rigorous discrete logarithm computations in finite fields via smooth polynomials, pp.221-232, 1998.

[. Buchmann, A subexponential algorithm for the determination of class groups and regulators of algebraic number fields, pp.27-41, 1990.

[. Buchmann and H. C. Williams, A key-exchange system based on imaginary quadratic fields, Journal of Cryptology, vol.6, issue.2, pp.107-118, 1988.
DOI : 10.1007/BF02351719

G. David and . Cantor, Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation, vol.48, issue.177, pp.95-101, 1987.

M. Car, Théorèmes de densité dans F q [x], Acta Arithmetica, vol.68, pp.145-165, 1987.

C. Chevalley, Introduction to the Theory of Algebraic Functions of one Variable, 1951.
DOI : 10.1090/surv/006

H. Cohen, A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, 1993.

[. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-655, 1976.
DOI : 10.1109/TIT.1976.1055638

[. Düllmann, Ein Algorithmus zur Bestimmung der Klassengruppe positiv definiter binärer quadratischer Formen, 1991.

H. [. Dedekind and . Weber, Theorie der algebraischen Functionen einer Veränderlichen, Journal für die reine und angewandte Mathematik, pp.181-290

M. Eichler, Einführung in die Theorie der algebraischen Zahlen und Funktionen, Mathematische Reihen. Birkhäuser-Verlag, vol.27, 1963.

W. Eberly and E. Kaltofen, On randomized Lanczos algorithms, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.176-183, 1997.
DOI : 10.1145/258726.258776

T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, vol.31, issue.4, pp.469-472, 1985.
DOI : 10.1109/TIT.1985.1057074

A. Enge, Elliptic Curves and Their Applications to Cryptography ? An Introduction, 1999.

R. Flassenberg and S. Paulus, Sieving in Function Fields, Experimental Mathematics, vol.48, issue.178, pp.339-349, 1999.
DOI : 10.1080/10586458.1999.10504623

G. Frey and H. Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves, Mathematics of Computation, vol.62, issue.206, pp.865-874, 1994.

W. Fulton, Algebraic Curves Mathematics Lecture Note Series, 1969.

[. Gauß, Disquisitiones Arithmeticae. Gerh, 1801.

[. Gaudry, An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves, Pre00], pp.19-34, 2000.
DOI : 10.1007/3-540-45539-6_2
URL : https://hal.archives-ouvertes.fr/inria-00512401

J. Joachim-von-zur-gathen and . Gerhard, Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

G. De-la, Recherches d'arithmétique. Nouveaux Mémoires de l'Académie Royale des Sciences et Belles-Lettres, pp.265-312, 1773.

[. Jr, The Theory of Groups, 1976.

R. Harley, Advanced algorithms for algebra and number theory. PhD thesis in preparation, title susceptible to change, 2001.

H. Hasse, Beweis des Analogons der Riemannschen Vermutung für die Artinschen und F. K. Schmidtschen Kongruenzzetafunktionen in gewissen elliptischen Fällen, pp.253-262, 1933.

H. Hasse, Abstrakte Begründung der komplexen Multiplikation und Riemannsche Vermutung in Funktionenkörpern Abhandlungen aus dem mathematischen Seminar der hamburgischen Universität, pp.325-348, 1934.

H. Hasse, Theorie der relativ-zyklischen algebraischen Funktionenkörper , insbesondere bei endlichem Konstantenkörper, Journal für die reine und angewandte Mathematik, pp.37-54, 1935.

[. Hensley, The number of positive integers ???x and free of prime factors >y, Journal of Number Theory, vol.21, issue.3, pp.286-298, 1985.
DOI : 10.1016/0022-314X(85)90057-5

F. Heß, Zur Divisorenklassengruppenberechnung in globalen Funktionenkörpern, 1999.

[. Huang and D. Ierardi, Counting Points on Curves over Finite Fields, Journal of Symbolic Computation, vol.25, issue.1, pp.1-21, 1998.
DOI : 10.1006/jsco.1997.0164

A. Hildebrand, On the number of positive integers ??? x and free of prime factors > y, Journal of Number Theory, vol.22, issue.3, pp.289-307, 1986.
DOI : 10.1016/0022-314X(86)90013-2

L. James, K. S. Hafner, and . Mccurley, A rigorous subexponential algorithm for computation of class groups, Journal of the American Mathematical Society, vol.2, issue.4, pp.837-850, 1989.

L. James, K. S. Hafner, and . Mccurley, Asymptotically fast triangularization of matrices over rings, SIAM Journal on Computing, vol.20, issue.6, pp.1068-1083, 1991.

A. Hildebrand and G. Tenenbaum, On integers free of large prime factors. Transactions of the, pp.265-290, 1986.

K. Indlekofer, E. Manstavicius, and R. Warlimont, On a certain class of infinite products with an application to arithmetical semigroups, Archiv der Mathematik, vol.106, issue.5, pp.446-453, 1991.
DOI : 10.1007/BF01200088

J. Michael and . Jacobson-jr, Computing discrete logarithms in quadratic orders, Journal of Cryptology, vol.13, pp.473-492, 2000.

[. Jungnickel, Finite Fields ? Structure and Arithmetics, BI Wissenschaftsverlag, 1993.

A. Knopfmacher and J. Knopfmacher, The exact length of the Euclidean algorithm in [ X], Mathematika, vol.22, issue.02, pp.297-304, 1988.
DOI : 10.2307/2371075

J. Knopfmacher, Abstract Analytic Number Theory, 1975.

J. Knopfmacher, Analytic Arithmetic of Algebraic Function Fields, volume 50 of Lecture notes in pure and applied mathematics, 1979.

D. Ervin and K. , The Art of Computer Programming, volume 2 -Seminumerical Algorithms, 1981.

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

N. Koblitz, Hyperelliptic cryptosystems, Journal of Cryptology, vol.2, issue.4, pp.139-150, 1989.
DOI : 10.1007/BF02252872

N. Koblitz, Algebraic Aspects of Cryptography, Algorithms and Computations in Mathematics, vol.3, 1998.
DOI : 10.1007/978-3-662-03642-6

U. Krieger, E. Kaltofen, and B. Saunders, c ? Anwendung hyperelliptischer Kurven in der Kryptographie Master's thesis On Wiedemann's method of solving sparse linear systems, pp.29-38, 1991.

]. A. Len88 and . Lenstra, Fast and rigorous factorization under the generalized Riemann hypothesis, Indagationes Mathematicae, vol.50, pp.443-454, 1988.

J. C. Lagarias, H. L. Montgomery, and A. M. Odlyzko, A bound for the least prime ideal in the Chebotarev Density Theorem, Inventiones Mathematicae, vol.95, issue.2, pp.271-296, 1979.
DOI : 10.1007/BF01390234

R. Lidl and H. Niederreiter, Finite Fields, volume 20 of Encyclopedia of Mathematics and Its Applications, 1997.

A. [. Lamacchia and . Odlyzko, Solving Large Sparse Linear Systems Over Finite Fields, [MV91], pp.109-133, 1991.
DOI : 10.1007/3-540-38424-3_8

C. [. Lenstra-jr, H. W. Pomerance, J. Lenstra-jr, C. Pila, and . Pomerance, A rigorous time bound for factoring integers, Journal of the American Mathematical Society, vol.5, issue.3, pp.483-516397, 1992.
DOI : 10.1090/S0894-0347-1992-1137100-0

K. Arjen, E. R. Lenstra, and . Verheul, Selecting cryptographic key sizes (extended abstract), pp.446-465, 2000.

K. Ma, Analysis of polynomial gcd computations over finite fields, 1987.

]. E. Man92a and . Manstavi?ius, Remarks on the semigroup elements free of large prime factors, Lithuanian Mathematical Journal, vol.32, issue.4, pp.400-409, 1992.

]. E. Man92b and . Manstavi?ius, Semigroup elements free of large prime factors, [SM92], pp.135-153, 1992.

K. S. Mccurley, Cryptographic key distribution and computation in class groups, Mol89], pp.459-479, 1989.

D. Mcnett, US government's encryption standard broken in less than a day. Formal Press Release, 1999.

K. Ma and J. Von-zur-gathen, Analysis of euclidean algorithms for polynomials over finite fields, Journal of Symbolic Computation, vol.9, issue.4, pp.429-455, 1990.
DOI : 10.1016/S0747-7171(08)80021-1

S. Victor and . Miller, Use of elliptic curves in cryptography, pp.417-426, 1986.

T. [. Mattson, T. R. Mora, and . Rao, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, vol.539, 1991.
DOI : 10.1007/3-540-54522-0

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, issue.5, pp.1639-1646, 1993.
DOI : 10.1109/18.259647

A. J. Menezes, P. C. Van-oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, 1997.
DOI : 10.1201/9781439821916

A. Volker-müller, C. Stein, and . Thiel, Computing discrete logarithms in real quadratic congruence function fields of large genus, Mathematics of Computation, vol.68, issue.226, pp.807-822, 1999.
DOI : 10.1090/S0025-5718-99-01040-6

S. Volker-müller, R. Vanstone, and . Zuccherato, Discrete logarithm based cryptosystems in quadratic function fields of characteristic 2. Designs, Codes and Cryptography, pp.159-178, 1998.

M. Ueli, S. Maurer, and . Wolf, The relationship between breaking the Diffie?Hellman protocol and computing discrete logarithms, SIAM Journal on Computing, vol.28, issue.5, pp.1689-1721, 1999.

A. J. Menezes, Y. Wu, and R. J. Zuccherato, An elementary introduction to hyperelliptic curves, pp.155-178, 1998.

]. V. Nec94 and . Nechaev, Complexity of a determinate algorithm for the discrete logarithm, Mathematical Notes, vol.55, issue.2, pp.165-172, 1994.

[. Nist, Announcing request for candidate algorithm nominations for the advanced encryption standard (AES) National Institute of Standards and Technology, 1997.

M. [. Van-oorschot and . Wiener, Parallel Collision Search with Cryptanalytic Applications, Journal of Cryptology, vol.12, issue.1, pp.1-28, 1999.
DOI : 10.1007/PL00003816

D. Panario, X. Gourdon, and P. Flajolet, An analytic approach to smooth polynomials over finite fields, pp.226-236, 1998.
DOI : 10.1007/BFb0054865
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.5198

C. Stephen, M. E. Pohlig, and . Hellman, An improved algorithm for computing logarithms over GF (p) and its cryptographic significance, IEEE Transactions on Information Theory, vol.24, issue.1, pp.106-110, 1978.

]. J. Pil90 and . Pila, Frobenius maps of Abelian varieties and finding roots of unity in finite fields, Mathematics of Computation, vol.55, issue.192, pp.745-763, 1990.

]. J. Pol74 and . Pollard, Theorems on factorization and primality testing, Proc. Camb, pp.521-528, 1974.

]. J. Pol78 and . Pollard, Monte Carlo methods for index computation (mod p) Mathematics of Computation, pp.918-924, 1978.

C. Pomerance, Fast, Rigorous Factorization and Discrete Logarithm Algorithms, pp.119-143, 1987.
DOI : 10.1016/B978-0-12-386870-1.50014-9

B. Poonen, Computational aspects of curves of genus at least 2, Coh96], pp.283-306, 1996.
DOI : 10.1007/3-540-61581-4_63

[. Paulus and H. Rück, Real and imaginary quadratic representations of hyperelliptic function fields, Mathematics of Computation, vol.68, issue.227, pp.1233-1241, 1999.
DOI : 10.1090/S0025-5718-99-01066-2

S. Paulus and A. Stein, Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves, pp.576-591, 1998.
DOI : 10.1007/BFb0054894

[. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves, Illinois Journal of Mathematics, vol.6, issue.482, pp.64-9481, 1962.

[. Schmidt, Analytische Zahlentheorie in K???rpern der Charakteristikp, Mathematische Zeitschrift, vol.33, issue.1, pp.1-32, 1931.
DOI : 10.1007/BF01174341

]. R. Sch82 and . Schoof, Quadratic fields and factorization, pp.235-286, 1982.

]. I. Sem95 and . Semaev, Computation of discrete logarithms in an arbitrary finite field, Discrete Mathematics and Applications, vol.5, issue.2, pp.107-116, 1995.

]. I. Sem98 and . Semaev, Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p, Mathematics of Computation, vol.67, issue.221, pp.353-356, 1998.

M. Seysen, A probabilistic factorization algorithm with quadratic forms of negative discriminant, Mathematics of Computation, vol.48, issue.178, pp.757-780, 1987.
DOI : 10.1090/S0025-5718-1987-0878705-X

]. D. Sha71 and . Shanks, Class number, a theory of factorization and genera, Lew71], pp.415-440, 1971.

[. Shoup, Lower Bounds for Discrete Logarithms and Related Problems, pp.256-266, 1997.
DOI : 10.1007/3-540-69053-0_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.3525

[. Siegel, ¨ Uber die Classenzahl quadratischer Zahlkörper, New Trends in Probability and Statistic, pp.83-86, 1936.
DOI : 10.1007/978-3-662-28697-5_21

N. P. Smart, The Discrete Logarithm Problem on Elliptic Curves of Trace One, Journal of Cryptology, vol.12, issue.3, pp.193-196, 1999.
DOI : 10.1007/s001459900052

A. Spallek, Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen, 1994.

A. [. Scheidler, H. C. Stein, and . Williams, Key-exchange in real quadratic congruence function fields. Designs, Codes and Cryptography, pp.153-174, 1996.

A. Stein, Algorithmen in reell-quadratischen Kongruenzfunktionenkörpern, 1996.

H. Stichtenoth, Algebraic Function Fields and Codes, 1993.

[. Strassen, Einige Resultatë uber Berechnungskomplexität, Jahresbericht der Deutschen Mathematiker-Vereinigung, vol.78, pp.1-8, 1976.

G. Tenenbaum, IntroductionàIntroductionà la théorie analytique et probabiliste des nombres, Institut Elie Cartan, 1990.

G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory , volume 46 of Cambridge studies in advanced mathematics, 1995.

E. Teske, On random walks for Pollard's rho method, Mathematics of Computation, vol.70, issue.234, pp.809-825, 2001.
DOI : 10.1090/S0025-5718-00-01213-8

A. Weil, Sur les courbes alg??briques et les vari??t??s qui s???en d??duisent (Introduction), 1948.
DOI : 10.1007/978-1-4757-1705-1_46

A. Weil, Courbes algébriques et variétés abéliennes, 1971.

R. Zuccherato, New Applications of Elliptic Curves and Function Fields in Cryptography, 1997.

R. J. Zuccherato, The Continued Fraction Algorithm and Regulator for Quadratic Function Fields of Characteristic 2, Journal of Algebra, vol.190, issue.2, pp.563-587, 1997.
DOI : 10.1006/jabr.1996.6985