Paper 2015/276

An Improvment of the Elliptic Net Algorithm

Binglong Chen and Chang-An Zhao

Abstract

In this paper we propose a modified Elliptic Net algorithm to compute pairings. By reducing the number of the intermediate variables which should be updated in the iteration loop of the Elliptic Net algorithm, we speed up the computation of pairings. Experimental results show that the proposed method is about $14\%$ faster than the original Elliptic Net algorithm on certain supersingular elliptic curves with embedding degree $two$.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. MINOR revision.
Keywords
Pairing based cryptographyElliptic curveTate pairingElliptic Net algorithm
Contact author(s)
zhaochan3 @ mail sysu edu cn
History
2015-03-25: received
Short URL
https://ia.cr/2015/276
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/276,
      author = {Binglong Chen and Chang-An Zhao},
      title = {An Improvment of the Elliptic Net Algorithm},
      howpublished = {Cryptology ePrint Archive, Paper 2015/276},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/276}},
      url = {https://eprint.iacr.org/2015/276}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.