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. 
H. Gopalakrishna Gadiyar and R. Padma
math.NT cs.CR