Problem: A well designed hash function normally has multiple properties, including collision resistance, which means it is very hard for one to find a pair of inputs x≠y, such that h(x) = h(y). Could we just use a collision resistant function to do encryption? i.e., Enc(k,m)=f(k,m), where f is a collision resistant function.