On near prime-order elliptic curves with small embedding degrees
From MaRDI portal
Publication:2947154
Recommendations
Cites work
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- A comparison of MNT curves and supersingular curves
- A taxonomy of pairing-friendly elliptic curves
- Abstract Algebra
- Faster Addition and Doubling on Elliptic Curves
- Faster computation of the Tate pairing
- Generating more MNT elliptic curves
- Improved Miller’s Algorithm for Computing Pairings on Edwards Curves
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- On the efficient generation of generalized MNT elliptic curves
- Ordinary Abelian varieties having small embedding degree
- Reducing elliptic curve logarithms to logarithms in a finite field
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- Twisted Edwards Curves
- Zeta-polynomials, Hilbert polynomials, and the Eichler-Shimura identities
Cited in
(5)
This page was built for publication: On near prime-order elliptic curves with small embedding degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947154)