Complexity bounds on Semaev's naive index calculus method for ECDLP
type: Item
instance of: scholarly article
title: Complexity bounds on Semaev's naive index calculus method for ECDLP
zbMATH Open document ID: 1464.94054
author: Kazuhiro Yokoyama
author: Masaya Yasuda
author: Yasushi Takahashi
author: Jun Kogure
published in: Journal of Mathematical Cryptology
publication date: 2021-05-12T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 7347753
zbMATH Keywords: ECDLP
zbMATH Keywords: summation polynomials
zbMATH Keywords: index calculus methods
zbMATH Keywords: Gröbner basis computation
zbMATH Keywords: fall degrees
describes a project that uses: SINGULAR
describes a project that uses: Risa/Asir
MaRDI profile type: Publication
full work available at URL: jmc-2019-0029
OpenAlex ID: W3094804166
cites work: On the discrete logarithm problem for prime-field elliptic curves
cites work: Q4265362
cites work: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
cites work: Ideals, Varieties, and Algorithms
cites work: On the discrete logarithm problem in elliptic curves
cites work: A survey on signature-based algorithms for computing Gröbner bases
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Q4660688
cites work: Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus
cites work: Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
cites work: On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems
cites work: Recent progress on the elliptic curve discrete logarithm problem
cites work: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
cites work: Q2781760
cites work: Q4826108
cites work: Dimension-Dependent Upper Bounds for Gröbner Bases
cites work: Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
cites work: Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
cites work: Elliptic Curve Cryptosystems
cites work: Q5317677
cites work: Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
cites work: Q3325833
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: Q3718617
cites work: Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
cites work: On Polynomial Systems Arising from a Weil Descent
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Q4217446
cites work: Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
cites work: Q5628224
cites work: The discrete logarithm problem on elliptic curves of trace one
cites work: On Affine Tropical F5 Algorithms
cites work: A Tropical F5 Algorithm
cites work: Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
cites work: Modern computer algebra
cites work: Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster
cites work: Computational hardness of IFP and ECDLP
DOI: 10.1515/JMC-2019-0029
description: scientific article; zbMATH DE number 7347753