## CryptoDB

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

Authors: Ian Blake Kumar Murty Guangwu Xu URL: http://eprint.iacr.org/2004/065 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2004-12039,
title={Refinements of Miller's Algorithm for Computing Weil/Tate Pairing},
booktitle={IACR Eprint archive},
keywords={foundations / algorithm, elliptic curve,  cryptography, Weil/Tate pairing},
url={http://eprint.iacr.org/2004/065},
note={ gxu@comm.utoronto.ca 12475 received 27 Feb 2004},
author={Ian Blake and Kumar Murty and Guangwu Xu},
year=2004
}