loading...
An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation
Montpellier, France June 25-June 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2007.1018th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jean-Luc Beuchat, University of Tsukuba, Japan
Masaaki Shirase, Future University-Hakodate, Japan
Tsuyoshi Takagi, Future University-Hakodate, Japan
Eiji Okamoto, University of Tsukuba, Japan
In this paper, we propose a modified ?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.
Index Terms:
Tate pairing, nT pairing, characteristic three, elliptic curve, hardware accelerator, FPGA.
Citation:
Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto, "An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation," arith, pp.97-104, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.