New software speed records for cryptographic pairings

M. Naehrig, R.F. Niederhagen, P. Schwabe

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

51 Citations (Scopus)

Abstract

Abstract This paper presents new software speed records for the computation of cryptographic pairings. More specifically, we present details of an implementation which computes the optimal ate pairing on a 257-bit Barreto-Naehrig curve in only 4,470,408 cycles on one core of an Intel Core 2 Quad Q6600 processor. This speed is achieved by combining 1.) state-of-the-art high-level optimization techniques, 2.) a new representation of elements in the underlying finite fields which makes use of the special modulus arising from the Barreto-Naehrig curve construction, and 3.) implementing arithmetic in this representation using the double-precision floating-point SIMD instructions of the AMD64 architecture. Keywords: Pairings, Barreto-Naehrig curves, ate pairing, AMD64 architecture, modular arithmetic, SIMD floating-point instructions.
Original languageEnglish
Title of host publicationProgress in Cryptology - LATINCRYPT 2010 (First International Conference on Cryptology and Information Security in Latin America, Puebla, Mexico, August 8-11, 2010. Proceedings)
EditorsM. Abdalla, P.S.L.M. Barretto
Place of PublicationBerlin
PublisherSpringer
Pages109-123
ISBN (Print)978-3-642-14711-1
DOIs
Publication statusPublished - 2010

Publication series

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

Fingerprint Dive into the research topics of 'New software speed records for cryptographic pairings'. Together they form a unique fingerprint.

  • Cite this

    Naehrig, M., Niederhagen, R. F., & Schwabe, P. (2010). New software speed records for cryptographic pairings. In M. Abdalla, & P. S. L. M. Barretto (Eds.), Progress in Cryptology - LATINCRYPT 2010 (First International Conference on Cryptology and Information Security in Latin America, Puebla, Mexico, August 8-11, 2010. Proceedings) (pp. 109-123). (Lecture Notes in Computer Science; Vol. 6212). Springer. https://doi.org/10.1007/978-3-642-14712-8_7