A. Barenghi, G. Bertoni, L. Breveglieri, and G. Pelosi, A FPGA Coprocessor for the Cryptographic Tate Pairing over Fp, Fifth International Conference on Information Technology: New Generations (itng 2008), 2008.
DOI : 10.1109/ITNG.2008.260

P. S. Barreto, A note on efficient computation of cube roots in characteristic 3, Cryptology ePrint Archive Report, vol.305, 2004.

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

P. S. Barreto and M. Naehrig, Pairing-Friendly Elliptic Curves of Prime Order, Selected Areas in Cryptography ? SAC 2005, pp.319-331, 2006.
DOI : 10.1007/11693383_22

G. Bertoni, L. Breveglieri, P. Fragneto, and G. Pelosi, Parallel Hardware Architectures for the Cryptographic Tate Pairing, Third International Conference on Information Technology: New Generations (ITNG'06), 2006.
DOI : 10.1109/ITNG.2006.107
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.3834

J. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto, and F. Rodríguez-henríquez, A comparison between hardware accelerators for the modified tate pairing over F2m and F3m, Pairing-Based Cryptography ? Pairing 2008, number 5209 in Lecture Notes in Computer Science, pp.297-315, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00423977

J. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto, M. Shirase et al., Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three, IEEE Transactions on Computers, vol.57, issue.11, pp.1454-1468, 2008.
DOI : 10.1109/TC.2008.103

J. Beuchat, N. Brisebarre, M. Shirase, T. Takagi, and E. Okamoto, A coprocessor for the final exponentiation of the ?T pairing in characteristic three, Proceedings of Waifi 2007, number 4547 in Lecture Notes in Computer Science, pp.25-39, 2007.

D. Boneh and M. Franklin, Identity-based encryption from the Weil pairing, Advances in Cryptology ? CRYPTO 2001, number 2139 in Lecture Notes in Computer Science, pp.213-229, 2001.

D. Boneh, C. Gentry, and B. Waters, Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys, Advances in Cryptology ? CRYPTO 2005, number 3621 in Lecture Notes in Computer Science, pp.258-275, 2005.
DOI : 10.1007/11535218_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.5787

D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, Advances in Cryptology ? ASIACRYPT 2001, number 2248 in Lecture Notes in Computer Science, pp.514-532, 2001.

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

H. Fan, J. Sun, M. Gu, and K. Lam, Overlap-free Karatsuba???Ofman polynomial multiplication algorithms, IET Information Security, vol.4, issue.1, 2007.
DOI : 10.1049/iet-ifs.2009.0039

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

E. Gorla, C. Puttmann, and J. Shokrollahi, Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$, Selected Areas in Cryptography ? SAC 2007, number 4876 in Lecture Notes in Computer Science, pp.173-183, 2007.
DOI : 10.1007/978-3-540-77360-3_12

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

D. Hankerson, A. Menezes, and M. Scott, Identity-Based Cryptography, Software Implementation of Pairings), pp.188-206, 2009.

G. Hanrot and P. Zimmermann, A long note on Mulders??? short product, Journal of Symbolic Computation, vol.37, issue.3, pp.391-401, 2004.
DOI : 10.1016/j.jsc.2003.03.001
URL : https://hal.archives-ouvertes.fr/inria-00071931

F. Hess, Pairing Lattices, Pairing- Based Cryptography ? Pairing 2008, number 5209 in Lecture Notes in Computer Science, pp.18-38, 2008.
DOI : 10.1007/978-3-540-85538-5_2

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

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.

D. Kammler, D. Zhang, P. Schwabe, H. Scharwaechter, M. Langenberg et al., Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves, Report, p.56, 2009.
DOI : 10.1007/978-3-642-04138-9_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.5089

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, 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

G. Kömürcü and E. Sava¸ssava¸s, An efficient hardware implementation of the Tate pairing in characteristic three, Proceedings of the Third International Conference on Systems ? ICONS 2008, pp.23-28, 2008.

H. Li, J. Huang, P. Sweany, and D. Huang, FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field, Journal of Systems Architecture, vol.54, issue.12, pp.1077-1088, 2008.
DOI : 10.1016/j.sysarc.2008.04.012

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, A fast implementation of ?T pairing in characteristic three on Intel Core 2 Duo processor, Cryptology ePrint Archive Report, p.32, 2009.

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

R. Ronan, C. Murphy, T. Kerins, C. Eigeartaigh, P. S. Barreto-40 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.

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

F. Vercauteren, Optimal pairings. Cryptology ePrint Archive, Report, issue.096, 2008.
DOI : 10.1109/tit.2009.2034881

L. C. Washington, Elliptic Curves ? Number Theory and Cryptography, 2008.