Cryptology ePrint Archive: Report 2006/106

Further Refinement of Pairing Computation Based on Miller's Algorithm

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

Category / Keywords: foundations / elliptic curve cryptosystem, pairing, Miller's algorithm, Algorithm.

Date: received 16 Mar 2006

Contact author: gbhorng at cs nchu edu tw and s9056001@cs nchu edu tw

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20060319:211009 (All versions of this report)

Discussion forum: Show discussion | Start new discussion