Timeline for How difficult is it to find the "pre-image" of a block cipher?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2013 at 5:33 | history | tweeted | twitter.com/#!/StackCrypto/status/358821959850663937 | ||
| Jul 20, 2013 at 19:32 | comment | added | minar | Some precisions about your question would be useful. 1. As written, the natural interpretation is to consider that $M_1$ is a single-block message. It is really what you intended ? 2. When you say a plaintext $M_2$, people here understand that $M_2$ can be an arbitrary binary string of the right length. Did you intend to say a meaningful message ? If so, you need to add a description of what is acceptable. | |
| Jul 20, 2013 at 19:12 | answer | added | orlp | timeline score: 9 | |
| Jul 20, 2013 at 14:31 | comment | added | CodesInChaos | @samoz If $M_2$ isn't fixed then Thomas' suggestion works for every key. | |
| Jul 20, 2013 at 14:05 | comment | added | foobarfuzzbizz | Or better yet, what about the scenario where $M_1$ and $M_2$ are fixed. | |
| Jul 20, 2013 at 14:01 | comment | added | foobarfuzzbizz | @Thomas I guess I'm asking is there a way to do this without enumerating the entire key space... | |
| Jul 20, 2013 at 13:54 | comment | added | Thomas | Pick any key $k_2$ and decrypt $C_1$ to obtain $M_2$. | |
| Jul 20, 2013 at 13:41 | history | asked | foobarfuzzbizz | CC BY-SA 3.0 |