International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Further Refinement of Pairing Computation Based on Miller's Algorithm

Authors:
Chao-Liang Liu
Gwoboa Horng
Te-Yu Chen
Download:
URL: http://eprint.iacr.org/2006/106
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2006-21599,
  title={Further Refinement of Pairing Computation Based on Miller's Algorithm},
  booktitle={IACR Eprint archive},
  keywords={foundations / elliptic curve cryptosystem, pairing, Miller's algorithm, Algorithm.},
  url={http://eprint.iacr.org/2006/106},
  note={ gbhorng@cs.nchu.edu.tw and s9056001@cs.nchu.edu.tw 13224 received 16 Mar 2006},
  author={Chao-Liang Liu and Gwoboa Horng and Te-Yu Chen},
  year=2006
}