Paper 2008/280 Original: eprint.iacr.org/2008/280 ↗
FPGA and ASIC Implementations of the $\eta_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. As they rely critically on efficient algorithms and implementations of pairing primitives, the study of hardware accelerators became an active research area. In this paper, we propose two coprocessors for the reduced $\eta_T$ pairing introduced by Barreto {\it et al.} as an alternative means of computing the Tate pairing on supersingular elliptic curves. We prototyped our architectures on FPGAs. According to our place-and-route results, our coprocessors compare favorably with other solutions described in the open literature. We also present the first ASIC implementation of the reduced $\eta_T$ pairing.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2009-06-17: last updated
- 2008-06-24: published
- Short URL
- https://ia.cr/2008/280
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/280,
author = {Jean-Luc Beuchat and Hiroshi Doi and Kaoru Fujita and Atsuo Inomata and Piseth Ith and Akira Kanaoka and Masayoshi Katouno and Masahiro Mambo and Eiji Okamoto and Takeshi Okamoto and Takaaki Shiga and Masaaki Shirase and Ryuji Soga and Tsuyoshi Takagi and Ananda Vithanage and Hiroyasu Yamamoto},
title = {FPGA and ASIC Implementations of the $\eta_T$ Pairing in Characteristic Three},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/280},
year = {2008},
url = {https://eprint.iacr.org/2008/280}
}