Abstract
Pairings on elliptic curves play an important role in cryptography. We provide an explicit formula for vectors of polynomials describing optimal ate pairings over cyclotomic family of elliptic curves. The explicit formula is simple in that it only involves partitioning a certain cyclotomic polynomial. The simplicity of the formula allows us to analyze the sparsity of the vector.
Original language | English |
---|---|
Pages (from-to) | 45-74 |
Number of pages | 30 |
Journal | Finite Fields and their Applications |
Volume | 34 |
DOIs | |
State | Published - Jul 2015 |
Bibliographical note
Publisher Copyright:© 2014 Elsevier Inc. All rights reserved.
Keywords
- Cyclotomic polynomial
- Elliptic curve
- Pairing-based cryptosystem