Timeline for Discrete logarithm over prime modulo: small input, large exponent, larger prime
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 8, 2015 at 13:15 | answer | added | tylo | timeline score: 0 | |
| May 7, 2015 at 18:46 | answer | added | Fractalice | timeline score: 1 | |
| May 2, 2015 at 0:51 | history | tweeted | twitter.com/#!/StackCrypto/status/594303049121865728 | ||
| Apr 30, 2015 at 21:20 | comment | added | Aleph | Carefully consider properties such as H(m1⋅m2)≡H(m1)⋅H(m2). They may be problematic for a hash function. | |
| Apr 30, 2015 at 18:45 | comment | added | robinw | @fgrieu Agreed: keyed one-way function. Say I choose $e$ to be relatively prime to $p-1$, which I believe narrows down the possibilities for $e$. Does the small input space provide any advantage in computing $e$? | |
| Apr 30, 2015 at 17:56 | comment | added | fgrieu♦ | That would not be a hash as usually defined, since part of its definition ($e$) is secret. Rather, that's a keyed one-way function; it is the encryption part of a cipher if $\gcd(e,p-1)=1$ | |
| Apr 30, 2015 at 17:45 | review | First posts | |||
| Apr 30, 2015 at 19:29 | |||||
| Apr 30, 2015 at 17:44 | history | asked | robinw | CC BY-SA 3.0 |