Timeline for Is hyperelliptic cryptography "practical"?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 3, 2018 at 11:32 | comment | added | Alexey Ustinov | There is a good talk by Steven Galbraith on hyperelliptic pairings math.auckland.ac.nz/~sgal018/Pairing2007.pdf In particular hecompare elliptic and hyperelliptic cases. | |
| Feb 2, 2016 at 19:18 | vote | accept | Mikhail Bondarko | ||
| Feb 1, 2016 at 18:53 | answer | added | Max Horn | timeline score: 18 | |
| Feb 1, 2016 at 18:06 | comment | added | thel | I'd love to know what happened to Surface1271: cr.yp.to/hecdh.html -- as I understand it the genus 2 hyperelliptic Jacobians are expected to be a bit faster, but exact point counting on them is too difficult. There were some index calculus attacks against higher genus hyperelliptic Jacobians by Gaudry, Thériault, perhaps others. I think that the bottleneck here is really in the mathematicians' corner: exact point counting for ab vars over finite fields (via Schoof--figure out torsion mod small primes and appeal to Weil bounds) is still hard. Out of my depth here, salt liberally. | |
| Feb 1, 2016 at 17:51 | history | asked | Mikhail Bondarko | CC BY-SA 3.0 |