Timeline for What are the properties of secure Elliptic Curves?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 7, 2021 at 7:34 | history | edited | CommunityBot |
replaced https://tools.ietf.org/html/rfc with https://www.rfc-editor.org/rfc/rfc
|
|
| May 30, 2018 at 15:25 | comment | added | Squeamish Ossifrage | @ThomasPornin Usually that's called the Brier–Joye ladder, not the Montgomery ladder, and yes, it creates a conflict between performance and security. (SafeCurves even addresses it!) | |
| May 30, 2018 at 15:22 | comment | added | Thomas Pornin | In fact there is a way to use a Montgomery ladder on Weierstraß curves like P-256. As usual, Marc Joye was involved: link.springer.com/content/pdf/10.1007%2F3-540-45664-3_24.pdf But it is not very efficient, so people don't use it in practice. | |
| May 30, 2018 at 14:17 | history | answered | Squeamish Ossifrage | CC BY-SA 4.0 |