[Cryptography] MATH: Unlikely correctness of paper will break some discrete logarithm over F_p^*

[Daniel Robinson]

Ramanathan != Ramanujan...

At any rate, Andrew Poelstra e-mailed the Curves list about some fatal
flaws he found in this paper:
https://moderncrypto.org/mail-archive/curves/2016/000739.html



On Thu, Sep 1, 2016 at 2:27 PM Viktor Dukhovni <cryptography at dukhovni.org>
wrote:

> On Wed, Aug 31, 2016 at 11:33:25AM +0300, Georgi Guninski wrote:
>
> > https://arxiv.org/abs/1608.07032
> > The Discrete Logarithm Problem over Prime Fields can be
> > transformed to a Linear Multivariable Chinese Remainder
> > Theorem
>
> > I am pretty sure if this paper is fixable, it will efficiently break
> > DLs over F_p^* at least for primes of the form p=2q+1 with q prime.
> >
> > Is the paper fixable?
>
> It is not a serious paper, it is some sort of joke.  Just not clear
> whether it was composed by a human or machine generated.
>
> Shoddy mathematics aside, the final dedication:
>
>     This paper is dedicated to S. Ramanathan on his birth centenary.
>     The second author is his daughter and the first author is his
>     son-in-law.
>
> is nonsense, Ramanujan was born in 1887, so the paper would have
> to have been from 1987, and Ramanujan had no children.
>
> --
>         Viktor.
> _______________________________________________
> The cryptography mailing list
> cryptography at metzdowd.com
> http://www.metzdowd.com/mailman/listinfo/cryptography
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20160901/b9773237/attachment.html>