Paper 2006/474 Original: eprint.iacr.org/2006/474 ↗
Speeding up the Bilinear Pairings Computation on Curves with Automorphisms
Abstract
In this paper we present an algorithm for computing the bilinear pairings on a family of non-supersingular elliptic curves with non-trivial automorphisms. We obtain a short iteration loop in Miller's algorithm using non-trivial efficient automorphisms. The proposed algorithm is as efficient as Scott's algorithm in [12].
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2007-04-13: last updated
- 2006-12-24: published
- Short URL
- https://ia.cr/2006/474
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/474,
author = {Chang-An Zhao and Fangguo Zhang and Jiwu Huang},
title = {Speeding up the Bilinear Pairings Computation on Curves with Automorphisms},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/474},
year = {2006},
url = {https://eprint.iacr.org/2006/474}
}