Re: Why unhashing is not possible?

In article <Q9fdj.23104$wy2.2782@edtnps90>,
Unruh <unruh-spam@xxxxxxxxxxxxxx> wrote:

[hashing]

Yes. It is mathematically clear that if the input is longer than the
output, then the output cannot be different for all inputs. It can be
different for all inputs you happen to ever try.

Hash alphabetic ASCII characters into octets, preserving case.
52**4 < 256**3 so quartets of alphabetic ASCII characters fit into
triplets of octets. The input is longer than the output, and yet
the output is unique.

Your "mathematically clear" statement needs to be reinforced with
a stricter definition of "all inputs", and what it means for an
input to be "longer than the output".

.