L. Adleman and J. Demarrais, « A subexponential algorithm for discrete logarithms over all finite fields, Advances in Cryptology?CRYPTO'93
DOI : 10.2307/2152932

URL : http://www.ams.org/mcom/1993-61-203/S0025-5718-1993-1225541-3/S0025-5718-1993-1225541-3.pdf

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, Algorithmic number theory, pp.28-40, 1994.
DOI : 10.1007/3-540-58691-1_39

M. [. Adleman and . Huang, Counting rational points on curves and abelian varieties over finite fields, pp.1-16, 1996.
DOI : 10.1007/3-540-61581-4_36

T. [. Arene, M. Lange, C. Naehrig, and . Ritzenthaler, Faster computation of the Tate pairing, Journal of Number Theory, vol.131, issue.5, p.105, 2009.
DOI : 10.1016/j.jnt.2010.05.013

URL : https://hal.archives-ouvertes.fr/hal-01099947

]. A. Atk88 and . Atkin, « The number of points on an elliptic curve modulo a prime, Chicago IL, p.12, 1988.

H. [. Barreto, B. Kim, M. Lynn, and . Scott, « Efficient algorithms for pairingbased cryptosystems, Lecture Notes in Computer Science, vol.102, pp.354-368, 2002.
DOI : 10.1007/3-540-45708-9_23

URL : http://www.mathmagic.cn/crypt1998-2003/papers/2442/24420354.pdf

M. [. Barreto and . Naehrig, « Pairing-friendly elliptic curves of prime order ». Dans : Selected areas in cryptography, pp.319-331, 2006.

S. [. Barreto, C. Galbraith, M. Héigeartaigh, and . Scott, Efficient pairing computation on supersingular Abelian varieties, Designs, Codes and Cryptography, vol.8, issue.14, pp.239-271, 2007.
DOI : 10.1007/978-1-4757-1920-8

URL : http://eprint.iacr.org/2004/375.ps.gz

]. D. Bl07b, T. Bernstein, and . Lange, Explicit-formulas database, p.105, 2007.

H. [. Birkenhake and . Lange, Complex abelian varieties, Second. T. 302. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences, pp.19-21, 2004.
DOI : 10.1007/978-3-662-06307-1

A. [. Bisson and . Sutherland, Computing the endomorphism ring of an ordinary elliptic curve over a finite field, Journal of Number Theory, vol.131, issue.5, p.12, 2009.
DOI : 10.1016/j.jnt.2009.11.003

URL : https://hal.archives-ouvertes.fr/inria-00383155

M. [. Boneh and . Franklin, « Identity-based encryption from the Weil pairing, SIAM Journal on Computing, vol.323, pp.586-615, 2003.

B. [. Boneh, H. Lynn, and . Shacham, « Short signatures from the Weil pairing, Journal of Cryptology, vol.174, pp.297-319, 2004.

J. [. Bosma, C. Cannon, and . Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.235-265, 1997.
DOI : 10.1006/jsco.1996.0125

J. [. Bost and . Mestre, « Moyenne arithmético-géométrique et périodes des courbes de genre 1 et 2, Gaz. Math, vol.38, pp.36-64, 1988.

K. [. Bröker, A. Lauter, and . Sutherland, « Modular polynomials via isogeny volcanoes (Cf, Preprint, p.12, 2009.

A. [. Bröker and . Sutherland, An explicit height bound for the classical modular polynomial, The Ramanujan Journal, vol.62, issue.4, pp.1-21, 2009.
DOI : 10.1007/978-1-4612-4752-4

D. [. Bröker, K. Gruenewald, and . Lauter, Explicit CM-theory in dimension 2, p.175, 2009.

]. R. Bro06 and . Bröker, « Constructing elliptic curves of prescribed order, p.13, 2006.

]. P. Bru09 and . Bruin, « The Tate pairing for Abelian varieties over finite fields, 2009.

H. [. Buhler, C. Lenstra, and . Pomerance, Factoring integers with the number field sieve, The development of the number field sieve, pp.50-94, 1993.
DOI : 10.1109/TIT.1986.1057137

]. D. Can87 and . Cantor, « Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation 48, pp.95-101, 1987.

H. [. Cantor and . Zassenhaus, A new algorithm for factoring polynomials over finite fields, Mathematics of Computation, vol.36, issue.154, pp.587-592, 1981.
DOI : 10.1090/S0025-5718-1981-0606517-5

D. [. Carls and . Lubicz, « A p-adic quasi-quadratic time and quadratic space point counting algorithm, International Mathematics Research Notices, vol.178, p.177, 2008.

]. R. Car03 and . Carls, « Generalized AGM sequences and approximation of canonical lifts ». Thèse de doct. Avr, 2003.

D. [. Carls, D. Kohel, and . Lubicz, Higher-dimensional 3-adic CM construction, Journal of Algebra, vol.319, issue.3, 2008.
DOI : 10.1016/j.jalgebra.2007.11.016

URL : https://hal.archives-ouvertes.fr/hal-00383119

B. [. Cavallar, A. Dodson, and . Lenstra, Factorization of a 512-bit RSA modulus Advances in Cryptology?EUROCRYPT, pp.1-18, 2000.

P. [. Chatterjee, R. Sarkar, and . Barua, Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields, Lecture Notes in Computer Science, vol.126, pp.168-181, 2004.
DOI : 10.1007/11496618_13

]. H. Coh93 and . Cohen, A course in computational algebraic number theory, p.102, 1993.

]. P. Coh08 and . Cohen, « On the coefficients of the transformation polynomials for the elliptic modular function, Mathematical Proceedings of the Cambridge Philosophical Society. T. 95. 03, pp.389-402, 2008.

]. P. Del69 and . Deligne, « Variétés abéliennes ordinaires sur un corps fini, Inventiones Mathematicae, vol.83, pp.238-243, 1969.

]. C. Die06 and . Diem, « An index calculus algorithm for plane curves of small degree, Algorithmic number theory, pp.543-557, 2006.

E. [. Diem and . Thomé, Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three, Journal of Cryptology, vol.38, issue.192, pp.593-611, 2008.
DOI : 10.1007/978-1-4757-1920-8

URL : https://hal.archives-ouvertes.fr/inria-00107290

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

]. R. Dup06 and . Dupont, « Moyenne arithmetico-geometrique, suites de Borchardt et applications, p.12, 2006.

]. A. Eng09 and . Enge, « The complexity of class polynomial computation via floating point approximations, Mathematics of Computation 78, pp.1089-1107, 2009.

P. [. Enge and . Gaudry, A general framework for subexponential discrete logarithm algorithms, Acta Arithmetica, vol.102, issue.1, 2002.
DOI : 10.4064/aa102-1-6

URL : https://hal.archives-ouvertes.fr/inria-00512717

P. [. Enge, E. Gaudry, and . Thomé, An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves, Journal of Cryptology, vol.68, issue.226, p.7, 2009.
DOI : 10.1090/S0025-5718-01-01352-7

URL : https://hal.archives-ouvertes.fr/inria-00135324

]. J. Fau99 and . Faugère, « A new efficient algorithm for computing Gröbner basis (F4)

]. J. Fau02 and . Faugère, « A new efficient algorithm for computing Gröbner bases without reduction to zero (F 5), Proceedings of the 2002 international symposium on Symbolic and algebraic computation, pp.83-162, 2002.

P. [. Faugère, D. Gianni, T. Lazard, and . Mora, « Efficient computation of zero-dimensional Gröbner bases by change of ordering, Journal of Symbolic Computation, vol.164, pp.329-344, 1993.

[. Faugère, D. Lubicz, and D. Robert, Computing modular correspondences for abelian varieties. Mai, pp.132-143, 2009.

F. [. Fouquet and . Morain, « Isogeny volcanoes and the SEA algorithm T. 2369, Algorithmic number theory, pp.276-291, 2002.

F. [. Galbraith, F. Hess, and . Vercauteren, Hyperelliptic Pairings, Hyperelliptic pairings, p.108, 2007.
DOI : 10.1007/978-3-540-73489-5_7

URL : http://www.isg.rhul.ac.uk/~sdg/Pairing2007-survey.pdf

X. [. Galbraith and . Lin, Computing pairings using x-coordinates only, Designs, Codes and Cryptography, vol.48, issue.4, 2008.
DOI : 10.1007/s00145-004-0312-y

]. P. Gau04 and . Gaudry, « Algorithmes de comptage de points d'une courbe définie sur un corps fini, p.Preprint, 2004.

]. P. Gau07 and . Gaudry, « Fast genus 2 arithmetic based on Theta functions, Journal of Mathematical Cryptology, vol.13, issue.103, pp.243-265, 2007.

]. P. Gau09 and . Gaudry, « Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, Journal of Symbolic Computation, vol.4412, pp.1690-1702, 2009.

N. [. Gaudry and . Gurel, Counting Points in Medium Characteristic Using Kedlaya's Algorithm, Experimental Mathematics, vol.23, issue.1, pp.395-402, 2003.
DOI : 10.1007/3-540-44987-6_1

F. [. Gaudry, N. Hess, and . Smart, Constructive and destructive facets of Weil descent on elliptic curves, Journal of Cryptology, vol.44, issue.1, pp.19-46, 2002.
DOI : 10.1007/3-540-48910-X_12

URL : https://hal.archives-ouvertes.fr/inria-00512763

T. [. Gaudry, D. Houtmann, C. Kohel, A. Ritzenthaler, and . Weng, The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography, Advances in cryptology?ASIACRYPT 2006. T. 4284. Lecture Notes in Comput. Sci, pp.114-129, 2006.
DOI : 10.1007/11935230_8

URL : https://hal.archives-ouvertes.fr/inria-00103435

D. [. Gaudry and . Lubicz, « The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines ». Dans : Finite Fields and Their Applications 15, pp.246-260, 2009.

E. [. Gaudry and . Schost, Hyperelliptic curve point counting record : 254 bit Jacobian, p.162, 2008.

E. [. Gaudry, N. Thomé, C. Thériault, and . Diem, A double large prime variation for small genus hyperelliptic index calculus, Mathematics of Computation, vol.76, issue.257, pp.475-492, 2007.
DOI : 10.1090/S0025-5718-06-01900-4

URL : https://hal.archives-ouvertes.fr/inria-00000897

B. [. Geer and . Moonen, « Abelian varieties, pp.41-113, 2007.

]. D. Gor93 and . Gordon, « Discrete Logarithms in GF(P) Using the Number Field Sieve

O. [. Goyal, A. Pandey, B. Sahai, and . Waters, Attribute-based encryption for fine-grained access control of encrypted data, Proceedings of the 13th ACM conference on Computer and communications security , CCS '06, pp.98-105, 2006.
DOI : 10.1145/1180405.1180418

F. [. Granger, R. Hess, N. Oyono, F. Theriault, and . Vercauteren, Ate Pairing on Hyperelliptic Curves, Ate pairing on hyperelliptic curves, pp.430-447, 2007.
DOI : 10.1007/978-3-540-72540-4_25

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-72540-4_25.pdf

]. R. Har00 and . Hartshorne, Algebraic geometry, Cf. p, vol.4, issue.10, pp.27-76, 2000.

]. D. Har07 and . Harvey, « Kedlaya's algorithm in larger characteristic, Int. Math. Res. Notices, p.10, 2007.

N. [. Hess, F. Smart, and . Vercauteren, The Eta Pairing Revisited, IEEE Transactions on Information Theory, vol.52, issue.10, pp.4595-4602, 2006.
DOI : 10.1109/TIT.2006.881709

]. W. Hoy63 and . Hoyt, « On products and algebraic families of Jacobian varieties, pp.415-423, 1963.

]. Igu72 and . Igusa, Theta functions. Die Grundlehren der mathematischen Wissenschaften , Band 194, pp.232-245, 1972.

]. A. Jou04 and . Joux, « A one round protocol for tripartite Diffie?Hellman, Journal of Cryptology, vol.174, pp.263-276, 2004.

]. K. Ked01 and . Kedlaya, « Counting points on hyperelliptic curves using Monsky- Washnitzer cohomology, Preprint, p.10, 2001.

K. [. Kleinjung, J. Aoki, and . Franke, Factorization of a 768-Bit RSA Modulus, 2010.
DOI : 10.1007/978-3-642-14623-7_18

URL : https://hal.archives-ouvertes.fr/inria-00444693

]. N. Kob87 and . Koblitz, Mathematics of computation 48, Elliptic curve cryptosystems, pp.203-209, 1987.

]. D. Koh96 and . Kohel, « Endomorphism rings of elliptic curves over finite fields, Thèse de doct. University of California, p.12, 1996.

]. D. Koh03 and . Kohel, « The AGM-X ? (N) Heegner point lifting algorithm and elliptic curve point counting, cryptology?ASIACRYPT 2003. T. 2894. Lecture Notes in Comput. Sci, pp.124-136, 2003.

]. S. Koi76 and . Koizumi, « Theta relations and projective normality of abelian varieties, American Journal of Mathematics, pp.865-889, 1976.

]. T. Lan05 and . Lange, « Formulae for arithmetic on genus 2 hyperelliptic curves, Applicable Algebra in Engineering, Communication and Computing, vol.155, pp.295-328, 2005.

]. D. Laz81 and . Lazard, « Resolution des systemes d'equations algebriques, THEORET. COMP. SCI, vol.151, pp.77-110, 1981.

]. D. Laz83 and . Lazard, « Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, Computer Algebra, pp.146-156, 1983.

]. D. Laz92 and . Lazard, « Solving zero-dimensional algebraic systems, Journal of symbolic computation 13, pp.117-131, 1992.

H. [. Lenstra, M. Lenstra, J. Manasse, and . Pollard, « The number field sieve, The development of the number field sieve, pp.11-42, 1993.

]. R. Ler97 and . Lercier, Algorithmique des courbes elliptiques dans les corps finis. These, LIX?CNRS, juin 1997, 1997.

D. [. Lercier and . Lubicz, Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time, Cryptology?EUROCRYPT '2003. Sous la dir. d'E. Biham. Lecture Notes in Computer Science, p.176, 2003.
DOI : 10.1007/3-540-39200-9_22

URL : https://hal.archives-ouvertes.fr/hal-01102038

D. [. Lercier and . Lubicz, A quasi quadratic time algorithm for hyperelliptic curve point counting, The Ramanujan Journal, vol.2, issue.1, pp.399-423, 2006.
DOI : 10.1007/978-1-4757-1920-8

URL : https://hal.archives-ouvertes.fr/hal-00456401

]. S. Lic69 and . Lichtenbaum, « Duality theorems for curves over p-adic fields, Inventiones mathematicae 7, pp.120-136, 1969.

T. [. Lubicz and . Sirvent, Attribute-Based Broadcast Encryption Scheme Made Efficient, Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology, pp.325-342, 2008.
DOI : 10.1007/978-3-540-68164-9_22

URL : https://hal.archives-ouvertes.fr/hal-00378805

]. D. Lr10a, D. Lubicz, and . Robert, Computing isogenies between abelian varieties, pp.111-149, 2010.

]. D. Lr10b, D. Lubicz, G. Robert-de, F. Hanrot, E. Morain et al., Efficient pairing computation with theta functions Sous la dir, 9th International Symposium Proceedings, 2010.

J. Lubin, J. Serre, and J. Tate, Elliptic Curves and formal groups, 1964.

S. [. Maurer and . Wolf, The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms, SIAM Journal on Computing, vol.28, issue.5, p.1689, 1999.
DOI : 10.1137/S0097539796302749

T. [. Menezes, S. Okamoto, and . Vanstone, « Reducing elliptic curve logarithms to logarithms in a finite field, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.89, 1991.

]. Mes01 and . Mestre, Lettre à Gaudry et Harley, pp.173-176, 2001.

]. Mes02 and . Mestre, Notes of a talk given at the Cryptography Seminar Rennes, 2002.

]. J. Mil91 and . Milne, Abelian varieties, 1991.

M. [. Miyaji, S. Nakabayashi, and . Takano, « New explicit conditions of elliptic curve traces for FR-reduction, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.845, pp.1234-1243, 2001.

]. F. Mor95 and . Morain, « Calcul du nombre de points sur une courbe elliptique dans un corps fini : aspects algorithmiques, J. Théor. Nombres Bordeaux, vol.7, pp.255-282, 1995.

]. D. Mum66 and . Mumford, « On the equations defining abelian varieties. I », Invent. Math, vol.1, issue.69, pp.287-354, 1920.

]. D. Mum69 and . Mumford, « Varieties defined by quadratic equations ». Dans : Questions on Algebraic Varieties (CIME, III Ciclo, Varenna, pp.29-100, 1969.

]. D. Mum70 and . Mumford, Abelian varieties Published for the Tata Institute of Fundamental Research, Tata Institute of Fundamental Research Studies in MathematicsCf. p. 5, vol.19, issue.113, pp.242-267, 1970.

]. D. Mum83, C. Mumford, M. Musili, E. Nori, M. Previato et al., Tata lectures on theta I. T. 28, Progress in Mathematics. With the assistance of, pp.34-37, 1983.

]. D. Mum84, . Mumford, M. Musili, E. Nori, M. Previato et al., Tata lectures on theta II. T. 43 With the collaboration of C, Progress in Mathematics. Jacobian theta functions and differential equations, pp.95-153, 1984.

]. D. Mum91 and . Mumford, Tata lectures on theta III. T. 97 With the collaboration of Madhav Nori and Peter Norman, Progress in Mathematics, 1991.

]. D. Mum99 and . Mumford, The red book of varieties and schemes. T. 1358. Lecture Notes in Mathematics. Second, expanded edition. Includes the Michigan lectures (1974) on curves and their Jacobians. With contributions by Enrico Arbarello, p.13, 1999.

[. Suite and B. Cryptography, Fact Sheet, National Security Agency Central Security Service http://www.nsa.gov/business/programs/elliptic _ curve.shtml, 2009.

M. [. Héigeartaigh and . Scott, « Pairing calculation on supersingular genus 2 curves ». Dans : Selected Areas in Cryptography : 13th International Workshop Revised Selected Papers, p.302, 2006.

K. [. Oort and . Ueno, « Principally polarized abelian varieties of dimension two or three are Jacobian varieties, Journal of the Faculty of Science Mathematics, p.377, 1973.

N. [. Page, F. Smart, and . Vercauteren, A comparison of MNT curves and supersingular curves, Applicable Algebra in Engineering, Communication and Computing, pp.379-392, 2006.
DOI : 10.1007/s00200-006-0017-6

]. J. Pil90 and . Pila, « Frobenius maps of abelian varieties and finding roots of unity in finite fields, Mathematics of Computation, vol.55192, pp.745-763, 1990.

M. [. Pohlig and . Hellman, « An improved algorithm for computing logarithms over GF (p) and its cryptographic significance (Corresp, IEEE Transactions on information Theory, vol.241, pp.106-110, 1978.

]. C. Pom87 and . Pomerance, « Fast, rigorous factorization and discrete logarithm algorithms ». Dans : Discrete algorithms and complexity : proceedings of the Japan- US Joint Seminar, pp.119-143, 1986.

]. F. Ric36 and . Richelot, « Essai sur une méthode générale pour déterminer la valeur des intégrales ultra-elliptiques, fondée sur des transformations remarquables de ces transcendantes, C. R. Acad. Sci. Paris, vol.2, issue.149, pp.622-627, 1836.

]. F. Ric37 and . Richelot, « De transformatione Integralium Abelianorum primiordinis commentation, J. reine angew. Math, vol.16, issue.149, pp.221-341, 1837.

A. [. Rivest, L. Shamir, and . Adleman, « A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.212, issue.1, pp.120-146, 1978.

A. [. Rubin and . Silverberg, Using Abelian Varieties to Improve Pairing-Based Cryptography, Journal of Cryptology, vol.86, issue.4, pp.330-364, 2009.
DOI : 10.1007/978-1-4684-9156-2

URL : http://math.uci.edu/~asilverb/bibliography/rubsilav.pdf

B. [. Sahai and . Waters, Fuzzy Identity-Based Encryption, Advances in Cryptology?EUROCRYPT 2005, pp.457-473, 2005.
DOI : 10.1007/11426639_27

]. T. Sat00 and . Satoh, « The canonical lift of an ordinary elliptic curve over a finite field and its point counting, J. Ramanujan Math. Soc, vol.15, issue.4, pp.247-270, 2000.

]. J. Ser68 and . Serre, Corps locaux, p.115, 1968.

]. N. She08 and . Shepherd-barron, « Thomae's formulae for non-hyperelliptic curves and spinorial square roots of theta-constants on the moduli space of curves, p.176, 2008.

]. V. Sho97 and . Shoup, « Lower bounds for discrete logarithms and related problems, Advances in Cryptology?EUROCRYPT'97, pp.256-266, 1997.

]. J. Sil86 and . Silverman, The arithmetic of elliptic curves. T. 106. Graduate Texts in Mathematics. Corrected reprint of the 1986 original, pp.400-400, 1986.

]. B. Smi09 and . Smith, Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves. Fév, pp.12-176, 2009.

]. A. Sut09 and . Sutherland, Computing Hilbert class polynomials with the Chinese remainder theorem, Mathematics of Computation, vol.174, p.12, 2009.

J. Vélu, « Isogénies entre courbes elliptiques, A238?A241. (Cf, p.11, 1971.

]. E. Ver01 and . Verheul, Advances in Cryptology?ASIACRYPT, Self-blindable credential certificates from the Weil pairing, pp.533-551, 2001.

]. P. Wam99 and . Wamelen, « Equations for the Jacobian of a hyperelliptic curve, pp.3083-3106, 1999.

Y. [. Wang, Y. Nogami, and . Morikawa, « A High-Speed Square Root Computation in Finite Fields with Application to Elliptic Curve Cryptosystem, CD-ROM), vol.39, pp.82-92, 2005.

]. A. Wei48 and . Weil, Sur les courbes algébriques et les variétés qui s' en déduisent, Hermann et Cie, 1948.

]. A. Wei49 and . Weil, « Numbers of solutions of equations in finite fields