Properties of a good hash function

What is the property of a good hash function?

1. Even distribution

- Minimizes "collision" of keys

2. Irregularness

- Avoids collision of patterned inputs

(E.g., input of {0, 100, 200, 300} for the hash function h(k) = k % 100)