Timeline for How do hashes really ensure uniqueness?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 14, 2020 at 7:47 | comment | added | Maarten Bodewes♦ | "It's not impossible but (good) hashes in use currently today are infeasible to brute force" that depends on the size of the input domain. Kerckhoff's principle and Shannon's maxim are specifically about ciphers. "A lot of hashes, at some point or another, rely on a modulo operation." ... no, not for security, you cannot wave that as a magic wand. That demo uses modulo operations only for a simple explanation, not to discuss secure hash internals. | |
| Oct 23, 2018 at 15:34 | history | edited | RobIII | CC BY-SA 4.0 |
deleted 63 characters in body
|
| Oct 22, 2018 at 16:39 | history | edited | RobIII | CC BY-SA 4.0 |
added 208 characters in body
|
| Oct 22, 2018 at 16:31 | history | edited | RobIII | CC BY-SA 4.0 |
added 237 characters in body
|
| Oct 22, 2018 at 16:21 | history | edited | RobIII | CC BY-SA 4.0 |
added 285 characters in body
|
| Oct 22, 2018 at 16:15 | review | First posts | |||
| Oct 22, 2018 at 20:49 | |||||
| Oct 22, 2018 at 16:12 | history | answered | RobIII | CC BY-SA 4.0 |