Refinements of Miller's Algorithm over Weierstrass Curves Revisited

@article{Le2011RefinementsOM,
  title={Refinements of Miller's Algorithm over Weierstrass Curves Revisited},
  author={Duc-Phong Le and Chao-Liang Liu},
  journal={ArXiv},
  year={2011},
  volume={abs/1103.0337}
}
  • Duc-Phong Le, Chao-Liang Liu
  • Published in Comput. J. 2011
  • Mathematics, Computer Science
  • ArXiv
  • In 1986, Victor Miller described an algorithm for computing the Weil pairing in his unpublished manuscript. This algorithm has then become the core of all pairing-based cryptosystems. Many improvements of the algorithm have been presented. Most of them involve a choice of elliptic curves of a special form to exploit a possible twist during Tate pairing computation. Other improvements involve a reduction of the number of iterations in the Miller's algorithm. For the generic case, Blake, Murty… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-8 OF 8 CITATIONS

    Further refinements of Miller’s algorithm on Edwards curves

    • Duc-Phong Le, Chik How Tan
    • Computer Science, Mathematics
    • Applicable Algebra in Engineering, Communication and Computing
    • 2015
    VIEW 2 EXCERPTS
    CITES METHODS

    Improved Miller’s Algorithm for Computing Pairings on Edwards Curves

    VIEW 2 EXCERPTS
    CITES METHODS & RESULTS

    Speeding up Ate Pairing Computation in Affine Coordinates

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 27 REFERENCES

    Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Refinements of Miller's algorithm for computing the Weil/Tate pairing

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    The Weil Pairing, and Its Efficient Calculation

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    On the Selection of Pairing-Friendly Groups

    VIEW 21 EXCERPTS
    HIGHLY INFLUENTIAL

    Further refinement of pairing computation based on Miller's algorithm

    VIEW 4 EXCERPTS

    Optimal Pairings

    VIEW 2 EXCERPTS

    http://www.gmplib.org/. A Algorithm

    • representation, Blake, Murty, Xu
    • The GNU MP bignum library (accessed
    • 2010
    VIEW 1 EXCERPT