| Título |
Low-cost addition-subtraction sequences for the final exponentiation computation in pairings |
| Tipo |
Revista |
| Sub-tipo |
JCR |
| Descripción |
Finite Fields and Their Applications, Elsevier |
| 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 multi-exponentiation of relatively large sequences of exponents with a size of up to 26 bits. |
| Observaciones |
Received 5 October 2013, Revised 19 February 2014, Accepted 21 February 2014
DOI: 10.1016/j.ffa.2014.02.009 |
| Lugar |
|
| País |
Estados Unidos |
| No. de páginas |
1-17 |
| Vol. / Cap. |
Vol. 29 |
| Inicio |
2014-02-21 |
| Fin |
|
| ISBN/ISSN |
|
