Paper 2008/115

A Comparison Between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, and Francisco Rodríguez-Henríquez


In this article we propose a study of the modified Tate pairing in characteristics two and three. Starting from the $\eta_T$ pairing introduced by Barreto {\em et al.} (Des Codes Crypt, 2007), we detail various algorithmic improvements in the case of characteristic two. As far as characteristic three is concerned, we refer to the survey by Beuchat {\em et al.} (ePrint 2007-417). We then show how to get back to the modified Tate pairing at almost no extra cost. Finally, we explore the trade-offs involved in the hardware implementation of this pairing for both characteristics two and three. From our experiments, characteristic three appears to have a slight advantage over characteristic two.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Tate pairing$\eta_T$ pairinghardware acceleratorFPGAfinite field arithmetic
Contact author(s)
beuchat @ risk tsukuba ac jp
2008-03-17: revised
2008-03-17: received
See all versions
Short URL
Creative Commons Attribution


      author = {Jean-Luc Beuchat and Nicolas Brisebarre and Jérémie Detrey and Eiji Okamoto and Francisco Rodríguez-Henríquez},
      title = {A Comparison Between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$},
      howpublished = {Cryptology ePrint Archive, Paper 2008/115},
      year = {2008},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.