Timeline for Second stage of elliptic curve factorization via random walk/Pollard's rho in constant (or low) memory?
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2011 at 8:12 | answer | added | Steven Galbraith | timeline score: 2 | |
| Mar 8, 2011 at 15:51 | history | edited | jerr18 | CC BY-SA 2.5 |
Title, ring
|
| Mar 6, 2011 at 14:40 | history | edited | jerr18 | CC BY-SA 2.5 |
constant memory, ring is simpler
|
| Mar 6, 2011 at 14:34 | comment | added | jerr18 | @AVS yes, though something efficient like polynomial in log(n) will do too. | |
| Mar 6, 2011 at 14:24 | comment | added | AVS | I assume that by constant memory you mean $O(1)$ elements of $\mathbb{Z}/n\mathbb{Z}$, or $O(\log n)$ bits. | |
| Mar 6, 2011 at 13:24 | answer | added | AVS | timeline score: 2 | |
| Mar 6, 2011 at 10:05 | history | edited | jerr18 | CC BY-SA 2.5 |
tag random-walk
|
| Mar 6, 2011 at 8:02 | history | asked | jerr18 | CC BY-SA 2.5 |