Title | ||
---|---|---|
Integer Variable Chi-Based Cross Twisted Ate Pairing And Its Optimization For Barreto-Naehrig Curve |
Abstract | ||
---|---|---|
It is said that the lower bound of the number of iterations of Miller's algorithm for pairing calculation is log(2) r/phi(k), where phi(.) is the Euler's function, r is the group order, and k is the embedding degree. Ate pairing reduced the number of the loops of Miller's algorithm of Tate pairing from left perpendicularlog(2) right perpendicular to left perpendicularlog(2)(t-1)right perpendicular, where t is the Frobenius trace. Recently, it is known to systematically prepare a pairing-friendly elliptic curve whose parameters are given by a polynomial of integer variable "chi." For such a curve, this paper gives integer variable chi-based Ate (Xate) pairing that achieves the lower bound. In the case of the well-known Barreto-Naehrig pairing-friendly curve. it reduces the number of loops to left perpendicularlog(2)chi right perpendicular. Then, this paper optimizes Xate pairing for Barreto-Naehrig curve and shows its efficiency based on some simulation results. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1587/transfun.E92.A.1859 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
Ate pairing, Miller's algorithm | Journal | E92A |
Issue | ISSN | Citations |
8 | 0916-8508 | 0 |
PageRank | References | Authors |
0.34 | 6 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yasuyuki Nogami | 1 | 146 | 52.44 |
Yumi Sakemi | 2 | 48 | 7.49 |
Hidehiro Kato | 3 | 20 | 3.30 |
Masataka Akane | 4 | 32 | 2.51 |
Yoshitaka Morikawa | 5 | 100 | 14.92 |