@article{oai:tsukuba.repo.nii.ac.jp:00016900,
 author = {ブシヤ, ジャン ルク and 岡本, 栄司 and Beuchat, Jean-Luc and Brisebarre, Nicolas and Detrey, Jérémie and Okamoto, Eiji and Shirase, Masaaki and Takagi, Tsuyoshi},
 issue = {11},
 journal = {IEEE transactions on computers},
 month = {Nov},
 note = {application/pdf, 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.},
 pages = {1454--1468},
 title = {Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three},
 volume = {57},
 year = {2008}
}