J. Daniel and . Bernstein, Can we avoid zero tests for fast elliptic-curve arithmetic? https, 2006.

J. Daniel and . Bernstein, Curve25519: New Diffie-Hellman speed records, pp.207-228

J. Daniel and . Bernstein, Differential addition chains, 2006.

D. J. Bernstein, P. Birkner, M. Joye, T. Lange, and C. Peters, Twisted Edwards Curves, Progress in Cryptology -AFRICACRYPT 2008, First International Conference on Cryptology in Africa Proceedings, pp.389-405, 2008.
DOI : 10.1007/978-3-540-68164-9_26

D. J. Bernstein, C. Chuengsatiansup, T. Lange, P. Schwabe, and R. O. , Kummer Strikes Back: New DH Speed Records, Palash Sarkar and Tetsu Iwata Advances in Cryptology -ASIACRYPT 2014 -20th International Conference on the Theory and Application of Cryptology and Information Security Proceedings, Part I, pp.317-337, 2014.
DOI : 10.1007/978-3-662-45611-8_17

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.2270

J. Daniel, T. Bernstein, and . Lange, Faster addition and doubling on elliptic curves Advances in Cryptology -ASIACRYPT, 13th International Conference on the Theory and Application of Cryptology and Information Security Proceedings, pp.29-50, 2007.

I. Biehl, B. Meyer, and V. Müller, Differential fault attacks on elliptic curve cryptosystems Advances in Cryptology -CRYPTO, 20th Annual International Cryptology Conference Proceedings, volume 1880 of Lecture Notes in Computer Science, pp.131-146, 2000.

W. Joppe, C. Bos, H. Costello, K. E. Hisil, and . Lauter, Fast cryptography in genus 2, Advances in Cryptology -EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings , volume 7881 of Lecture Notes in Computer Science, pp.194-210, 2013.

E. Brier and M. Joye, Weierstraß elliptic curves and side-channel attacks Public Key Cryptography, 5th International Workshop on Practice and Theory in Public Key Cryptosystems, Proceedings, volume 2274 of Lecture Notes in Computer Science, pp.335-345, 2002.

R. L. Daniel and . Brown, Multi-dimensional Montgomery ladders for elliptic curves, 2006.

J. W. Cassels, Lectures on elliptic curves, 1991.
DOI : 10.1017/cbo9781139172530

J. W. Cassels and E. V. Flynn, Prolegomena to a middlebrow arithmetic of curves of genus 2, 1996.
DOI : 10.1017/CBO9780511526084

W. Castryck, S. D. Galbraith, and R. R. Farashahi, Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation, IACR Cryptology ePrint Archive, p.218, 2008.

V. David, . Chudnovsky, V. Gregory, and . Chudnovsky, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Advances in Applied Mathematics, vol.7, issue.4, pp.385-434, 1986.

P. Chung, C. Costello, and B. Smith, Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers, Selected Areas in Cryptography -SAC 2016 -23rd International Conference, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01353480

R. Cosset, Factorization with genus 2 curves, Mathematics of Computation, vol.79, issue.270, pp.1191-1208, 2010.
DOI : 10.1090/S0025-5718-09-02295-9

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

C. Costello, H. Hisil, and B. Smith, Faster Compact Diffie???Hellman: Endomorphisms on the x-line, Advances in Cryptology -EUROCRYPT 2014 -33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, volume 8441 of Lecture Notes in Computer Science, pp.183-200, 2014.
DOI : 10.1007/978-3-642-55220-5_11

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

C. Doche, T. Icart, and D. R. Kohel, Efficient Scalar Multiplication by Isogeny Decompositions, pp.191-206
DOI : 10.1007/11745853_13

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.2150

S. Duquesne, Montgomery Scalar Multiplication for Genus 2 Curves, Algorithmic Number Theory, 6th International Symposium, ANTS-VI Proceedings, pp.153-168, 2004.
DOI : 10.1007/978-3-540-24847-7_11

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

S. Duquesne, Traces of the Group Law on the Kummer Surface of a Curve of Genus 2 in Characteristic 2, Mathematics in Computer Science, vol.12, issue.5, pp.173-183, 2010.
DOI : 10.1007/s11786-009-0013-x

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

H. Edwards, A normal form for elliptic curves, Bulletin of the American Mathematical Society, vol.44, issue.03, pp.393-422, 2007.
DOI : 10.1090/S0273-0979-07-01153-6

R. P. Gallant, R. J. Lambert, and S. A. Vanstone, Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms, Advances in Cryptology -CRYPTO 2001, 21st Annual International Cryptology Conference Proceedings, volume 2139 of Lecture Notes in Computer Science, pp.190-200, 2001.
DOI : 10.1007/3-540-44647-8_11

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.2004

P. Gaudry, Fast genus 2 arithmetic based on Theta functions, Journal of Mathematical Cryptology, vol.1, issue.3, pp.243-265, 2007.
DOI : 10.1515/JMC.2007.012

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

P. Gaudry and D. Lubicz, The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines. Finite Fields and Their Applications, pp.246-260, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00266565

M. Hamburg, Ed448-Goldilocks, a new elliptic curve. Cryptology ePrint Archive, 2015.

H. Hisil, K. Wong, G. Carter, and E. Dawson, Twisted Edwards Curves Revisited, 14th International Conference on the Theory and Application of Cryptology and Information Security, pp.326-343, 2008.
DOI : 10.1007/BFb0053453

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.3196

C. Paul and . Kocher, Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems Advances in Cryptology -CRYPTO '96, 16th Annual International Cryptology Conference Proceedings, volume 1109 of Lecture Notes in Computer Science, pp.104-113, 1996.

D. Kohel, Arithmetic of Split Kummer Surfaces: Montgomery Endomorphism of Edwards Products, Coding and Cryptology -Third International Workshop, IWCC 2011 Proceedings , volume 6639 of Lecture Notes in Computer Science, pp.238-245, 2011.
DOI : 10.1090/S0025-5718-1987-0866113-7

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

A. Langley, M. Hamburg, and S. Turner, Elliptic curves for security, 2016.
DOI : 10.17487/RFC7748

W. Hendrik and . Jr, Factoring integers with elliptic curves, Annals of mathematics, pp.649-673, 1987.

C. Hoon, L. , and P. Lee, A key recovery attack on discrete log-based schemes using a prime order subgroupp Advances in Cryptology -CRYPTO '97, 17th Annual International Cryptology Conference Proceedings, volume 1294 of Lecture Notes in Computer Science, pp.249-263, 1997.

J. López and R. Dahab, Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation, Cryptographic Hardware and Embedded Systems, First International Workshop, CHES'99 Proceedings, volume 1717 of Lecture Notes in Computer Science, pp.316-327, 1999.
DOI : 10.1007/3-540-48059-5_27

D. Lubicz and D. Robert, Arithmetic on abelian and Kummer varieties. Finite Fields and Their Applications, pp.130-158, 2016.
DOI : 10.1016/j.ffa.2016.01.009

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

S. Victor and . Miller, Use of elliptic curves in cryptography, Advances of Cryptology - CRYPTO, pp.417-426, 1985.

L. Peter and . Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of computation, vol.48, issue.177, pp.243-264, 1987.

L. Peter and . Montgomery, Evaluating recurrences of form x m+n = f (xm, xn, x m?n ) via Lucas chains, 1992.

K. Okeya, H. Kurumatani, and K. Sakurai, Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications, Hideki Imai and Yuliang Zheng Public Key Cryptography, Third International Workshop on Practice and Theory in Public Key Cryptography Proceedings, volume 1751 of Lecture Notes in Computer Science, pp.238-257, 2000.
DOI : 10.1007/978-3-540-46588-1_17

K. Okeya and K. Sakurai, Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomeryform elliptic curve, Cryptographic Hardware and Embedded Systems -CHES 2001, Third International Workshop Proceedings, volume 2162 of Lecture Notes in Computer Science, pp.126-141, 2001.

M. John and . Pollard, Monte Carlo methods for index computation (mod p) Mathematics of computation, pp.918-924, 1978.

J. Renes, P. Schwabe, B. Smith, and L. Batina, µKummer: Efficient hyperelliptic signatures and key exchange on microcontrollers, Cryptographic Hardware and Embedded Systems ? CHES 2016: 18th International Conference Proceedings, pp.301-320, 2016.
DOI : 10.1007/978-3-662-53140-2_15

URL : http://arxiv.org/abs/1604.06059

E. Igor, D. Shparlinski, and . Sutantyo, Distribution of elliptic twin primes in isogeny and isomorphism classes, Journal of Number Theory, vol.137, pp.1-15, 2014.

P. Nigel, S. Smart, and . Siksek, A fast Diffie?Hellman protocol in genus 2, Journal of cryptology, vol.12, issue.1, pp.67-73, 1999.

M. Stam, Speeding up subgroup cryptosystems, 2003.

P. Zimmermann and B. Dodson, 20 Years of ECM, Algorithmic Number Theory, 7th International Symposium, ANTS-VII Proceedings, pp.525-542, 2006.
DOI : 10.1007/11792086_37

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