[Resource Topic] 2007/091: Arithmetic Operators for Pairing-Based Cryptography

Welcome to the resource topic for 2007/091

Arithmetic Operators for Pairing-Based Cryptography

Authors: Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto


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.

ePrint: https://eprint.iacr.org/2007/091

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .