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

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

Research output: Contribution to journalJournal articleResearchpeer-review

6 Citations (Scopus)

Abstract

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 multi-exponentiation of relatively large sequences of exponents with a size of up to 26 bits.
Original languageEnglish
JournalFinite Fields and Their Applications
Volume29
Pages (from-to)1-17
Number of pages17
ISSN1071-5797
DOIs
Publication statusPublished - 2014

Fingerprint

Dive into the research topics of 'Low-cost addition-subtraction sequences for the final exponentiation computation in pairings'. Together they form a unique fingerprint.

Cite this