On the Discrete Logarithm Problem for elliptic curves over local fields
April 27, 2023 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Giuseppe Filippone
arXiv ID
2304.14150
Category
math.AG
Cross-listed
cs.CR
Citations
1
Venue
arXiv.org
Last Checked
3 months ago
Abstract
The Discrete Logarithm Problem (DLP) for elliptic curves has been extensively studied since, for instance, it is the core of the security of cryptosystems like Elliptic Curve Cryptography (ECC). In this paper, we present an attack to the DLP for elliptic curves based on its connection to the problem of lifting, by using the exponential map for elliptic curves and its inverse over $ \mathbb{Z} / p^k \mathbb{Z} $. Additionally, we show that hyperelliptic curves are resistant to this attack, meaning that these latter curves offer a higher level of security compared to the classic elliptic curves used in cryptography.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.AG
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Two-point AG codes on the GK maximal curves
R.I.P.
π»
Ghosted
Congruences and Concurrent Lines in Multi-View Geometry
R.I.P.
π»
Ghosted
Quantum codes from a new construction of self-orthogonal algebraic geometry codes
R.I.P.
π»
Ghosted
The Chow Form of the Essential Variety in Computer Vision
R.I.P.
π»
Ghosted
Algebraic Geometric codes from Kummer Extensions
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted