### Refinements of Miller's Algorithm for Computing Weil/Tate Pairing

Ian Blake, Kumar Murty, and Guangwu Xu

##### Abstract

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.

Available format(s)
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
algorithmelliptic curvecryptographyWeilTate pairing
Contact author(s)
gxu @ comm utoronto ca
History
Short URL
https://ia.cr/2004/065

CC BY

BibTeX

@misc{cryptoeprint:2004/065,
author = {Ian Blake and Kumar Murty and Guangwu Xu},
title = {Refinements of Miller's Algorithm for Computing Weil/Tate Pairing},
howpublished = {Cryptology ePrint Archive, Paper 2004/065},
year = {2004},
note = {\url{https://eprint.iacr.org/2004/065}},
url = {https://eprint.iacr.org/2004/065}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.