The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
classification
🧮 math.NT
cs.CR
keywords
discretefieldslinearlogarithmprimeproblemchineseclassical
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.