TY - JOUR
T1 - Low-cost addition-subtraction sequences for the final exponentiation in pairings
AU - Guzmán-Trampe, Juan E.
AU - Cruz-Cortés, Nareli
AU - Dominguez Perez, Luis J.
AU - Ortiz-Arroyo, Daniel
AU - Rodríguez-Henríquez, Francisco
N1 - Funding Information:
The authors acknowledge partial support from the Consejo Nacional de Ciencia y Tecnología project 132073 .
PY - 2014/9
Y1 - 2014/9
N2 - In this paper, we address the problem of finding low cost addition-subtraction sequences for situations where a doubling step is significantly cheaper than a non-doubling one. One application of this setting appears in the computation of the final exponentiation step of the reduced Tate pairing defined on ordinary elliptic curves. In particular, we report efficient addition-subtraction sequences for the Kachisa-Schaefer-Scott family of pairing-friendly elliptic curves, whose parameters involve computing the ulti-exponentiation of relatively large sequences of exponents with a size of up to 26 bits.
AB - In this paper, we address the problem of finding low cost addition-subtraction sequences for situations where a doubling step is significantly cheaper than a non-doubling one. One application of this setting appears in the computation of the final exponentiation step of the reduced Tate pairing defined on ordinary elliptic curves. In particular, we report efficient addition-subtraction sequences for the Kachisa-Schaefer-Scott family of pairing-friendly elliptic curves, whose parameters involve computing the ulti-exponentiation of relatively large sequences of exponents with a size of up to 26 bits.
KW - Addition-subtraction sequences
KW - Final exponentiation
KW - Pairings
UR - http://www.scopus.com/inward/record.url?scp=84896949179&partnerID=8YFLogxK
U2 - 10.1016/j.ffa.2014.02.009
DO - 10.1016/j.ffa.2014.02.009
M3 - Artículo
SN - 1071-5797
VL - 29
SP - 1
EP - 17
JO - Finite Fields and their Applications
JF - Finite Fields and their Applications
ER -