Timeline for Pollard's rho algorithm for ECDLP using supersingular elliptic curves over a field with characteristic equal to a Mersenne prime
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2023 at 11:35 | comment | added | Ben Smith | As @joro suggests, you can solve DLPs faster on these particular curves using the Pohlig-Hellman algorithm. (For supersingular curves in general, you can use the Menezes-Okamoto-Vanstone reduction to map the problem to a finite field discrete log and solve faster there.) But if you're doing this to study Pollard rho, then this really looks like a subtle problem with your partition function (and/or your choice of "steps") rather than the rho algorithm itself. Try hashing a canonical representative for the point and then taking the result mod 3, to get a proper "random" division into 3 sets. | |
| Oct 22, 2023 at 8:32 | comment | added | joro | If p is Mersenne prime then p+1 is power of 2 and the group order is 2-smooth. Why don't you try small subgroup algorithm and solve the DL in time log(p)? | |
| S Oct 22, 2023 at 0:54 | review | First questions | |||
| Oct 22, 2023 at 6:20 | |||||
| S Oct 22, 2023 at 0:54 | history | asked | Anton Odina | CC BY-SA 4.0 |