D. F. Aranha and C. P. Gouvêa, RELIC is an Efficient LIbrary for Cryptography

D. F. Aranha, J. López, and D. Hankerson, Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets, LATINCRYPT, pp.144-161, 2010.
DOI : 10.1007/978-3-642-14712-8_9

J. Daniel and . Bernstein, Curve25519: New Diffie-Hellman speed records, Moti Yung Public Key Cryptography, pp.207-228, 2006.

D. J. Bernstein, N. Duif, T. Lange, P. Schwabe, and B. Yang, High-speed high-security signatures, Journal of Cryptographic Engineering, vol.30, issue.2, pp.77-89, 2012.
DOI : 10.1007/s13389-012-0027-1

D. J. Bernstein, M. Hamburg, A. Krasnova, and T. Lange, Elligator, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, 2013.
DOI : 10.1145/2508859.2516734

W. Joppe, T. Bos, R. Kleinjung, P. Niederhagen, and . Schwabe, ECC2K-130 on Cell CPUs, AFRICACRYPT, pp.225-242, 2010.

E. Brier, T. Jean-sebastien-coron, D. Icart, H. Madore, M. Randriam et al., Efficient Indifferentiable Hashing into Ordinary Elliptic Curves, Cryptology ePrint Archive Report, vol.340, 2009.
DOI : 10.1007/978-3-642-14623-7_13

E. Brier, T. Jean-sébastien-coron, D. Icart, H. Madore, M. Randriam et al., Efficient Indifferentiable Hashing into Ordinary Elliptic Curves, Lecture Notes in Computer Science, vol.6223, pp.237-254, 2010.
DOI : 10.1007/978-3-642-14623-7_13

C. Research, SEC 2: Recommended elliptic curve domain parameters, Version 2, 2010.

R. Farashahi, Hashing into Hessian Curves, Lecture Notes in Computer Science, vol.3, issue.2, pp.278-289, 2011.
DOI : 10.1006/ffta.1997.0191

R. Rezaeian-farashahi, P. Fouque, I. Shparlinski, M. Tibouchi, and J. F. Voloch, Indifferentiable deterministic hashing to elliptic and hyperelliptic curves, Math. Comp, vol.82, issue.281, p.2013

N. Firasta, M. Buxton, P. Jinbo, K. Nasri, and S. Kuo, Intel AVX: New frontiers in performance improvement and energy efficiency. White paper

A. Pierre-alain-fouque, M. Joux, and . Tibouchi, Injective Encodings to Elliptic Curves, Lecture Notes in Computer Science, vol.7959, pp.203-218, 2013.
DOI : 10.1007/978-3-642-39059-3_14

P. Fouque and M. Tibouchi, Indifferentiable Hashing to Barreto???Naehrig Curves, Lecture Notes in Computer Science, vol.7533, pp.1-17, 2012.
DOI : 10.1007/978-3-642-33481-8_1
URL : https://hal.archives-ouvertes.fr/hal-01094321

J. Guajardo and C. Paar, Itoh-Tsujii inversion in standard basis and its application in cryptography and codes, Designs, Codes and Cryptography, vol.25, issue.2, pp.207-216, 2002.
DOI : 10.1023/A:1013860532636

D. Hankerson, K. Karabina, and A. Menezes, Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields, IEEE Transactions on Computers, vol.58, issue.10, pp.581411-1420, 2009.
DOI : 10.1109/TC.2009.61

T. Itoh and S. Tsujii, A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases, Information and Computation, vol.78, issue.3, pp.171-177, 1988.
DOI : 10.1016/0890-5401(88)90024-7

M. Lochter and J. Merkle, Elliptic curve cryptography (ECC) Brainpool standard curves and curve generation, RFC, vol.5639, 2010.
DOI : 10.17487/rfc5639

B. Möller, A Public-Key Encryption Scheme with Pseudo-random Ciphertexts, Lecture Notes in Computer Science, vol.3193, pp.335-351, 2004.
DOI : 10.1007/978-3-540-30108-0_21

T. Oliveira, J. López, D. F. Aranha, and F. , Two is the fastest prime: lambda coordinates for binary elliptic curves, Journal of Cryptographic Engineering, vol.1, issue.4, pp.3-17, 2014.
DOI : 10.1007/s13389-013-0069-z

A. Shallue and C. Van-de-woestijne, Construction of Rational Points on Elliptic Curves over Finite Fields, Lecture Notes in Computer Science, vol.4076, pp.510-524, 2006.
DOI : 10.1007/11792086_36

J. Taverne, A. Faz-hernández, D. F. Aranha, F. Rodríguez-henríquez, D. Hankerson et al., Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction, Journal of Cryptographic Engineering, vol.23, issue.1, pp.187-199, 2011.
DOI : 10.1007/s13389-011-0017-8

M. Tibouchi, Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings, Financial Cryptography, 2014.
DOI : 10.1007/978-3-662-45472-5_10

Z. Weinberg, J. Wang, V. Yegneswaran, L. Briesemeister, S. Cheung et al., StegoTorus, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, pp.109-120, 2012.
DOI : 10.1145/2382196.2382211

E. Wustrow, S. Wolchok, I. Goldberg, and J. A. Halderman, Telex: Anticensorship in the network infrastructure, USENIX Security Symposium. USENIX Association, 2011.

L. Adam, M. Young, and . Yung, Space-efficient kleptography without random oracles, Information Hiding, pp.112-129, 2007.

L. Adam, M. Young, and . Yung, Kleptography from standard assumptions and applications, Lecture Notes in Computer Science, vol.6280, pp.271-290, 2010.