Issue No. 11 - November (2008 vol. 57)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.103
Jean-Luc Beuchat , University of Tsukuba, Tsukuba
Nicolas Brisebarre , ENS Lyon, Lyon
Jérémie Detrey , B-it, Bonn
Eiji Okamoto , University of Tsukuba, Tsukuba
Masaaki Shirase , Future University, Hakodate
Tsuyoshi Takagi , Future University, Hakodate
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we discuss several algorithms to compute the ηT pairing in characteristic three and suggest further improvements. These algorithms involve addition, multiplication, cubing, inversion, and sometimes cube root extraction over GF(3m). We propose a hardware accelerator based on a unified arithmetic operator able to perform the operations required by a given algorithm. We describe the implementation of a compact coprocessor for the field GF(397) given by GF(3)[x]/(x97+x12+2), which compares favorably with other solutions described in the open literature.
Eta_T pairing, elliptic curve, finite field arithmetic, hardware accelerator, FPGA
N. Brisebarre, E. Okamoto, M. Shirase, J. Detrey, J. Beuchat and T. Takagi, "Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three," in IEEE Transactions on Computers, vol. 57, no. , pp. 1454-1468, 2008.