Timeline for Is there a fast way to solve $k = n \cdot g^a \mod P$? (get $a$ for unknown $n$)
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2019 at 17:51 | history | edited | J. Doe | CC BY-SA 4.0 |
deleted 12 characters in body
|
| May 7, 2019 at 14:37 | history | edited | J. Doe | CC BY-SA 4.0 |
added 152 characters in body
|
| May 6, 2019 at 16:51 | vote | accept | J. Doe | ||
| May 6, 2019 at 12:10 | answer | added | poncho | timeline score: 2 | |
| May 6, 2019 at 10:19 | history | edited | J. Doe | CC BY-SA 4.0 |
added 2 characters in body
|
| May 6, 2019 at 10:09 | history | asked | J. Doe | CC BY-SA 4.0 |