Timeline for Security of Pohlig-Hellman exponentation cipher?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2020 at 7:36 | history | edited | kelalaka | CC BY-SA 4.0 |
edited tags
|
| Feb 5, 2014 at 16:13 | history | edited | Cryptographeur |
edited tags
|
|
| Dec 11, 2013 at 23:45 | history | edited | e-sushi |
Added "pohlig-hellman" tag.
|
|
| Mar 3, 2013 at 21:42 | vote | accept | ThePiachu | ||
| Mar 3, 2013 at 19:28 | answer | added | D.W. | timeline score: 10 | |
| Mar 3, 2013 at 10:31 | history | tweeted | twitter.com/#!/StackCrypto/status/308162610837192704 | ||
| Mar 2, 2013 at 22:58 | comment | added | Thomas | Looking at the requirements for the hardness of the discrete logarithm problem (DLP) would be a good start. Indeed, $p$ needs to be chosen with care, a large random prime simply won't do. Size is only half of the story. As in $\log{(p)}$, I mean. | |
| Mar 2, 2013 at 17:22 | history | asked | ThePiachu | CC BY-SA 3.0 |