Timeline for $2^{64}$ versions of the same message
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 6, 2021 at 16:21 | history | edited | kelalaka | CC BY-SA 4.0 |
correction (Thanks to Fgriue) and added the formal link.
|
| Nov 5, 2021 at 18:49 | history | edited | kelalaka | CC BY-SA 4.0 |
It is hash and sign paradigm,
|
| Oct 15, 2021 at 11:04 | comment | added | kelalaka | @jjj better now? | |
| Oct 15, 2021 at 11:04 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Oct 15, 2021 at 10:54 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Oct 15, 2021 at 10:38 | comment | added | jjj | Oh, missed that. I still think it is worth mentioning that for this example one normally would have a given hash and therefore one fixted message. | |
| Oct 15, 2021 at 10:32 | comment | added | kelalaka | @jjj the texts say (modifying two messages), and I made a simple argument to combine all of the variants of $x_1$ and $x_2$ into a set and look for collision as birthday bound. If one is fixed then it is a secondary pre-image attack. Didn't I say hash and sign? | |
| Oct 15, 2021 at 7:30 | comment | added | jjj | I don't think they are talking about a birthday attack. One message seems to be fixed, otherwise one could modify both at 64 positions, making it 2^64 different versions each. Also the attack only makes sense, when x1 has been authorized somehow (for example, hash has been signed). | |
| Oct 14, 2021 at 16:25 | vote | accept | Slim Shady | ||
| Oct 14, 2021 at 15:59 | history | answered | kelalaka | CC BY-SA 4.0 |