Improving the computation of the optimal ate pairing for a high security level

DOI10.1007/s12190-018-1167-yzbMath1418.94066OpenAlexW2789581989MaRDI QIDQ2317387

Emmanuel Fouotsa, Loubna Ghammam

Publication date: 9 August 2019

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-018-1167-y

zbMATH Keywords

final exponentiationmemory resourcesoptimal ate pairingMiller loopBLS curves

Mathematics Subject Classification ID

Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A survey of elliptic curves for proof systems

Cites Work

• Unnamed Item
• Unnamed Item
• Memory-saving computation of the pairing final exponentiation on BN curves
• The Weil pairing, and its efficient calculation
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• Point Decomposition Problem in Binary Elliptic Curves
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Implementing Pairings at the 192-Bit Security Level
• Optimal Pairings
• Advances in Cryptology – CRYPTO 2004
• Pairing-Friendly Elliptic Curves of Prime Order

This page was built for publication: Improving the computation of the optimal ate pairing for a high security level