Re: Crown Sterling debunked
Viktor Dukhovni <[email protected]> Mon, 30 Sep 2019 02:43:44 -0400
| Newsgroups | gmane.comp.encryption.general |
|---|---|
| Message-ID | <[email protected]> |
> On Sep 30, 2019, at 2:41 AM, Stephan Neuhaus <[email protected]> wrote: > > Another nitpick: The problem (as in "discrete-log problem") is rather to > recover $n$ from $x$ and $x^n$, isn't it? Recovering $x$ from $n$ and > $x^n$ would be called root-taking, IMO. Yes, sorry a silly typo on my part. -- Viktor. _______________________________________________ The cryptography mailing list [email protected] https://www.metzdowd.com/mailman/listinfo/cryptography