A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Refinements of Miller's algorithm for computing the Weil/Tate pairing
2006
Journal of Algorithms
In this paper we propose three refinements to Miller's algorithm for computing Weil/Tate Pairing. The first one is an overall improvement and achieves its optimal behavior if the binary expansion of the involved integer has more zeros. If more ones are presented in the binary expansion, second improvement is suggested. The third one is especially efficient in the case base three. We also have some performance analysis. keywords: algorithm, elliptic curve, cryptography, Weil/Tate pairing Recent
doi:10.1016/j.jalgor.2005.01.009
fatcat:sahhckccpvc5rpgzkaii7ddb3a