Re:How to defeat Ed25519 and EdDSA using faults
by cryptonector on Friday October 06, 2017 @04:32PM
(#15420208)
EdDSA is NOT online, but it's trivial to use it in an online way: sign a hash of the data rather than the data. But now you're back to having collisions (EdDSA is collision resistant). So it's a trade-off you have to make. As for DJB's take on this, there were lengthy debates about this on the CFRG list, and you find out for yourself (spoilers: he's very big on collision resistance). Of course, the need for online algorithms is real, but there's more than one way to skin that cat.
[ Parent
| on HN ]
Re:How to defeat Ed25519 and EdDSA using faults
by loup-vaillant on Saturday October 07, 2017 @03:35PM
(#15425305)
Do you have a link to those debates? I'm searching through the mailing list, no luck so far.
Re:How to defeat Ed25519 and EdDSA using faults
by cryptonector on Saturday October 07, 2017 @05:00PM
(#15425683)
The list archives are difficult to link to.
Look for posts around June 2015, e.g., with Subject:s like "Summary of the poll: Elliptic Curves - signature scheme: friendliness to low memory implementations" or subjects containing "IUF" (Init, Update, Final) here:
https://www.ietf.org/mail-archive/web/cfrg/current/mail5.htm...
(The archives' main page is https://www.ietf.org/mail-archive/web/cfrg/current/maillist....)