Timeline for Logjam on Elliptic Curves?
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 29, 2015 at 16:15 | vote | accept | SEJPM | ||
May 23, 2015 at 0:34 | answer | added | Samuel Neves | timeline score: 12 | |
May 22, 2015 at 22:49 | history | tweeted | twitter.com/#!/StackCrypto/status/601882577830617088 | ||
May 22, 2015 at 18:37 | comment | added | SEJPM | @cpast, so it's not as much broken as prime-field DH, but still, an overview over the available pre-computation algorithms and their speed relations would be nice and was asked. | |
May 22, 2015 at 18:26 | comment | added | cpast | According to the Logjam paper, "Current elliptic curve discrete log algorithms for strong curves do not gain as strong an advantage from precomputation." | |
May 22, 2015 at 18:19 | history | asked | SEJPM | CC BY-SA 3.0 |