Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

DCC
2016
IEEE

favoriteEmaildiscussreport

72views Computer Graphics» more DCC 2016»

Recent progress on the elliptic curve discrete logarithm problem

8 years 23 days ago

Recent progress on the elliptic curve discrete logarithm problem

Download eprint.iacr.org

We survey recent work on the elliptic curve discrete logarithm problem. In particular we review index calculus algorithms using summation polynomials, and claims about their complexity. Keywords Elliptic curve discrete logarithm problem (ECDLP) · Summation polynomials · Pollard rho · Index calculus Mathematics Subject Classiﬁcation (2000) 11Y16 · 11G20 · 14G15 · 13P10 · 14G50 · 11T71 · 14H52

Steven D. Galbraith, Pierrick Gaudry

Real-time Traffic

Computer Graphics | DCC 2016 |

claim paper

Related Content

» Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem

» On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» Isogeny cordillera algorithm to obtain cryptographically good elliptic curves

» Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» Cryptanalysis of the CFVZ cryptosystem

» Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three

» On the low hamming weight discrete logarithm problem for nonadjacent representations

» ECC2K130 on Cell CPUs

» Parameterized splitting systems for the discrete logarithm

» Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields...

Post Info
More Details (n/a)

Added	01 Apr 2016
Updated	01 Apr 2016
Type	Journal
Year	2016
Where	DCC
Authors	Steven D. Galbraith, Pierrick Gaudry

Comments (0)