Algorithms and arithmetic operators for computing the ηT pairing in characteristic three

Jean Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, Tsuyoshi Takagi

Research output: Contribution to journalArticle

27 Citations (Scopus)

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]/(x97 + x12 + 2), which compares favorably with other solutions described in the open literature.

Original languageEnglish
Pages (from-to)1454-1468
Number of pages15
JournalIEEE Transactions on Computers
Volume57
Issue number11
DOIs
Publication statusPublished - Oct 22 2008

Fingerprint

Pairing
Mathematical operators
Computing
Operator
Cube root
Hardware Accelerator
Hardware
Cube
Hyperelliptic Curves
Hardware Architecture
Particle accelerators
Inversion
Multiplication
Software
Heart
Coprocessor

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Beuchat, J. L., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., & Takagi, T. (2008). Algorithms and arithmetic operators for computing the ηT pairing in characteristic three. IEEE Transactions on Computers, 57(11), 1454-1468. https://doi.org/10.1109/TC.2008.103

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.

In: IEEE Transactions on Computers, Vol. 57, No. 11, 22.10.2008, p. 1454-1468.

Research output: Contribution to journalArticle

Beuchat, JL, Brisebarre, N, Detrey, J, Okamoto, E, Shirase, M & Takagi, T 2008, 'Algorithms and arithmetic operators for computing the ηT pairing in characteristic three', IEEE Transactions on Computers, vol. 57, no. 11, pp. 1454-1468. https://doi.org/10.1109/TC.2008.103
Beuchat, Jean Luc ; Brisebarre, Nicolas ; Detrey, Jérémie ; Okamoto, Eiji ; Shirase, Masaaki ; Takagi, Tsuyoshi. / Algorithms and arithmetic operators for computing the ηT pairing in characteristic three. In: IEEE Transactions on Computers. 2008 ; Vol. 57, No. 11. pp. 1454-1468.
@article{2f118753c406401f87c76c946645526d,
title = "Algorithms and arithmetic operators for computing the ηT pairing in characteristic three",
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]/(x97 + x12 + 2), which compares favorably with other solutions described in the open literature.",
author = "Beuchat, {Jean Luc} and Nicolas Brisebarre and J{\'e}r{\'e}mie Detrey and Eiji Okamoto and Masaaki Shirase and Tsuyoshi Takagi",
year = "2008",
month = "10",
day = "22",
doi = "10.1109/TC.2008.103",
language = "English",
volume = "57",
pages = "1454--1468",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "11",

}

TY - JOUR

T1 - Algorithms and arithmetic operators for computing the ηT pairing in characteristic three

AU - Beuchat, Jean Luc

AU - Brisebarre, Nicolas

AU - Detrey, Jérémie

AU - Okamoto, Eiji

AU - Shirase, Masaaki

AU - Takagi, Tsuyoshi

PY - 2008/10/22

Y1 - 2008/10/22

N2 - 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]/(x97 + x12 + 2), which compares favorably with other solutions described in the open literature.

AB - 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]/(x97 + x12 + 2), which compares favorably with other solutions described in the open literature.

UR - http://www.scopus.com/inward/record.url?scp=54049118059&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=54049118059&partnerID=8YFLogxK

U2 - 10.1109/TC.2008.103

DO - 10.1109/TC.2008.103

M3 - Article

AN - SCOPUS:54049118059

VL - 57

SP - 1454

EP - 1468

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 11

ER -