. Guillermin, A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$, Proc. Cryptographic Hardware and Embedded Systems (CHES), pp.48-64, 2010.
DOI : 10.1007/978-3-642-15031-9_4

(. F. Herbaut and . Veron, A Public Key Cryptosystem Based upon Euclidean Addition Chains, Proc. 6th International Conference on Sequences and Their Applications (SETA), pp.284-297, 2010.
DOI : 10.1007/978-3-642-15874-2_24

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

(. D. Knuth, ? Seminumerical Algorithms The Art of Computer Programming, 1997.

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

. Meloni, New Point Addition Formulae for ECC Applications, Proc. 1st International Workshop on Arithmetic of Finite Fields (WAIFI), pp.189-201, 2007.
DOI : 10.1007/978-3-540-73074-3_15

URL : https://hal.archives-ouvertes.fr/lirmm-00188957

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

E. Oswald, ? Advances in Elliptic Curve Cryptography, chap. Side Channel Analysis, pp.69-86, 2005.