Faster Explicit Formulas for Computing Pairings over Ordinary Curves
From MaRDI portal
Publication:3003374
DOI10.1007/978-3-642-20465-4_5zbMath1282.14046OpenAlexW1584385726MaRDI QIDQ3003374
Patrick Longa, Catherine H. Gebotys, Diego F. Aranha, Julio López, Koray Karabina
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_5
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (28)
Effective compression maps for torus-based cryptography ⋮ Faster Hashing to ${\mathbb G}_2$ ⋮ Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ Efficient Implementation of Bilinear Pairings on ARM Processors ⋮ LOVE a pairing ⋮ Families of SNARK-friendly 2-chains of elliptic curves ⋮ Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Higher-Order Side Channel Security and Mask Refreshing ⋮ A novel pairing-free certificateless authenticated key agreement protocol with provable security ⋮ Implementing optimized pairings with elliptic nets ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ An efficient ring signature scheme from pairings ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ Updating key size estimations for pairings ⋮ Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups ⋮ Cryptography on twisted Edwards curves over local fields ⋮ Point Decomposition Problem in Binary Elliptic Curves ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ Attribute Based Encryption with Direct Efficiency Tradeoff ⋮ Improving the computation of the optimal ate pairing for a high security level ⋮ Parallelizing the Weil and Tate Pairings ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
Uses Software
This page was built for publication: Faster Explicit Formulas for Computing Pairings over Ordinary Curves
