Pairing Computation on Edwards Curves with High-Degree Twists
From MaRDI portal
Publication:3454153
DOI10.1007/978-3-319-12087-4_12zbMath1347.94042OpenAlexW2244986211MaRDI QIDQ3454153
Hongfeng Wu, Liangze Li, Fan Zhang
Publication date: 2 December 2015
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12087-4_12
Related Items
Cites Work
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- The pairing computation on Edwards curves
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Faster computation of the Tate pairing
- A complete set of addition laws for incomplete Edwards curves
- Mathematics of Public Key Cryptography
- Explicit 4-descents on an elliptic curve
- Twisted Edwards Curves
- The Eta Pairing Revisited
- Faster Pairing Computations on Curves with High-Degree Twists
- Twisted Edwards Curves Revisited
- Pairing Lattices
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Tate Pairing Computation on Jacobi’s Elliptic Curves
- Optimal Pairings
- Refinement of Miller’s Algorithm Over Edwards Curves
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves
- Refinements of Miller's algorithm for computing the Weil/Tate pairing
- Another Approach to Pairing Computation in Edwards Coordinates
- Cryptography and Coding