On the asymptotic effectiveness of Weil descent attacks

Koray Karabina; Alfred Menezes; Carl Pomerance; Igor E. Shparlinski

doi:10.1515/JMC.2010.007

On the asymptotic effectiveness of Weil descent attacks

Koray Karabina^*, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

5 Downloads (Pure)

Abstract

In this paper we investigate the asymptotic effectiveness of the Gaudry-Hess-Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.

Original language	English
Pages (from-to)	175-191
Number of pages	17
Journal	Journal of Mathematical Cryptology
Volume	4
Issue number	2
DOIs	https://doi.org/10.1515/JMC.2010.007
Publication status	Published - Oct 2010
Externally published	Yes

Access to Document

10.1515/JMC.2010.007

Publisher version (open access).pdfFinal published version, 635 KB

Cite this

@article{b735eabc90364ee3be09ececdde9dec2,

title = "On the asymptotic effectiveness of Weil descent attacks",

abstract = "In this paper we investigate the asymptotic effectiveness of the Gaudry-Hess-Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.",

author = "Koray Karabina and Alfred Menezes and Carl Pomerance and Shparlinski, {Igor E.}",

year = "2010",

month = oct,

doi = "10.1515/JMC.2010.007",

language = "English",

volume = "4",

pages = "175--191",

journal = "Journal of Mathematical Cryptology",

issn = "1862-2976",

publisher = "De Gruyter",

number = "2",

}

TY - JOUR

T1 - On the asymptotic effectiveness of Weil descent attacks

AU - Karabina, Koray

AU - Menezes, Alfred

AU - Pomerance, Carl

AU - Shparlinski, Igor E.

PY - 2010/10

Y1 - 2010/10

N2 - In this paper we investigate the asymptotic effectiveness of the Gaudry-Hess-Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.

AB - In this paper we investigate the asymptotic effectiveness of the Gaudry-Hess-Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.

UR - http://www.scopus.com/inward/record.url?scp=84858681622&partnerID=8YFLogxK

U2 - 10.1515/JMC.2010.007

DO - 10.1515/JMC.2010.007

M3 - Article

AN - SCOPUS:84858681622

SN - 1862-2976

VL - 4

SP - 175

EP - 191

JO - Journal of Mathematical Cryptology

JF - Journal of Mathematical Cryptology

IS - 2

ER -

On the asymptotic effectiveness of Weil descent attacks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this