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. © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
Park, C. M., Kim, M. H., & Yung, M. (2005). A remark on implementing the weil pairing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3822 LNCS, pp. 313–323). Springer Verlag. https://doi.org/10.1007/11599548_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
