MATH: Unlikely correctness of paper will break
discrete logarithm over F_p^*
https://arxiv.org/abs/1608.07032
The Discrete Logarithm Problem over Prime Fields can be
transformed to a Linear Multivariable Chinese Remainder
Theorem
H. Gopalakrishna Gadiyar, R. Padma
(Submitted on 25 Aug 2016)
If this paper is fixable, it will break at least some (if not all)
DL instances in F_p^* (DH, DSA???, El Gamal).
There are implicit assumptions like 0 \lt n \lt p (and possibly
0< \lt beta_n \lt p).
Keywords for breaking after it:
integer programming, fixed number of variables, complexity
Posted by sumthing s broken |
Permanent link