Mapping arbitrary strings to hashes of 10 character length – time to crack it and collision probability
I would like to map strings of arbitrary length to hashes of 10 character length.
The length of the alphabet is of 64 characters (0-9, A-Z, a-z, _, -).
Obviously 2 same strings must produce the same hash.
I have the following doubts: