On the asymptotic effectiveness of Weil descent attacks | Macquarie University ResearchOnline

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/126837

22 Visitors

33 Hits

2 Downloads

File	Description	Size	Format
DS01	Publisher version (open access)	634 KB	Adobe Acrobat PDF	View/Open

Title: On the asymptotic effectiveness of Weil descent attacks
Related: Journal of mathematical cryptology, Vol. 4, No. 2 (2010), p.175-191
DOI: 10.1515/JMC.2010.007
Publisher: de Gruyter
Date: 2010
FoR/RFCD Code(s): 080400 Data Format 010200 Applied Mathematics
Author/Creator: Karabina, Koray
Author/Creator: Menezes, Alfred
Author/Creator: Pomerance, Carl
Author/Creator: Shparlinski, Igor E
Description: 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.
Description: 17 page(s)
Subject Keyword: 080400 Data Format
Subject Keyword: 010200 Applied Mathematics
Subject Keyword: Elliptic curve discrete logarithm problem
Subject Keyword: Weil descent attacks
Resource Type: journal article
Organisation: Macquarie University. Dept. of Computing

Macquarie University ResearchOnline