Re: Crown Sterling debunked
Phillip Hallam-Baker <[email protected]> Tue, 24 Sep 2019 10:14:02 -0400
| Newsgroups | gmane.comp.encryption.general |
|---|---|
| Message-ID | <CAMm+LwjMLfs-eA2d8Fm+aOsindYgyHOKpEDcTxuQYG9pwP_ujQ@mail.gmail.com> |
On Tue, Sep 24, 2019 at 1:49 AM Stephan Neuhaus <[email protected]> wrote: > Good writeup! I especially like the use of the work factor to estimate > difficulty. > > Technical nitpick though: perhaps you should speak of the "modular > integer and elliptic curve variants of Diffie-Hellman" instead of > "discrete log and elliptic curve" because both are discrete logs. > Are they? I can see that breaking the discrete log is going to affect elliptic curve DH. Or at least could do. But the ECDH problem is multiplication of a point by a scalar x.y.P == y.x.P. How does a logarithm come into it? extracting the private key from a public key would be solving the point division problem surely (x = x.P/P) ? Not saying you are wrong, just interested in the reasoning here. _______________________________________________ The cryptography mailing list [email protected] https://www.metzdowd.com/mailman/listinfo/cryptography