Let us say that we take a sequence of the integers from
(a, a+1, a+2, a+n-1), where
n are picked arbitrarily and have no lower or upper bounds on either, except that
a < n, and we apply AES encryption to that sequence, one element at a time, utilizing the same key for each element in the sequence.
Assumption is that we encode the resulting ciphered values as
Base64 or some other encoding to produce strings.
Would the resulting set of encrypted strings have any, irrespective of how infinitesimally small, chance for collisions?