Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

ECC Algorithms

A Remark on Implementing the Weil Pairing

Cheol Min ParkContact Information, Myung Hwan KimContact Information and Moti YungContact Information

(1)  ISaC and Department of Mathematical Sciences, Seoul National University, Korea
(2)  RSA Labs and Department of Computer Science, Columbia University, USA
Abstract
We propose an improved implementation of modified Weil pairings. By reduction of operations in the extension field to those in the base field, we can save some operations in the extension field when computing a modified Weil pairing. In particular, computing e (P,φ(P)) is the same as computing the Tate pairing without the final powering. So we can save about 50% of time for computing e (P,φ(P)) compared with the standard Miller’s algorithm.
Keywords: Pairing-based cryptosystem, Weil pairing, modified Weil pairing, separable endomorphism, distortion map.

Contact Information Cheol Min Park
Email: mpcm@math.snu.ac.kr

Contact Information Myung Hwan Kim
Email: mhkim@math.snu.ac.kr

Contact Information Moti Yung
Email: moti@cs.columbia.edu
Fulltext Preview (Small, Large)
Image of the first page of the fulltext


Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.113 • Server: mpweb19
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)