C. Arène, T. Lange, M. Naehrig, and C. Ritzenthaler, Faster computation of the Tate pairing, Journal of Number Theory, vol.131, issue.5, 2009.
DOI : 10.1016/j.jnt.2010.05.013

R. Balasubramanian and N. Koblitz, The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes???Okamoto???Vanstone Algorithm, Journal of Cryptology, vol.11, issue.2, pp.141-145, 1998.
DOI : 10.1007/s001459900040

S. L. Paulo, S. D. Barreto, . Galbraith, O. Colm, M. Eigeartaigh et al., Efficient pairing computation on supersingular abelian varieties, Des. Codes Cryptography, vol.42, issue.3, pp.239-271, 2007.

S. L. Paulo, B. Barreto, M. Lynn, and . Scott, On the selection of pairingfriendly groups, Proc. of SAC 2003, pp.17-25, 2003.

S. L. Paulo, B. Barreto, M. Lynn, and . Scott, Efficient implementation of pairing-based cryptosystems, J. Cryptology, vol.17, issue.4, pp.321-334, 2004.

S. L. Paulo, M. Barreto, and . Naehrig, Pairing-friendly elliptic curves of prime order, Proc. of SAC 2005, pp.319-331, 2006.

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

I. F. Blake, V. Kumar-murty, and G. Xu, Refinements of Miller's algorithm for computing the Weil/Tate pairing, Journal of Algorithms, vol.58, issue.2, pp.134-149, 2006.
DOI : 10.1016/j.jalgor.2005.01.009

I. F. Blake, G. Seroussi, and N. P. Smart, Advances in Elliptic Curves Cryptography, 2005.
DOI : 10.1017/CBO9780511546570

D. Boneh and M. K. Franklin, Identity-Based Encryption from the Weil Pairing, SIAM Journal on Computing, vol.32, issue.3, pp.586-615, 2001.
DOI : 10.1137/S0097539701398521
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3708

H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange et al., Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete mathematics and its applications, 2006.

C. Costello, H. Hisil, C. Boyd, J. M. , G. Nieto et al., Faster Pairings on Special Weierstrass Curves, Proc. of Pairing, pp.89-101, 2009.
DOI : 10.1007/11596219_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.6309

C. Costello, T. Lange, and M. Naehrig, Faster Pairing Computations on Curves with High-Degree Twists, proc. of PKC 2010, pp.224-242, 2010.
DOI : 10.1007/978-3-642-13013-7_14

N. El, M. , and C. N. , Finite field multiplication combining AMNS and DFT approach for pairing cryptography, Proc. of ACISP '09, pp.422-436, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00360280

D. Freeman, M. Scott, and E. Teske, A Taxonomy of Pairing-Friendly Elliptic Curves, Journal of Cryptology, vol.2, issue.5, pp.224-280, 2010.
DOI : 10.1007/s00145-009-9048-z

F. Heß, Pairing Lattices, Proc. of Pairing, pp.18-38, 2008.
DOI : 10.1007/978-3-540-85538-5_2

F. Heß, N. P. Smart, and F. Vercauteren, The Eta Pairing Revisited, IEEE Transactions on Information Theory, vol.52, issue.10, pp.4595-4602, 2006.
DOI : 10.1109/TIT.2006.881709

S. Ionica and A. Joux, Another Approach to Pairing Computation in Edwards Coordinates, LNCS, vol.17, issue.4, pp.400-413, 2008.
DOI : 10.1007/s00145-004-0315-8

S. Ionica and A. Joux, Pairing the volcano, Proc. of ANTS-IX, pp.201-218, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00448031

A. Joux, A one round protocol for tripartite Diffie-Hellman Extended abstract in proc, J. Cryptology, vol.17, issue.4, pp.263-276, 2000.

N. Koblitz and A. Menezes, Pairing-Based Cryptography at High Security Levels, IMA Int. Conf. Cryptography and Coding, pp.13-36, 2005.
DOI : 10.1007/11586821_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.9402

X. Lin, C. Zhao, F. Zhang, and Y. Wang, Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.91, issue.9, pp.91-2387, 2008.
DOI : 10.1093/ietfec/e91-a.9.2387

S. Matsuda, N. Kanayama, F. Heß, and E. Okamoto, Optimised versions of the Ate and twisted Ate pairings, IEICE Transactions, issue.7, pp.92-1660, 2009.

S. Victor and . Miller, The Weil pairing, and its efficient calculation, J. Cryptology, vol.17, issue.4, pp.235-261, 2004.

V. Shoup, NTL: a library for doing number theory, 2009.

F. Vercauteren, Optimal Pairings, IEEE Transactions on Information Theory, vol.56, issue.1, pp.455-461, 2009.
DOI : 10.1109/TIT.2009.2034881