Paper 2007/091
Arithmetic Operators for Pairing-Based Cryptography
Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, and Eiji Okamoto
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 first study an accelerator for the $\eta_T$ pairing over $\mathbb{F}_3[x]/(x^{97}+x^{12}+2)$. Our architecture is based on a unified arithmetic operator which performs addition, multiplication, and cubing over $\mathbb{F}_{3^{97}}$. This design methodology allows us to design a compact coprocessor ($1888$ slices on a Virtex-II Pro~$4$ FPGA) which compares favorably with other solutions described in the open literature. We then describe ways to extend our approach to any characteristic and any extension field.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Submitted to CHES 2007
- Keywords
- $\eta_T$ pairingfinite field arithmeticelliptic curvehardware acceleratorFPGA
- Contact author(s)
- beuchat @ risk tsukuba ac jp
- History
- 2007-06-03: last of 4 revisions
- 2007-03-22: received
- See all versions
- Short URL
- https://ia.cr/2007/091
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/091,
author = {Jean-Luc Beuchat and Nicolas Brisebarre and Jérémie Detrey and Eiji Okamoto},
title = {Arithmetic Operators for Pairing-Based Cryptography},
howpublished = {Cryptology ePrint Archive, Paper 2007/091},
year = {2007},
note = {\url{https://eprint.iacr.org/2007/091}},
url = {https://eprint.iacr.org/2007/091}
}
