Arithmetic Operators for Pairing-Based Cryptography

Jean-Luc Beuchat (1) , Nicolas Brisebarre (1) , Jérémie Detrey (1) , Eiji Okamoto (1)

1 LIP - Laboratoire de l'Informatique du Parallélisme

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 ηT pairing over F3[x]/(x97 + x12 + 2). Our architecture is based on a unified arithmetic operator which performs addition, multiplication, and cubing over F397. 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.

Mots clés: Elliptic curve; FPGA; Finite field arithmetic; Hardware accelerator; Pairing

Domaines: Informatique [cs]

Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto. Arithmetic Operators for Pairing-Based Cryptography. [Research Report] LIP RR-2007-13, Laboratoire de l'informatique du parallélisme. 2007, 2+16p. ⟨hal-02102042⟩