On Near Prime-Order Elliptic Curves with Small Embedding Degrees

DOI10.1007/978-3-319-23021-4_13zbMath1465.11159OpenAlexW2296545267MaRDI QIDQ2947154

Duc-Phong Le, Chik How Tan, Nadia El Mrabet

Publication date: 22 September 2015

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_13

zbMATH Keywords

complex multiplicationPell's equationpairing-friendly elliptic curveMNT curves

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Curves over finite and local fields (11G20)

Related Items (1)

On the near prime-order MNT curves

Cites Work

• Unnamed Item
• Unnamed Item
• A comparison of MNT curves and supersingular curves
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• A taxonomy of pairing-friendly elliptic curves
• Zeta-polynomials, Hilbert polynomials, and the Eichler-Shimura identities
• Faster computation of the Tate pairing
• Ordinary Abelian varieties having small embedding degree
• Generating more MNT elliptic curves
• On the Efficient Generation of Generalized MNT Elliptic Curves
• On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
• Twisted Edwards Curves
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Improved Miller’s Algorithm for Computing Pairings on Edwards Curves
• Faster Addition and Doubling on Elliptic Curves
• Abstract Algebra

This page was built for publication: On Near Prime-Order Elliptic Curves with Small Embedding Degrees