J. Belding, R. Broker, A. Enge, and K. Lauter, Computing Hilbert Class Polynomials, Algorithmic Number Theory Symposium-ANTS VIII, pp.282-295, 2008.
DOI : 10.1007/978-3-540-79456-1_19
URL : https://hal.archives-ouvertes.fr/inria-00246115

G. Bisson, Endomorphism rings in cryptography, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00609211

R. Bröker, D. Gruenewald, and K. Lauter, Explicit CM theory for level 2-structures on abelian surfaces, Algebra & Number Theory, vol.5, issue.4, pp.495-528, 2011.
DOI : 10.2140/ant.2011.5.495

K. Eisenträger and K. Lauter, A CRT algorithm for constructing genus 2 curves over finite fields, Arithmetic, Geometry and Coding Theory (AGCT -10), Séminaires et Congrès 21, pp.161-176, 2009.

D. Freeman and K. Lauter, Computing endomorphism rings of jacobians of genus 2 curves, Symposium on Algebraic Geometry and its Applications, 2006.

P. Gaudry, T. Houtmann, D. Kohel, C. Ritzenhaler, and A. Weng, The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography, Lecture Notes in Computer Science, vol.4284, pp.114-129, 2006.
DOI : 10.1007/11935230_8
URL : https://hal.archives-ouvertes.fr/inria-00103435

S. Ionica and A. Joux, Another Approach to Pairing Computation in Edwards Coordinates, Progress in Cryptography-Indocrypt, pp.400-413, 2008.
DOI : 10.1007/s00145-004-0315-8

S. Ionica and A. Joux, Pairing the volcano, Mathematics of Computation, vol.82, issue.281, pp.581-603, 2013.
DOI : 10.1090/S0025-5718-2012-02622-6
URL : https://hal.archives-ouvertes.fr/hal-00448031

J. S. Milne, Abelian Varieties
DOI : 10.1007/978-1-4613-8655-1_5

S. Lichtenbaum, Duality theorems for curves overP-adic fields, Inventiones Mathematicae, vol.27, issue.2, pp.120-136, 1969.
DOI : 10.1007/BF01389795

V. Miller, The Weil Pairing, and Its Efficient Calculation, Journal of Cryptology, vol.17, issue.4, pp.235-261, 2004.
DOI : 10.1007/s00145-004-0315-8

S. L. Schmoyer, The Triviality and Nontriviality of Tate-Lichtenbaum Self-Pairings on Jacobians of curves, 2006.

G. Shimura, Abelian varieties with complex multiplication and modular functions. Princeton Mathematical Series, 1998.
DOI : 10.1515/9781400883943

A. Sutherland, Computing Hilbert Class Polynomials with the CRT, p.2785, 2009.

A. Weng, Constructing hyperelliptic curves of genus 2 suitable for cryptography, Mathematics of Computation, vol.72, issue.241, pp.435-458, 2003.
DOI : 10.1090/S0025-5718-02-01422-9