Elliptic curve discrete logarithm problem over small degree extension fields
type: Item
instance of: scholarly article
title: Elliptic curve discrete logarithm problem over small degree extension fields
zbMATH Open document ID: 1291.94107
author: Vanessa Vitse
author: Antoine Joux
published in: Journal of Cryptology
publication date: 2013-04-15T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 6153970
describes a project that uses: F5C
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: s00145-011-9116-z
OpenAlex ID: W2170644019
cites work: Q4234296
cites work: Hybrid approach for solving multivariate systems over finite fields
cites work: The Magma algebra system. I: The user language
cites work: Q3714165
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: Solving a system of algebraic equations with symmetries
cites work: Q3413659
cites work: On the discrete logarithm problem in elliptic curves
cites work: New directions in cryptography
cites work: F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Q4660688
cites work: Algebraic Cryptanalysis of Curry and Flurry Using Correlated Messages
cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering
cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
cites work: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
cites work: Constructive and destructive facets of Weil descent on elliptic curves
cites work: A double large prime variation for small genus hyperelliptic index calculus
cites work: On an installation of Buchberger's algorithm
cites work: On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
cites work: A Variant of the F4 Algorithm
cites work: Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
cites work: Elliptic Curve Cryptosystems
cites work: Another look at non-standard discrete log and Diffie-Hellman problems
cites work: Q3325833
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: Q3718617
cites work: The Weil pairing, and its efficient calculation
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: Kangaroos, monopoly and discrete logarithms
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: Q3710637
cites work: The discrete logarithm problem on elliptic curves of trace one
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Q4331218
cites work: Q4406533
DOI: 10.1007/S00145-011-9116-Z
description: scientific article; zbMATH DE number 6153970