Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Arithmetic Operators for Pairing-Based Cryptography
verfasst von : Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto
Erschienen in: Cryptographic Hardware and Embedded Systems - CHES 2007
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
$\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.