On index calculus algorithms for subfield curves
type: Item
instance of: scholarly article
title: On index calculus algorithms for subfield curves
zbMATH Open document ID: 1485.94086
DOI: 10.1007/978-3-030-81652-0_5
author: Steven D. Galbraith
author: Robert Granger
author: Simon-Philipp Merz
author: Christophe Petit
publication date: 2022-03-25T00:00:00Z
full work available at URL: On Index Calculus Algorithms for Subfield Curves.pdf
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11G07
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 7498218
zbMATH Keywords: elliptic curve discrete logarithm problem
zbMATH Keywords: Koblitz curves
MaRDI profile type: Publication
OpenAlex ID: W3183990474
cites work: The Probability of Relatively Prime Polynomials
cites work: Galois invariant smoothness basis
cites work: On the discrete logarithm problem in elliptic curves
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Q4660688
cites work: Using symmetries in the index calculus for elliptic curves discrete logarithm
cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering
cites work: Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
cites work: Recent progress on the elliptic curve discrete logarithm problem
cites work: Q3374896
cites work: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
cites work: Index calculus in the trace zero variety
cites work: Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
cites work: Improvement of Faugère et al.’s Method to Solve ECDLP
cites work: The Function Field Sieve in the Medium Prime Case
cites work: Elliptic curve discrete logarithm problem over small degree extension fields
cites work: Elliptic Curve Cryptosystems
cites work: Q2724449
cites work: Q3718617
cites work: On Polynomial Systems Arising from a Weil Descent
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Kangaroos, monopoly and discrete logarithms
cites work: Elliptic curve cryptosystems over small fields of odd characteristic
cites work: Parallel collision search with cryptanalytic applications
cites work: Solving sparse linear equations over finite fields
cites work: Q4250816
description: scientific article; zbMATH DE number 7498218