On compressible pairings and their computation

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

19 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 languageEnglish
Title of host publicationProgress in Cryptology - Africacrypt 2008 (First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008, Proceedings)
EditorsS. Vaudenay
Place of PublicationBerlin
PublisherSpringer
Pages371-388
ISBN (Print)978-3-540-68164-9
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
Volume5023
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'On compressible pairings and their computation'. Together they form a unique fingerprint.

  • 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