Hash function requirements

• Hash functions must be easy and fast to compute:

  • They must be computationally simple to compute in order to keep multiplicative constants in their Big-O notation small.
  • They must be algorithmically simple so that they run in the fastest time possible O(1) (or as close to this as possible.)