Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
From MaRDI portal
Publication:2163356
DOI10.1007/S11786-022-00531-WOpenAlexW4283382856MaRDI QIDQ2163356
Fouotsa Emmanuel, Pecha Njiahouo Aminatou, Azebaze Guimagang Laurian, Nadia El Mrabet
Publication date: 10 August 2022
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-022-00531-w
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faster Ate pairing computation on Selmer's model of elliptic curves
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Computing bilinear pairings on elliptic curves with automorphisms
- A new family of pairing-friendly elliptic curves
- Short signatures from the Weil pairing
- The Weil pairing, and its efficient calculation
- Accelerating beta Weil pairing with precomputation and multi-pairing techniques
- Updating key size estimations for pairings
- Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Beta Weil pairing revisited
- Analysis of Optimum Pairing Products at High Security Levels
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- Parallelizing the Weil and Tate Pairings
- Faster Pairing Computations on Curves with High-Degree Twists
- Fault Attacks against the Miller Algorithm in Hessian Coordinates
- Implementing Pairings at the 192-Bit Security Level
- Optimal Pairings
- Advances in Cryptology – CRYPTO 2004
- Topics in Cryptology – CT-RSA 2005
- Curves with Fast Computations in the First Pairing Group
This page was built for publication: Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
