11 search results - page 1 / 3 » Computing the Ate Pairing on Elliptic Curves with Embedding ... |
IEICET
2008
13 years 4 months ago
2008
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
TIT
2010
12 years 11 months 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...
IJISEC
2008
13 years 4 months ago
2008
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with ...
PAIRING
2010
Springer
13 years 2 months ago
2010
Springer
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...