On near prime-order elliptic curves with small embedding degrees

DOI10.1007/978-3-319-23021-4_13zbMATH Open1465.11159OpenAlexW2296545267MaRDI QIDQ2947154FDOQ2947154

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

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

Recommendations

• On the near prime-order MNT curves
• On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
• Generating more MNT elliptic curves
• On the efficient generation of generalized MNT elliptic curves
• Elliptic curves suitable for pairing based cryptography

zbMATH Keywords

complex multiplicationPell's equationpairing-friendly elliptic curveMNT curves

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
• On the near prime-order MNT curves
• Note on families of pairing-friendly elliptic curves with small embedding degree
• On the efficient generation of generalized MNT elliptic curves
• Generating more MNT elliptic curves

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)