On the discrete logarithm problem in elliptic curves
From MaRDI portal
Publication:3077175
DOI10.1112/S0010437X10005075zbMath1213.11200OpenAlexW2149528579MaRDI QIDQ3077175
Publication date: 22 February 2011
Published in: Compositio Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0010437x10005075
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (26)
A simple method for obtaining relations among factor basis elements for special hyperelliptic curves ⋮ On index calculus algorithms for subfield curves ⋮ A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ A Note on Diem’s Proof ⋮ Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic ⋮ Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two ⋮ Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Quasi-subfield polynomials and the elliptic curve discrete logarithm problem ⋮ Index calculus in the trace zero variety ⋮ On the last fall degree of zero-dimensional Weil descent systems ⋮ Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ A new perspective on the powers of two descent for discrete logarithms in finite fields ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ On the discrete logarithm problem in finite fields of fixed characteristic ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ New results on quasi-subfield polynomials ⋮ On the discrete logarithm problem for prime-field elliptic curves ⋮ On the first fall degree of summation polynomials ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Cover attacks for elliptic curves with cofactor two ⋮ Improvement of FPPR method to solve ECDLP ⋮ Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
Uses Software
This page was built for publication: On the discrete logarithm problem in elliptic curves
