Elliptic curves with low embedding degree

DOI10.1007/s00145-006-0544-0zbMath1133.14303OpenAlexW2071011219MaRDI QIDQ862423

Igor E. Shparlinski, Florian Luca

Publication date: 24 January 2007

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-006-0544-0

Mathematics Subject Classification ID

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

Related Items (max. 100)

Heuristics on pairing-friendly abelian varieties ⋮ On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6 ⋮ Heuristics of the Cocks-Pinch method ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ Closed formulae for the Weil pairing inversion ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Pairings for cryptographers

This page was built for publication: Elliptic curves with low embedding degree