Efficient Implementation of Bilinear Pairings on ARM Processors

DOI10.1007/978-3-642-35999-6_11zbMath1327.94049OpenAlexW1576157668MaRDI QIDQ3455495

Reza Azarderakhsh, Patrick Longa, David D. W. Yao, Gurleen Grewal, Shi Hu

Publication date: 4 December 2015

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35999-6_11

zbMATH Keywords

Barreto-Naehrig curvesARM processoroptimal-Ate pairingpairing implementation

Mathematics Subject Classification ID

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

Related Items (5)

Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ A survey of fault attacks in pairing based cryptography ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Compact structure-preserving signatures with almost tight security ⋮ Updating key size estimations for pairings

Uses Software

• RELIC

Cites Work

• Pairing-based cryptography -- Pairing 2010. 4th international conference, Yamanaka Hot Spring, Japan, December 13--15, 2010. Proceedings
• The Weil pairing, and its efficient calculation
• Faster Hashing to ${\mathbb G}_2$
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• On the Efficient Implementation of Pairing-Based Protocols
• Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
• New Software Speed Records for Cryptographic Pairings
• Optimal Pairings
• Pairing-Friendly Elliptic Curves of Prime Order

This page was built for publication: Efficient Implementation of Bilinear Pairings on ARM Processors