Affine pairings on ARM

DOI10.1007/978-3-642-36334-4_13MaRDI QIDQ4912499zbMATH OpenOpenAlexFDO

Authors Tolga Acar, Michael Naehrig, Daniel Shumow, Kristin Lauter

Publication date 4 April 2013

Published in Pairing-Based Cryptography – Pairing 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36334-4_13

zbMATH Keywords

BN curvesoptimal ate pairingARM architecture

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Mathematical problems of computer architecture (68M07)

Recommendations

• An analysis of affine coordinates for pairing computation
• Efficient implementation of bilinear pairings on ARM processors
• Implementing pairings at the 192-bit security level
• New Software Speed Records for Cryptographic Pairings
• Speeding up Ate pairing computation in affine coordinates

Cited in

(7)

• Compact structure-preserving signatures with almost tight security
• Efficient implementation of bilinear pairings on ARM processors
• Secure and Efficient Pairing at 256-Bit Security Level
• An analysis of affine coordinates for pairing computation
• Choosing and generating parameters for pairing implementation on BN curves
• On the efficient implementation of pairing-based protocols
• Improved precomputation scheme for scalar multiplication on elliptic curves

This page was built for publication: Affine pairings on ARM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4912499)