Paper 2004/065 Original: eprint.iacr.org/2004/065 ↗
Refinements of Miller's Algorithm for Computing Weil/Tate Pairing
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2004-02-29: last updated
- 2004-02-29: published
- Short URL
- https://ia.cr/2004/065
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2004/065}
}