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
Funding Information:Eunjeong Lee and Hyang-Sook Lee were supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (Grant Number: 2012R1A2A1A03006706 ).
Publisher Copyright:
© 2014 Elsevier Inc. All rights reserved.
Keywords
- Cyclotomic polynomial
- Elliptic curve
- Pairing-based cryptosystem