Timeline for Diffie-Hellman, random number size
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 21, 2016 at 21:26 | answer | added | Yehuda Lindell | timeline score: 7 | |
| Aug 19, 2016 at 23:18 | history | tweeted | twitter.com/StackCrypto/status/766776287356739584 | ||
| Aug 19, 2016 at 19:52 | vote | accept | Kroma | ||
| Aug 19, 2016 at 11:17 | comment | added | CodesInChaos | @fgrieu I prefer operating in prime order groups. Feels simpler and cleaner, a single extra squaring is nearly free. Since the attacker can learn the value of the LSB anyways, it doesn't add any security, so in a way you actually save a multiplication. | |
| Aug 19, 2016 at 9:07 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
mprove typography of title
|
| Aug 19, 2016 at 9:00 | answer | added | fgrieu♦ | timeline score: 7 | |
| Aug 19, 2016 at 9:00 | comment | added | Maarten Bodewes♦ | Answers guys, we'll help with comments, upvotes and downvotes. | |
| Aug 19, 2016 at 8:29 | comment | added | fgrieu♦ | @CodeInChaos: why fix the parity? I we can solve $g^x\equiv a\pmod p$ for unknown random even $x$ of some size with non-negligible probability, then we can solve it for odd $x$ of similar size with similar probability using practically the same amount of work (only an extra multiplication of $a$ by $g$ and adjustment of $x$ by 1 is needed); and vice versa. | |
| Aug 19, 2016 at 7:09 | history | edited | CodesInChaos | CC BY-SA 3.0 |
deleted 14 characters in body
|
| Aug 19, 2016 at 7:08 | comment | added | CodesInChaos | I'd generate a random integer at least twice as long as the security level and mask out the least significant bit to make it even. | |
| Aug 19, 2016 at 6:48 | history | edited | Kroma | CC BY-SA 3.0 |
added 5 characters in body
|
| Aug 19, 2016 at 6:31 | history | asked | Kroma | CC BY-SA 3.0 |