Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
From MaRDI portal
Publication:3104750
DOI10.1007/978-3-642-25578-6_23zbMath1291.94071OpenAlexW1549768083MaRDI QIDQ3104750
Craig Costello, Michael Naehrig, Kristin E. Lauter
Publication date: 16 December 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://eprints.qut.edu.au/47971/1/47971U.pdf
Related Items (4)
LOVE a pairing ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level ⋮ Improving the computation of the optimal ate pairing for a high security level
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Pairing-based cryptography -- Pairing 2009. Third international conference Palo Alto, CA, USA, August 12--14, 2009. Proceedings
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- An Analysis of Affine Coordinates for Pairing Computation
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Faster Pairings on Special Weierstrass Curves
- On Compressible Pairings and Their Computation
- The Eta Pairing Revisited
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
- Faster Pairing Computations on Curves with High-Degree Twists
- Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
- Choosing the correct elliptic curve in the CM method
- New Software Speed Records for Cryptographic Pairings
- Optimal Pairings
- Advances in Cryptology – CRYPTO 2004
- Pairing-Friendly Elliptic Curves of Prime Order
This page was built for publication: Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
