Name
Abstract | ||
|---|---|---|
In implementing an efficient pairing calculation, it is said that the lower bound of the number of iterations of Miller's algorithm is log(2)r/phi(k), where phi(.) is the Euler's function. Ate pairing reduced the number of the loops of Miller's algorithm of Tate pairing from left perpendicularlog(2)rright perpendicular to left perpendicularlog(2)(t - 1)right perpendicular. Recently, it is known to systematically prepare a pairing-friendly elliptic curve whose parameters are given by a polynomial of integer variable "chi". For the curve, this paper gives integer variable chi-based Ate pairing that achieves the lower bound by reducing it to left perpendicularlog(2) chi right perpendicular. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85538-5_13 | PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008 |
Keywords | DocType | Volume |
Ate pairing, Miller's algorithm | Conference | 5209 |
ISSN | Citations | PageRank |
0302-9743 | 9 | 0.73 |
References | Authors | |
1 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasuyuki Nogami | 1 | 146 | 52.44 |
| Masataka Akane | 2 | 32 | 2.51 |
| Yumi Sakemi | 3 | 48 | 7.49 |
| Hidehiro Katou | 4 | 9 | 1.41 |
| Yoshitaka Morikawa | 5 | 100 | 14.92 |