Recommendations
Cites work
- A complete set of addition laws for incomplete Edwards curves
- A normal form for elliptic curves
- Advances in Elliptic Curve Cryptography
- Another Approach to Pairing Computation in Edwards Coordinates
- Application of scalar multiplication of Edwards curves to pairing-based cryptography
- Cryptography and Coding
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Explicit 4-descents on an elliptic curve
- Faster Addition and Doubling on Elliptic Curves
- Faster computation of the Tate pairing
- Faster pairing computations on curves with high-degree twists
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Mathematics of public key cryptography.
- Optimal Pairings
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Pairing Lattices
- The Eta Pairing Revisited
- The Weil pairing, and its efficient calculation
- Twisted Edwards Curves
- Twisted Edwards Curves Revisited
Cited in
(8)- The pairing computation on binary Edwards curves
- Edwards curves and Gaussian hypergeometric series
- Mean value formulas for twisted Edwards curves
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Pairing computation on Edwards curves with high-degree twists
- A complete set of addition laws for incomplete Edwards curves
- Twisted Edwards Curves
- Pairing-friendly twisted Hessian curves
This page was built for publication: The pairing computation on Edwards curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460158)