Michael Jacobson, Alfred Menezes, Andreas Stein  Home/Search
Context Related
| iacr.org/2001/041.ps.gz cacr.math.uwaterloo.ca/~ajmene...124.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/search...ast=365&title=1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We provide a concrete instance of the discrete logarithm problem on an elliptic curve over (Update)
Context of citations to this paper: More
...isogenous to V W. 7 . but it is highly unlikely such a curve [H] exists at all. Later Jacobson, Menezes, Stein found an approach [16] to apply the GMS attack. their idea was: Suppose for E 1 GHS cannot be applied, try to find an isogenous curve E 2 . The Weil descent of...
Cited by: More
Analysis of the GHS Weil Descent Attack on the ECDLP over .. - Maurer, Menezes, Teske (2001) (Correct)
A Survey of Public-Key Cryptosystems - Koblitz, Menezes (Correct)
Weak Fields for ECC - Menezes, Teske, Weng (2003) (Correct)
Active bibliography (related documents): More All
1.5: Hyperelliptic Curves and Cryptography - Jacobson, Jr., Menezes, Stein (2004) (Correct)
0.8: Analysis of the Weil Descent Attack of Gaudry, Hess and Smart - Menezes, Qu (Correct)
0.5: The extended Euclidian algorithm on polynomials, and the.. - Enge (1999) (Correct)
Similar documents based on text: More All
0.9: Supersingular Hyperelliptic Curve Of Genus 2 Over Finite Fields - Choie, Jeong, Lee (2002) (Correct)
0.7: Lifting Elliptic Curves and Solving the Elliptic Curve.. - Huang, Kueh, Tan (2000) (Correct)
0.6: Computing Zeta Functions of Artin-Schreier Curves over Finite.. - Lauder, Wan (2001) (Correct)
Related documents from co-citation: More All
8: Constructive and destructive facets of Weil descent on elliptic curves - Gaudry, Hess et al. - 2000
8: Analysis of the Weil Descent Attack of Gaudry (context) - Menezes, Qu - 2000
7: Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves (context) - Frey, Ruck et al. - 1994
BibTeX entry: (Update)
M. Jacobson, A. Menezes and A. Stein. Solving elliptic curve discrete logarithm problems using Weil descent. Preprint, 2001. http://citeseer.ist.psu.edu/jacobson01solving.html More
@misc{ jacobson01solving,
author = "M. Jacobson and A. Menezes and A. Stein",
title = "Solving elliptic curve discrete logarithm problems using Weil descent",
text = "M. Jacobson, A. Menezes and A. Stein. Solving elliptic curve discrete logarithm
problems using Weil descent. Preprint, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/jacobson01solving.html" }
Citations (may not include all citations):1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1996
168 An improved algorithm for computing logarithms over GF (context) - Pohlig, Hellman - 1978
134 Reducing elliptic curve logarithms to logarithms in a nite e.. (context) - Menezes, Okamoto et al. - 1993
128 A subexponential algorithm for discrete logarithms over the .. (context) - Adleman, DeMarrais et al. - 1994
116 Algorithmic Number Theory (context) - Bach, Shallit - 1996
68 Computing in the jacobian of a hyperelliptic curve (context) - Cantor - 1987
60 divisibility and the discrete logarithm in the divisor class.. (context) - Frey, uck et al. - 1994
58 Monte Carlo methods for index computation mod p (context) - Pollard - 1978
54 Constructive and destructive facets of Weil descent on ellip.. - Gaudry, Hess et al. - 2000
52 Parallel collision search with cryptanalytic applications - van Oorschot, Wiener - 1999
49 CM-curves with good cryptographic properties (context) - Koblitz - 1992
48 The discrete logarithm problem on elliptic curves of trace o.. - Smart - 1999
43 Factoring with two large primes (context) - Lenstra, Manasse - 1991
43 Fermat quotients and the polynomial time discrete log algori.. (context) - Satoh, Araki - 1998
32 An algorithm for solving the discrete log problem on hyperel.. (context) - Gaudry - 2000
32 Evaluation of discrete logarithms in a group of p-torsion po.. (context) - Semaev - 1998
31 A rigorous subexponential algorithm for computation of class.. (context) - Hafner, McCurley - 1989
29 Improving the parallelized Pollard lambda search on binary a.. - Gallant, Lambert et al. - 2000
27 Speeding up Pollard's rho method for computing discrete loga.. - Teske - 1998
25 Solving sparse linear equations over nite elds (context) - Wiedemann - 1986
23 A general framework for subexponential discrete logarithm al.. - Enge, Gaudry
23 A cryptographic application of Weil descent (context) - Galbraith, Smart - 1999
17 Distributed matrix-free solution of large sparse linear syst.. - Kaltofen, Lobo - 1999
16 An elementary introduction to hyperelliptic curves (context) - Menezes, Wu et al. - 1998
15 Computing discrete logarithms in high-genus hyperelliptic ja.. - Enge
15 Ecient arithmetic on Koblitz curves (context) - Solinas - 2000
15 Applications of arithmetical geometry to cryptographic const.. - Frey - 2001
13 Analysis of the Weil descent attack of Gaudry (context) - Menezes, Qu - 2001
13 Comparing real and imaginary arithmetics for divisor class g.. (context) - Paulus, Stein - 1998
11 Computing discrete logarithms in real quadratic congruence f.. (context) - uller, Stein et al. - 1999
9 Solving large sparse linear systems over nite elds (context) - LaMacchia, Odlyzko - 1991
9 How secure are elliptic curves over composite extension elds - Smart - 2001
6 A subexponential algorithm for solving the discrete logarith.. (context) - Bauer - 1999
5 A new algorithm for factoring polynomials over nite elds (context) - Cantor, Zassenhaus - 1981
4 Smooth ideals in hyperelliptic function elds (context) - Enge, Stein
4 Sieving in function elds (context) - Flassenberg, Paulus - 1999
4 Slides available from http://www (context) - Frey, disguise et al. - 1998
3 KASH program for performing the GHS attack (context) - Hess - 2000
3 Improvements on the general number eld sieve for discrete lo.. (context) - Joux, Lercier
3 The OAKLEY Key Determination Protocol (context) - Task - 1998
2 How to nd small factors of integers (context) - Bernstein - 2000
1 Fact sheet for solution of ECC2-108K ECDLP challenge (context) - Harley
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/search.pl?last=365&title=1): More
Robust Software Tokens: Towards Securing a Digital Identity - Kwon (2001) (Correct)
On the Complexity of Matsui's Attack - Junod (2001) (Correct)
Constructing Pseudo-Random Permutations with a Prescribed.. - Naor, Reingold (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC