Timeline for Understanding Baby-Step Giant-Step Algorithm and discrete logarithm
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 3, 2019 at 12:50 | vote | accept | Laura | ||
| Apr 2, 2019 at 14:41 | answer | added | poncho | timeline score: 3 | |
| Apr 2, 2019 at 14:13 | comment | added | Laura | can you explain more detail about 2(b) ? I read the Polih-Hellman, is it because subgroup of prime order q is hard to compute , thus it cannot apply the Chinese remainder theorem to recover the final solution x ?Is there no any efficient algorithm to solve DLP in group of prime order? | |
| Apr 2, 2019 at 13:46 | history | edited | Maarten Bodewes♦ | CC BY-SA 4.0 |
formatting
|
| Apr 2, 2019 at 13:38 | history | asked | Laura | CC BY-SA 4.0 |