D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography, 2004.

H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange et al., Handbook of Elliptic and Hyperelliptic Curve Cryptography , ser. Discrete Mathematics and Its Applications, 2005.

J. Renes, P. Schwabe, B. Smith, and L. Batina, µKummer: Efficient hyperelliptic signatures and key exchange on microcontrollers, Proc. Workshop on Cryptographic Hardware and Embedded Systems (CHES), ser. LNCS, pp.301-320, 2016.

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

C. ¸. Koç, T. Acar, B. S. Kaliski, and J. , Analyzing and comparing Montgomery multiplication algorithms, IEEE Micro, vol.16, issue.3, pp.26-33, 1996.
DOI : 10.1109/40.502403

Y. Ma, Z. Liu, W. Pan, and J. Jing, A High-Speed Elliptic Curve Cryptographic Processor for Generic Curves over $$\mathrm{GF}(p)$$, Proc. 20th International Workshop on Selected Areas in Cryptography (SAC), ser. LNCS, pp.421-437, 2013.
DOI : 10.1007/978-3-662-43414-7_21

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

P. Gaudry, Fast genus 2 arithmetic based on Theta functions, Journal of Mathematical Cryptology, vol.15, issue.3, pp.243-265, 2007.
DOI : 10.1090/S0025-5718-02-01422-9
URL : https://hal.archives-ouvertes.fr/inria-00000625

G. Gallin, T. U. Celik, and A. Tisserand, Architecture level optimizations for Kummer based HECC on FPGAs, Proc. 18th International Conference on Cryptology in India (IndoCrypt), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01614063