On the embedding degree of reductions of an elliptic curve

DOI10.1016/J.IPL.2009.02.018zbMath1209.68213OpenAlexW1996490022MaRDI QIDQ989443

Alina Carmen Cojocaru, Igor E. Shparlinski

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.018

zbMATH Keywords

cryptographyembedding degree

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over global fields (11G05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

Isolated elliptic curves and the MOV attack ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Quelques applications du théorème de densité de Chebotarev
• Frobenius distributions in \(\mathrm{GL}_2\)-extensions. Distribution of Frobenius automorphisms in \(\mathrm{GL}_2\)-extensions of the rational numbers
• MOV attack in various subgroups on elliptic curves
• Short signatures from the Weil pairing
• A taxonomy of pairing-friendly elliptic curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Identity-Based Encryption from the Weil Pairing

This page was built for publication: On the embedding degree of reductions of an elliptic curve