Name
Abstract | ||
|---|---|---|
When implementing an efficient pairing calculation over KSS curves with embedding degree 18 and order r, the lower bound of the number of loop iterations of Miller's algorithm is $\frac{1}{6}\lfloor\log_2r\rfloor$. But the twisted Ate pairing requires $\frac{1}{2}\lfloor\log_2r\rfloor$ loop iterations, and thus is slower than the optimal Ate pairing which achieves the lower bound. This paper proposes an improved twisted Ate pairing and uses multi-pairing techniques to compute it. Therefore, the number of loop iterations in Miller's algorithm for the new pairing achieves the lower bound and it becomes faster than the original twisted Ate pairing by 30%. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-36334-4_3 | Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography |
Keywords | Field | DocType |
embedding degree,new pairing,KSS curve,loop iteration,efficient pairing calculation | Combinatorics,Embedding,Pairing-based cryptography,Upper and lower bounds,Pairing,Mathematics | Conference |
Citations | PageRank | References |
0 | 0.34 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shan Chen | 1 | 0 | 0.68 |
| Kunpeng Wang | 2 | 41 | 11.79 |
| Dongdai Lin | 3 | 762 | 98.54 |