Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
verfasst von : Jean-Luc Beuchat, Jorge E. González-Díaz, Shigeo Mitsunari, Eiji Okamoto, Francisco Rodríguez-Henríquez, Tadanori Teruya
Erschienen in: Pairing-Based Cryptography - Pairing 2010
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
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the optimal ate pairing over a 254-bit prime field
$\mathbb{F}_{p}$
, in just 2.33 million of clock cycles on a single core of an Intel Core i7 2.8GHz processor, which implies that the pairing computation takes 0.832msec. We are able to achieve this performance by a careful implementation of the base field arithmetic through the usage of the customary Montgomery multiplier for prime fields. The prime field is constructed via the Barreto–Naehrig polynomial parametrization of the prime
p
given as,
p
= 36
t
4
+ 36
t
3
+ 24
t
2
+ 6
t
+ 1, with
t
= 2
62
− 2
54
+ 2
44
. This selection of
t
allows us to obtain important savings for both the Miller loop as well as the final exponentiation steps of the optimal ate pairing.