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
1 month 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
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted