Consider a hash function H : $\{0,1\}$

$\{0,1\}$

n

$.$ If the input is an n$-$bit string

we assign H$($x$)=$ x $$ opad where opad is a fixed, publicly available string.

For all the other inputs we assign more complicated outputs. Can this be a

good hash function?

proof mathematically