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.

6 pages

References in corpus (1)

• A Multivariable Chinese Remainder Theorem

Cited by in corpus (1)

• The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives