Paper 2006/327

An Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three and its Hardware Implementation

Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, and Eiji Okamoto

Abstract

In this paper, we propose a modified $\eta_T$ pairing algorithm in characteristic three which does not need any cube root extraction. We also discuss its implementation on a low cost platform which hosts an Altera Cyclone~II FPGA device. Our pairing accelerator is ten times faster than previous known FPGA implementations in characteristic three.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
Tate pairing$\eta_T$ pairingcharacteristic threeelliptic curvehardware acceleratorFPGA
Contact author(s)
beuchat @ risk tsukuba ac jp
History
2007-03-23: last of 2 revisions
2006-09-28: received
See all versions
Short URL
https://ia.cr/2006/327
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/327,
      author = {Jean-Luc Beuchat and Masaaki Shirase and Tsuyoshi Takagi and Eiji Okamoto},
      title = {An Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three and its Hardware Implementation},
      howpublished = {Cryptology ePrint Archive, Paper 2006/327},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/327}},
      url = {https://eprint.iacr.org/2006/327}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.