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

H.  Gopalakrishna Gadiyar; R.  Padma

Paper 2016/836 Original: eprint.iacr.org/2016/836 ↗

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

H. Gopalakrishna Gadiyar

R. Padma

Abstract

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

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2016-09-03: last updated; 2016-09-03: published
Short URL: https://ia.cr/2016/836
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/836,
      author = {H.  Gopalakrishna Gadiyar and R.  Padma},
      title = {The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/836},
      year = {2016},
      url = {https://eprint.iacr.org/2016/836}
}