3 ms·
>Yes, if you assume that your keys are going to be arbitrarily long inputs. No, it only requires that they lengthen enough to be distinct for the keyspace size
by SilasX 6y ago
>Yes, if you assume that your keys are going to be arbitrarily long inputs.
No, it only requires that they lengthen enough to be distinct for the keyspace size. The problem arises not from arbitrarily big keys but from the fact that, whatever your keys are, if want a longer output of the hash function, you have to do more computations on the keys.
- SilasX 6y agoLate follow-up: argh, I should really have been referring to values (the output of a hash function) rather than keys, because that determines where they go in memory block used for the hash table.