Timeline for Is there an efficient algorithm that allows to construct a cryptographically secure $n$-bit hash function based on two unkeyed $n$-bit permutations?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 27, 2020 at 6:45 | comment | added | Yehuda Lindell | The XOR of two pseudorandom permutations is a pseudorandom function (and that's what the link shows). It says nothing about collision resistance. | |
| Feb 27, 2020 at 5:22 | comment | added | lyrically wicked | And even the security of the XOR of two permutations cannot help to construct the desired hash function? | |
| Feb 26, 2020 at 11:28 | history | edited | Yehuda Lindell | CC BY-SA 4.0 |
added 171 characters in body
|
| Feb 26, 2020 at 11:27 | comment | added | Yehuda Lindell | You need an ideal assumption. I just noticed that this was actually in the question, so my answer is wrong. I will update. | |
| Feb 26, 2020 at 10:24 | comment | added | SEJPM | How do sponge-based hashes fit into this picture? | |
| Feb 26, 2020 at 10:22 | history | answered | Yehuda Lindell | CC BY-SA 4.0 |