The pairing computation on Edwards curves
From MaRDI portal
Publication:460158
DOI10.1155/2013/136767zbMath1296.94144WikidataQ59022835 ScholiaQ59022835MaRDI QIDQ460158
Hongfeng Wu, Liangze Li, Fan Zhang
Publication date: 13 October 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/136767
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
14G20: Local ground fields in algebraic geometry
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Cites Work
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- The Weil pairing, and its efficient calculation
- 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
- Application of Scalar Multiplication of Edwards Curves to Pairing-Based Cryptography
- Optimal Pairings
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves
- Advances in Elliptic Curve Cryptography
- Another Approach to Pairing Computation in Edwards Coordinates
- Cryptography and Coding
