R.I.P.
π»
Ghosted
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
August 25, 2016 Β· Declared Dead Β· π IACR Cryptology ePrint Archive
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
H. Gopalakrishna Gadiyar, R. Padma
arXiv ID
1608.07032
Category
math.NT
Cross-listed
cs.CR
Citations
1
Venue
IACR Cryptology ePrint Archive
Last Checked
4 months ago
Abstract
We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.NT
R.I.P.
π»
Ghosted
An analogue of Vosper's Theorem for Extension Fields
R.I.P.
π»
Ghosted
Improved torsion point attacks on SIDH variants
R.I.P.
π»
Ghosted
Ramanujan graphs in cryptography
R.I.P.
π»
Ghosted
Locally Recoverable Codes with Availability $t\geq 2$ from Fiber Products of Curves
R.I.P.
π»
Ghosted
Failing to hash into supersingular isogeny graphs
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