Re:How Hash Algorithms Work (2007)
by Ar-Curunir on Friday January 13, 2017 @12:21PM
(#13392543)
you could easily define hash functions that work over A..Z if you wanted; there's nothing special about that.
The misleading part is about the reduction to a unique fixed length string; that's not possible unless the input domain is equal to (or smaller than) the output domain (and even then it's not necessary). Any other function is guaranteed to have collisions.
The misleading part is about the reduction to a unique fixed length string; that's not possible unless the input domain is equal to (or smaller than) the output domain (and even then it's not necessary). Any other function is guaranteed to have collisions.