On compressible pairings and their computation

M. Naehrig; P.S.L.M. Barreto; P. Schwabe

doi:10.1007/978-3-540-68164-9_25

On compressible pairings and their computation

M. Naehrig, P.S.L.M. Barreto, P. Schwabe

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

23 Citations (Scopus)

Abstract

In this paper we provide explicit formulæ to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation method can be applied and where particularly generalized versions of the Eta and Ate pairings due to Zhao et al. are especially efficient. Our approach introduces more flexibility when trading off computation speed and memory requirement. Furthermore, compressed computation of reduced pairings can be done without any finite field inversions. We also give a performance evaluation and compare the new method with conventional pairing algorithms.

Original language	English
Title of host publication	Progress in Cryptology - Africacrypt 2008 (First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008, Proceedings)
Editors	S. Vaudenay
Place of Publication	Berlin
Publisher	Springer
Pages	371-388
ISBN (Print)	978-3-540-68164-9
DOIs	https://doi.org/10.1007/978-3-540-68164-9_25
Publication status	Published - 2008

Publication series

Name	Lecture Notes in Computer Science
Volume	5023
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-540-68164-9_25

Cite this

Naehrig, M., Barreto, P. S. L. M., & Schwabe, P. (2008). On compressible pairings and their computation. In S. Vaudenay (Ed.), Progress in Cryptology - Africacrypt 2008 (First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008, Proceedings) (pp. 371-388). (Lecture Notes in Computer Science; Vol. 5023). Springer. https://doi.org/10.1007/978-3-540-68164-9_25

@inproceedings{5fb370a64d294df5b235c44fbcd5aadb,

title = "On compressible pairings and their computation",

abstract = "In this paper we provide explicit formul{\ae} to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation method can be applied and where particularly generalized versions of the Eta and Ate pairings due to Zhao et al. are especially efficient. Our approach introduces more flexibility when trading off computation speed and memory requirement. Furthermore, compressed computation of reduced pairings can be done without any finite field inversions. We also give a performance evaluation and compare the new method with conventional pairing algorithms.",

author = "M. Naehrig and P.S.L.M. Barreto and P. Schwabe",

year = "2008",

doi = "10.1007/978-3-540-68164-9_25",

language = "English",

isbn = "978-3-540-68164-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "371--388",

editor = "S. Vaudenay",

booktitle = "Progress in Cryptology - Africacrypt 2008 (First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008, Proceedings)",

}

Naehrig, M, Barreto, PSLM & Schwabe, P 2008, On compressible pairings and their computation. in S Vaudenay (ed.), Progress in Cryptology - Africacrypt 2008 (First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008, Proceedings). Lecture Notes in Computer Science, vol. 5023, Springer, Berlin, pp. 371-388. https://doi.org/10.1007/978-3-540-68164-9_25

On compressible pairings and their computation. / Naehrig, M.; Barreto, P.S.L.M.; Schwabe, P.
Progress in Cryptology - Africacrypt 2008 (First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008, Proceedings). ed. / S. Vaudenay. Berlin: Springer, 2008. p. 371-388 (Lecture Notes in Computer Science; Vol. 5023).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - On compressible pairings and their computation

AU - Naehrig, M.

AU - Barreto, P.S.L.M.

AU - Schwabe, P.

PY - 2008

Y1 - 2008

N2 - In this paper we provide explicit formulæ to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation method can be applied and where particularly generalized versions of the Eta and Ate pairings due to Zhao et al. are especially efficient. Our approach introduces more flexibility when trading off computation speed and memory requirement. Furthermore, compressed computation of reduced pairings can be done without any finite field inversions. We also give a performance evaluation and compare the new method with conventional pairing algorithms.

AB - In this paper we provide explicit formulæ to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation method can be applied and where particularly generalized versions of the Eta and Ate pairings due to Zhao et al. are especially efficient. Our approach introduces more flexibility when trading off computation speed and memory requirement. Furthermore, compressed computation of reduced pairings can be done without any finite field inversions. We also give a performance evaluation and compare the new method with conventional pairing algorithms.

U2 - 10.1007/978-3-540-68164-9_25

DO - 10.1007/978-3-540-68164-9_25

M3 - Conference contribution

SN - 978-3-540-68164-9

T3 - Lecture Notes in Computer Science

SP - 371

EP - 388

BT - Progress in Cryptology - Africacrypt 2008 (First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008, Proceedings)

A2 - Vaudenay, S.

PB - Springer

CY - Berlin

ER -

On compressible pairings and their computation

Abstract

Publication series

Access to Document

Fingerprint

Cite this