89 search results - page 2 / 18 » A note on the Ate pairing |
TIT
2010
13 years 4 days ago
2010
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
LATINCRYPT
2010
13 years 3 months ago
2010
Abstract. This paper presents new software speed records for the computation of cryptographic pairings. More specifically, we present details of an implementation which computes t...
CHES
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations...
AFRICACRYPT
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper we provide explicit formulæ to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation metho...
PAIRING
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we describe an efficient implementation of the Tate and Ate pairings using Barreto-Naehrig pairing-friendly curves, on both a standard 32-bit PC and on a 32-bit smart...