Low-cost addition-subtraction sequences for the final exponentiation in pairings

Juan E. Guzmán-Trampe, Nareli Cruz-Cortés, Luis J. Dominguez Perez, Daniel Ortiz-Arroyo, Francisco Rodríguez-Henríquez

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

6 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Páginas (desde-hasta)1-17
Número de páginas17
PublicaciónFinite Fields and their Applications
Volumen29
DOI
EstadoPublicada - sep. 2014

Huella

Profundice en los temas de investigación de 'Low-cost addition-subtraction sequences for the final exponentiation in pairings'. En conjunto forman una huella única.

Citar esto