Timeline for Randomized Hash function with no collisions
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2018 at 8:15 | answer | added | Thelema | timeline score: 0 | |
| Apr 12, 2017 at 7:31 | history | edited | CommunityBot |
replaced http://programmers.stackexchange.com/ with https://softwareengineering.stackexchange.com/
|
|
| Apr 26, 2014 at 23:45 | comment | added | user22815 | A function with no collisions and the output length depending on the input length seems more like a true encryption algorithm than a hash algorithm to me. Something like AES would meet your requirement. | |
| Apr 26, 2014 at 21:54 | answer | added | Nicholas White | timeline score: 1 | |
| Apr 26, 2014 at 20:59 | vote | accept | iordanis | ||
| Apr 26, 2014 at 20:43 | comment | added | aaaaaaaaaaaa | For what purpose do you need such a function? | |
| Apr 26, 2014 at 18:55 | answer | added | Brian | timeline score: 4 | |
| Apr 26, 2014 at 18:35 | comment | added | user7043 |
It's a permutation of the space of possible strings. In other words, a permutation of a, b, c, ..., z, aa, bb, ..., zzz might be hro, z, , fas, ..., mfx, so that in function form f(a) = hro, f(b) = z, f(zzz) = mfz. It's a bijective mapping of strings. Block ciphers are commonly considered a family of permutations/bijective maps (one for each key), though with constraints that differ slightly from yours.
|
|
| Apr 26, 2014 at 18:32 | review | First posts | |||
| Apr 26, 2014 at 18:52 | |||||
| Apr 26, 2014 at 18:31 | comment | added | iordanis | @delnan that is a very interesting way to think about it. But a permutation won't map data, it will just permute a random string. | |
| Apr 26, 2014 at 18:25 | comment | added | user7043 | That's not a hash function, that's a permutation. | |
| Apr 26, 2014 at 18:15 | history | asked | iordanis | CC BY-SA 3.0 |