Loading...
Please wait, while we are loading the content...
Similar Documents
Algorithms and arithmetic operators for computing the ηt pairing in characteristic three (2008)
| Content Provider | CiteSeerX |
|---|---|
| Author | Beuchat, Jean-Luc Brisebarre, Nicolas Detrey, Jérémie Okamoto, Eiji Shirase, Masaaki Takagi, Tsuyoshi |
| Abstract | Abstract — 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 F3m. 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 F397 given by F3[x]/(x 97 + x 12 + 2), which compares favorably with other solutions described in the open literature. Index Terms — ηT pairing, finite field arithmetic, elliptic curve, hardware accelerator, FPGA. |
| File Format | |
| Journal | IEEE Trans. Comput |
| Language | English |
| Publisher Date | 2008-01-01 |
| Access Restriction | Open |
| Subject Keyword | Arithmetic Operator Elliptic Curve Hardware Accelerator Index Term Pairing Finite Field Several Algorithm Constructive Cryptographic Application Cube Root Extraction Compact Coprocessor Hardware Architecture Algorithm Involve Addition Software Implementation Unified Arithmetic Operator Active Research Area Open Literature Field F397 |
| Content Type | Text |
| Resource Type | Article |
