Timeline for Is there necessarily an infinite number of inputs to any given output in a crypto hash function?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 16, 2020 at 14:43 | comment | added | kelalaka | In Cryptography, any bias can be exploitable. Yes, we can design one easily with an existing one. But nobody cares that as long as you are designing a backdoor, etc. Try to design one explicitly, without using an existing one and this or similar technique, it will be hards. In hash functions, while designing the avalanche property/effect is necessary. The random flip in the avalanche effect may imply the close to a uniform but I've no proof for that. | |
| Feb 16, 2020 at 13:28 | comment | added | Gabor Lengyel | Why do we expect "well-distributed output", which I guess would be ~as close to unifrom as possible. You have just shown a hash function that has all the necessary properties, but distribution is not uniform. How exactly is this less practical or less efficient than the known ones? Would known hash function's output only be "well-distributed", or would it actually be uniform? Could there be a hash function that somehow "makes sense" without the "well-distributed" property? I accepted the other answer as that more directly answered my original question, but yours was helpful too, appreciated. | |
| Feb 16, 2020 at 12:05 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Feb 16, 2020 at 6:29 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Feb 15, 2020 at 22:20 | history | answered | kelalaka | CC BY-SA 4.0 |