P. S. Barreto, H. Y. Kim, B. Lynn, and M. Scott, Efficient Algorithms for Pairing-Based Cryptosystems, Advances in Cryptology ? CRYPTO 2002, number 2442 in Lecture Notes in Computer Science, pp.354-368, 2002.
DOI : 10.1007/3-540-45708-9_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.3363

J. Beuchat, N. Brisebarre, J. Detrey, and E. Okamoto, Arithmetic Operators for Pairing-Based Cryptography, Proceedings of CHES 2007, number 4727 in Lecture Notes in Computer Science, pp.239-255, 2007.
DOI : 10.1007/978-3-540-74735-2_17
URL : https://hal.archives-ouvertes.fr/ensl-00137918

J. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto, M. Shirase et al., Algorithms and arithmetic operators for computing the ?T pairing in characteristic three, Cryptology ePrint Archive Report, vol.417, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00423993

J. Beuchat, M. Shirase, T. Takagi, and E. Okamoto, An algorithm for the ?T pairing calculation in characteristic three and its hardware implementation, Proceedings of the 18th IEEE Symposium on Computer Arithmetic, pp.97-104, 2007.

I. Duursma and H. S. Lee, Tate Pairing Implementation for Hyperelliptic Curves y 2 = x p ??? x + d, Advances in Cryptology ? ASIACRYPT 2003, number 2894 in Lecture Notes in Computer Science, pp.111-123, 2003.
DOI : 10.1007/978-3-540-40061-5_7

K. Fong, D. Hankerson, J. López, and A. Menezes, Field inversion and point halving revisited, IEEE Transactions on Computers, vol.53, issue.8, pp.1047-1059, 2004.
DOI : 10.1109/TC.2004.43

G. Frey and H. Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves, Mathematics of Computation, vol.62, issue.206, pp.865-874, 1994.

S. D. Galbraith, K. Harrison, and D. Soldera, Implementing the Tate Pairing, Algorithmic Number Theory ? ANTS V, number 2369 in Lecture Notes in Computer Science, pp.324-337, 2002.
DOI : 10.1007/3-540-45455-1_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.5919

P. Grabher and D. Page, Hardware Acceleration of the Tate Pairing in Characteristic Three, Cryptographic Hardware and Embedded Systems ? CHES 2005, number 3659 in Lecture Notes in Computer Science, pp.398-411, 2005.
DOI : 10.1007/11545262_29

R. Granger, D. Page, and N. P. Smart, High Security Pairing-Based Cryptography Revisited, Algorithmic Number Theory ? ANTS VII, number 4076 in Lecture Notes in Computer Science, pp.480-494, 2006.
DOI : 10.1007/11792086_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.1142

R. Granger, D. Page, and M. Stam, On Small Characteristic Algebraic Tori in Pairing-Based Cryptography, LMS Journal of Computation and Mathematics, vol.3076, pp.64-85, 2006.
DOI : 10.1007/3-540-45708-9_22

F. Hess, N. 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

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

J. Jiang, Bilinear pairing (Eta T Pairing) IP core, 2007.

A. Joux, A one round protocol for tripartite Diffie-Hellman, Algorithmic Number Theory ? ANTS IV, number 1838 in Lecture Notes in Computer Science, pp.385-394, 2000.

M. Keller, T. Kerins, F. Crowe, and W. P. Marnane, FPGA Implementation of a GF(2 m ) Tate Pairing Architecture, International Workshop on Applied Reconfigurable Computing number 3985 in Lecture Notes in Computer Science, pp.358-369, 2006.
DOI : 10.1007/11802839_44

M. Keller, T. Kerins, and W. P. Marnane, FPGA implementation of a GF(2/sup 4M/) multiplier for use in pairing based cryptosystems, International Conference on Field Programmable Logic and Applications, 2005., pp.594-597, 2005.
DOI : 10.1109/FPL.2005.1515793

M. Keller, R. Ronan, W. P. Marnane, and C. Murphy, Hardware architectures for the Tate pairing over GF(2m), Computers & Electrical Engineering, vol.33, issue.5-6, pp.5-6392, 2007.
DOI : 10.1016/j.compeleceng.2007.05.002

T. Kerins, W. P. Marnane, E. M. Popovici, and P. S. Barreto, Efficient Hardware for the Tate Pairing Calculation in Characteristic Three, Cryptographic Hardware and Embedded Systems ? CHES 2005, number 3659 in Lecture Notes in Computer Science, pp.412-426, 2005.
DOI : 10.1007/11545262_30

N. Koblitz and A. Menezes, Pairing-Based Cryptography at High Security Levels, Cryptography and Coding, number 3796 in Lecture Notes in Computer Science, pp.13-36, 2005.
DOI : 10.1007/11586821_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.9402

S. Kwon, Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields, Information Security and Privacy ? ACISP 2005, pp.134-145, 2005.
DOI : 10.1007/11506157_12

A. Menezes, T. Okamoto, and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory, vol.39, issue.5, pp.1639-1646, 1986.
DOI : 10.1109/18.259647

V. S. Miller, The Weil Pairing, and Its Efficient Calculation, Journal of Cryptology, vol.17, issue.4, pp.235-261, 2004.
DOI : 10.1007/s00145-004-0315-8

S. Mitsunari, R. Sakai, and M. Kasahara, A new traitor tracing, IEICE Trans. Fundamentals, issue.2, pp.85-481, 2002.

F. Rodríguez-henríquez, G. Morales-luna, and J. López, Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials, IEEE Transactions on Computers, vol.57, issue.4, pp.472-480, 2008.
DOI : 10.1109/TC.2007.70822

R. Ronan, C. Murphy, T. Kerins, C. Eigeartaigh, P. S. Barreto et al., A flexible processor for the characteristic 3 ??<SUB align=right>T pairing, Proceedings of the IEEE International Conference on Field Programmable Technology ? FPT 2006, pp.79-88, 2006.
DOI : 10.1504/IJHPSA.2007.015393

R. Sakai, K. Ohgishi, and M. Kasahara, Cryptosystems based on pairing, Symposium on Cryptography and Information Security (SCIS2000), pp.26-28, 2000.

M. Scott, Optimal irreducible polynomials for GF(2 m ) arithmetic. Cryptology ePrint Archive, Report, 2007.

C. Shu, S. Kwon, and K. Gaj, FPGA accelerated tate pairing based cryptosystems over binary fields, 2006 IEEE International Conference on Field Programmable Technology, pp.173-180, 2006.
DOI : 10.1109/FPT.2006.270309

L. Song and K. K. Parhi, Low energy digit-serial/parallel finite field multipliers, The Journal of VLSI Signal Processing, vol.19, issue.2, pp.149-166, 1998.
DOI : 10.1023/A:1008013818413