On the discrete logarithm problem for prime-field elliptic curves
type: Item
instance of: scholarly article
title: On the discrete logarithm problem for prime-field elliptic curves
zbMATH Open document ID: 1421.11103
author: Alessandro Amadori
author: Federico Pintore
author: Massimiliano Sala
published in: Finite Fields and their Applications
publication date: 2018-04-27T00:00:00Z
full work available at URL: http://hdl.handle.net/11572/202653
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11G20
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 14G15
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 14H52
zbMATH DE Number: 6865326
zbMATH Keywords: elliptic curve
zbMATH Keywords: discrete logarithm problem (DLP)
zbMATH Keywords: prime field
zbMATH Keywords: summation polynomials
zbMATH Keywords: Gröbner basis
MaRDI profile type: Publication
OpenAlex ID: W2789488647
cites work: On the discrete logarithm problem in elliptic curves
cites work: Using symmetries in the index calculus for elliptic curves discrete logarithm
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: Recent progress on the elliptic curve discrete logarithm problem
cites work: Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two
cites work: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
cites work: Improvement of Faugère et al.’s Method to Solve ECDLP
cites work: Elliptic curve discrete logarithm problem over small degree extension fields
cites work: Elliptic Curve Cryptosystems
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
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: Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study
DOI: 10.1016/J.FFA.2018.01.009
description: scientific article; zbMATH DE number 6865326