On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6

DOI10.1007/978-3-540-79456-1_6zbMath1231.11068OpenAlexW1606363966MaRDI QIDQ3502730

Koray Karabina, Edlyn Teske

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79456-1_6

zbMATH Keywords

Elliptic curvesembedding degreepairing-based cryptosystemsMNT curves

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (9)

On the near prime-order MNT curves ⋮ On Near Prime-Order Elliptic Curves with Small Embedding Degrees ⋮ A survey of elliptic curves for proof systems ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem

Cites Work

• Elliptic curves with low embedding degree
• A comparison of MNT curves and supersingular curves
• A taxonomy of pairing-friendly elliptic curves
• Efficient pairing computation on supersingular abelian varieties
• Generating more MNT elliptic curves
• Elliptic Curves and Primality Proving
• The Eta Pairing Revisited
• Reducing elliptic curve logarithms to logarithms in a finite field
• Ricerche aritmetiche sui polinomi
• Number fields
• Simple continued fraction solutions for Diophantine equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6