Pairing computation on Edwards curves with high-degree twists
From MaRDI portal
Publication:3454153
DOI10.1007/978-3-319-12087-4_12zbMATH Open1347.94042OpenAlexW2244986211MaRDI QIDQ3454153FDOQ3454153
Authors: Liangze Li, Hongfeng Wu, 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
Recommendations
Cites Work
- A taxonomy of pairing-friendly elliptic curves
- Faster computation of the Tate pairing
- Twisted Edwards Curves
- Twisted Edwards Curves Revisited
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Faster Addition and Doubling on Elliptic Curves
- The Weil pairing, and its efficient calculation
- Mathematics of public key cryptography.
- The Eta Pairing Revisited
- Faster pairing computations on curves with high-degree twists
- Pairing Lattices
- The pairing computation on Edwards curves
- Optimal Pairings
- A normal form for elliptic curves
- Explicit 4-descents on an elliptic curve
- A complete set of addition laws for incomplete Edwards curves
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Refinement of Miller's algorithm over Edwards curves
- Refinements of Miller's algorithm for computing the Weil/Tate pairing
- Another Approach to Pairing Computation in Edwards Coordinates
- Cryptography and Coding
- Tate pairing computation on Jacobi's elliptic curves
Cited In (3)
This page was built for publication: Pairing computation on Edwards curves with high-degree twists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454153)