New software speed records for cryptographic pairings. (English)
Abdalla, Michel (ed.) et al., Progress in cryptology ‒ LATINCRYPT 2010. First international conference on cryptology and information security in Latin America, Puebla, Mexico, August 8‒11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14711-1/pbk). Lecture Notes in Computer Science 6212, 109-123 (2010).
Summary: 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.
Start
Contact
Print
General Help
