Paper 2006/106

Further Refinement of Pairing Computation Based on Miller's Algorithm

Chao-Liang Liu, Gwoboa Horng, and 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.

Metadata
Available format(s)
PDF PS
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
elliptic curve cryptosystempairingMiller's algorithmAlgorithm.
Contact author(s)
gbhorng @ cs nchu edu tw
s9056001 @ cs nchu edu tw
History
2006-03-19: received
Short URL
https://ia.cr/2006/106
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/106,
      author = {Chao-Liang Liu and Gwoboa Horng and Te-Yu Chen},
      title = {Further Refinement of Pairing Computation Based on Miller's Algorithm},
      howpublished = {Cryptology ePrint Archive, Paper 2006/106},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/106}},
      url = {https://eprint.iacr.org/2006/106}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.