Welcome to the resource topic for 2006/106
Title:
Further Refinement of Pairing Computation Based on Miller’s Algorithm
Authors: Chao-Liang Liu, Gwoboa Horng, Te-Yu Chen
Abstract:In 2006, Blake, Murty and Xu proposed three refinements to
Miller’s algorithm for computing Weil/Tate Pairings. In this paper
we extend their work and propose a generalized algorithm, which
integrates their first two algorithms. Our approach is to
pre-organize the binary representation of the involved integer to
the best cases of Blake’s algorithms. Further, our refinement is
more suitable for Solinas numbers than theirs. We analyze our
algorithm and show that our refinement can perform better than the
original algorithms.
ePrint: https://eprint.iacr.org/2006/106
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 .