New Software Speed Records for Cryptographic Pairings

DOI10.1007/978-3-642-14712-8_7zbMath1285.94084OpenAlexW2110698954MaRDI QIDQ3584978

Peter Schwabe, Ruben Niederhagen, Michael Naehrig

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14712-8_7

zbMATH Keywords

modular arithmeticate pairingBarreto-Naehrig curvesPairingsAMD64 architectureSIMD floating-point instructions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Efficient Implementation of Bilinear Pairings on ARM Processors ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ A survey of elliptic curves for proof systems ⋮ Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ Updating key size estimations for pairings ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Parallelizing the Weil and Tate Pairings ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves

Uses Software

• Barreto-Naehrig

This page was built for publication: New Software Speed Records for Cryptographic Pairings