I. Bernstein, . Lange, D. J. Bernstein, and T. Lange, Explicit-formulas database

. Bos, Fast Cryptography in Genus 2, Journal of Cryptology, vol.29, issue.1, pp.28-60, 2016.
DOI : 10.1090/S0025-5718-02-01422-9

. Cohen, Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Mathematics and Its Applications. Chapman & Hall, 2005.
DOI : 10.1201/9781420034981

. Hankerson, Guide to Elliptic Curve Cryptography, 2004.

. Koç, Analyzing and comparing Montgomery multiplication algorithms, IEEE Micro, vol.16, issue.3, pp.1626-1659, 1996.
DOI : 10.1109/40.502403

G. Gallin-a, Tisserand Hardware Architectures for HECC CryptArchi, 2017.

I. References and . Ma, A high-speed elliptic curve cryptographic processor for generic curves over GF(p), 2013.

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation, vol.48, issue.177, pp.243-264, 1987.
DOI : 10.1090/S0025-5718-1987-0866113-7

H. Orup, Simplifying quotient determination in high-radix modular multiplication, Proceedings of the 12th Symposium on Computer Arithmetic, 1995.
DOI : 10.1109/ARITH.1995.465359

. Renes, µKummer: Efficient hyperelliptic signatures and key exchange on microcontrollers, 2016.
DOI : 10.1007/978-3-662-53140-2_15
URL : http://arxiv.org/abs/1604.06059

G. Gallin-a, Tisserand Hardware Architectures for HECC CryptArchi, 2017.