arXiv · 1608.07032
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
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.
Explore related subjects
Keep this discovery
H. Gopalakrishna Gadiyar, R. Padma. 2016-08-25. The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem. https://arxiv.org/abs/1608.07032
Cite the original work for its findings. Save a collection to share your selection of sources.