素域上的离散对数问题可转化为多元线性孙子剩余定理
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
摘要：
我们证明了经典的素域上的离散对数问题可以归结为求解线性模方程组的问题。
英文摘要：
We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
