Timeline for How hard is finding the discrete logarithm?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 1, 2017 at 15:46 | answer | added | danxinnoble | timeline score: 4 | |
| Feb 18, 2014 at 22:40 | vote | accept | Matt Groff | ||
| Jul 16, 2012 at 15:19 | answer | added | Niel de Beaudrap | timeline score: 23 | |
| Jul 11, 2012 at 16:37 | history | tweeted | twitter.com/#!/StackCompSci/status/223093757166366720 | ||
| Jul 10, 2012 at 19:50 | answer | added | Xodarap | timeline score: -1 | |
| Jul 10, 2012 at 10:25 | comment | added | Marc Bury | I don't know what is the best algorithm, but you can find some algorithms in chapter 5 of this lecture notes by Johan Hastad. I would summarize these algorithms but I didn't read this chapter, so I only provide the link ;) | |
| Jul 9, 2012 at 23:57 | history | edited | Matt Groff | CC BY-SA 3.0 |
Added description stating I'm looking for more detail...
|
| Jul 9, 2012 at 17:33 | history | asked | Matt Groff | CC BY-SA 3.0 |