Timeline for Why are elliptic curves over a field of characteristic 2 or 3 insecure?
Current License: CC BY-SA 3.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 9, 2018 at 8:52 | vote | accept | user1868607 | ||
Jun 9, 2018 at 2:35 | answer | added | Squeamish Ossifrage | timeline score: 2 | |
Jun 29, 2017 at 4:35 | comment | added | Charles | @SamuelNeves You're right, how careless of me. I've removed the comment. | |
Jun 25, 2017 at 14:06 | comment | added | Samuel Neves | @Charles Those are a different kind of discrete logarithms, they do not concern elliptic curve discrete logarithms except in some rare specialized cases, e.g., low embedding degree. | |
Jun 12, 2017 at 15:39 | comment | added | Lery | At least in the case of pairing-based cryptography, the pairing-friendly curves in small characteristic are broken because of Joux result combined with the MOV attack, since those curves were all supersingular ones. | |
Jun 11, 2017 at 10:28 | comment | added | Maarten Bodewes♦ | Note that there is a lot of space between "insecure" in the title and "big concerns" in the quote. "big concerns" could already have been exaggerated somewhat and "insecure" would then apply even less. | |
Jun 10, 2017 at 21:28 | comment | added | Samuel Neves | The usual reason to distrust low-characteristic elliptic curve groups is the Petit-Quisquater result, which suggests the discrete logarithm might be subexponential there. But as far as I know, the real-world relevance of this result is still in question. | |
Jun 10, 2017 at 16:53 | history | edited | yyyyyyy | CC BY-SA 3.0 |
fix typos; add tag
|
Jun 10, 2017 at 16:43 | history | tweeted | twitter.com/StackCrypto/status/873581327941087232 | ||
Jun 10, 2017 at 15:29 | comment | added | user47922 | Not a full answer, but here's an attack on characteristic three curves involving Weil descent. | |
Jun 10, 2017 at 13:54 | comment | added | fgrieu♦ | This is flying quite above my head, but my understanding is that the Joux results apply to some level for small characteristics larger than two. Try his bibliography on Discrete Logarithms. | |
Jun 10, 2017 at 12:01 | comment | added | user1868607 | @fgrieu That certainly addresses the first question, thanks. What about characteristic 3? | |
Jun 10, 2017 at 12:00 | comment | added | fgrieu♦ | Related question. | |
Jun 10, 2017 at 11:41 | history | asked | user1868607 | CC BY-SA 3.0 |