From what I've researched, SHA's hex encoded string contains the characters
[a-fA-F0-9]. If we represent it in Base64, it can contain
So the number of possible hash permutations are
My question is, while we have infinite permutations for the input text, if the output hash is finite, then aren't all SHA algorithms meant to collide at some point?
I'm self taught. So please bear if this is a basic thing in cryptography.