[Cryptography] Crown Sterling debunked

Viktor Dukhovni cryptography at dukhovni.org
Mon Sep 30 02:43:44 EDT 2019

> On Sep 30, 2019, at 2:41 AM, Stephan Neuhaus <stephan.neuhaus at zhaw.ch> 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.


More information about the cryptography mailing list