Welcome to the resource topic for 2004/065
Refinements of Miller’s Algorithm for Computing Weil/Tate Pairing
Authors: Ian Blake, Kumar Murty, Guangwu XuAbstract:
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.
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .