The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem

H. Gopalakrishna Gadiyar; R. Padma

The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem

Number Theory 2016-08-26 v1 Cryptography and Security

Authors: H. Gopalakrishna Gadiyar , R. Padma

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.

Keywords

ordinary differential equations partial differential equations painlevé equations

Cite

@article{arxiv.1608.07032,
  title  = {The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem},
  author = {H. Gopalakrishna Gadiyar and R. Padma},
  journal= {arXiv preprint arXiv:1608.07032},
  year   = {2016}
}