Timeline for SHA's finite character set and collision
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 11, 2018 at 13:47 | comment | added | AleksanderCH | Nitpicking: It‘s assumed that every hash value will collide, but you just can‘t be sure about that. There are certainly some hashes with collisions, but maybe there is a unknown flaw in the algorithm that would prevent the outcome of a certain hash value (or the possibility for infinite hashes for every possible hash-value). To reference the pigeonhole principle: There are 10 pigeons and 9 holes. It‘s certain that at least one hole has two or more pigeons. But they could also be one hole that is empty and one with three pigeons. | |
| Aug 10, 2018 at 15:07 | vote | accept | Subramanian Sridharan | ||
| Aug 10, 2018 at 14:44 | history | answered | Ella Rose | CC BY-SA 4.0 |