Improved Miller's Algorithm for Computing Pairings on Edwards Curves

Abstract

Since Edwards curves were introduced to elliptic curve cryptography by Bernstein and Lange in 2007, they have received a lot of attention due to their very fast group law operation. Pairing computation on such curves is slightly slower than on Weierstrass curves. However, in some pairing-based cryptosystems, they might require a number of scalar… (More)
DOI: 10.1109/TC.2013.125

Topics

4 Figures and Tables

Cite this paper

@article{Le2014ImprovedMA, title={Improved Miller's Algorithm for Computing Pairings on Edwards Curves}, author={Duc-Phong Le and Chik How Tan}, journal={IEEE Trans. Computers}, year={2014}, volume={63}, pages={2626-2632} }