2024-03-28T10:23:25Z
https://tsukuba.repo.nii.ac.jp/oai
oai:tsukuba.repo.nii.ac.jp:00016900
2023-07-12T06:20:35Z
152:822
2871:2874:819
3:62:5591:598
Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
ブシヤ, ジャン ルク
岡本, 栄司
Beuchat, Jean-Luc
Brisebarre, Nicolas
Detrey, Jérémie
Okamoto, Eiji
Shirase, Masaaki
Takagi, Tsuyoshi
© 2008 IEEE
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.
Institute of Electrical and Electronics Engineers
2008-11
eng
journal article
http://hdl.handle.net/2241/100788
https://tsukuba.repo.nii.ac.jp/records/16900
10.1109/TC.2008.103
0018-9340
AA00667762
IEEE transactions on computers
57
11
1454
1468
https://tsukuba.repo.nii.ac.jp/record/16900/files/IEEETC_57-11.pdf
application/pdf
2.4 MB
2013-12-19