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

D. J. Bernstein and T. Lange, Faster Addition and Doubling on Elliptic Curves, In: ASIACRYPT. pp, pp.29-50, 2007.
DOI : 10.1007/978-3-540-76900-2_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.4261

B. B. Brumley and N. Tuveri, Remote Timing Attacks Are Still Practical, pp.355-371, 2011.
DOI : 10.1007/978-3-642-23822-2_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.452.4321

D. Brumley and D. Boneh, Remote timing attacks are practical, Computer Networks, vol.48, issue.5, pp.701-716, 2005.
DOI : 10.1016/j.comnet.2005.01.010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2615

J. Devigne and M. Joye, Binary Huff Curves, Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011. pp. 340?355. CT-RSA'11, 2011.
DOI : 10.1109/12.869328

P. Gallagher and C. Furlani, Fips pub 186-3 federal information processing standards publication digital signature standard, 2009.

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

G. B. Huff, Diophantine problems in geometry and elliptic ternary forms, Duke Mathematical Journal, vol.15, issue.2, pp.443-453, 1948.
DOI : 10.1215/S0012-7094-48-01543-9

M. Joye, M. Tibouchi, and D. Vergnaud, Huff???s Model for Elliptic Curves, In: ANTS. pp, pp.234-250, 2010.
DOI : 10.1007/978-3-642-14518-6_20

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

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, pp.316-327, 1999.
DOI : 10.1007/3-540-48059-5_27

J. López and R. Dahab, High-Speed Software Multiplication in F2m, pp.203-212, 2000.
DOI : 10.1007/3-540-44495-5_18

A. Menezes, T. Okamoto, and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, Proceedings of the twenty-third annual ACM symposium on Theory of computing. pp. 80?89. STOC '91, 1991.

V. S. Miller, Use of Elliptic Curves in Cryptography, pp.417-426, 1986.
DOI : 10.1007/3-540-39799-X_31

R. Schroeppel, H. K. Orman, S. W. O-'malley, and O. Spatscheck, Fast Key Exchange with Elliptic Curve Systems, In: CRYPTO. pp, pp.43-56, 1995.
DOI : 10.1007/3-540-44750-4_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9135

J. Silverman, The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, vol.106, 1986.

M. Stam, On Montgomery-like representations for elliptic curves over GF(2 k ) In: Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography, PKC '03, pp.240-253, 2003.

Y. Zhang, A. Juels, M. K. Reiter, and T. Ristenpart, Cross-VM side channels and their use to extract private keys, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, pp.305-316, 2012.
DOI : 10.1145/2382196.2382230
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.248.4907