On the asymptotic effectiveness of Weil descent attacks

DOI10.1515/JMC.2010.007zbMath1252.94080MaRDI QIDQ3056341

Koray Karabina, Igor E. Shparlinski, Carl B. Pomerance, Alfred J. Menezes

Publication date: 12 November 2010

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

zbMATH Keywords

elliptic curve discrete logarithm problemWeil descent attacks

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (1)

A note on the kernel of group homomorphism of the Weil descent method

Cites Work

• Factoring integers with elliptic curves
• The discrete logarithm problem on elliptic curves of trace one
• Constructive and destructive facets of Weil descent on elliptic curves
• Monte Carlo Methods for Index Computation (mod p)
• 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
• Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝

This page was built for publication: On the asymptotic effectiveness of Weil descent attacks