Complexity bounds on Semaev's naive index calculus method for ECDLP (Q2025337): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/jmc-2019-0029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3094804166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the discrete logarithm problem for prime-field elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideals, Varieties, and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the discrete logarithm problem in elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on signature-based algorithms for computing Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent progress on the elliptic curve discrete logarithm problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2781760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension-Dependent Upper Bounds for Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-subfield polynomials and the elliptic curve discrete logarithm problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing elliptic curve logarithms to logarithms in a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polynomial Systems Arising from a Weil Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo Methods for Index Computation (mod p) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete logarithm problem on elliptic curves of trace one / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Affine Tropical F5 Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tropical F5 Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational hardness of IFP and ECDLP / rank
 
Normal rank

Latest revision as of 19:16, 25 July 2024

scientific article
Language Label Description Also known as
English
Complexity bounds on Semaev's naive index calculus method for ECDLP
scientific article

    Statements

    Complexity bounds on Semaev's naive index calculus method for ECDLP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2021
    0 references
    ECDLP
    0 references
    summation polynomials
    0 references
    index calculus methods
    0 references
    Gröbner basis computation
    0 references
    fall degrees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references