Clarifications about collisions and uniqueness

[hashimaziz1]

Firstly, thanks for a great package, I came across this from another package (I don't remember which) that was itself linked to from Hashids, so I'm hoping this turns out to be faster than both of them.

I know in another post you said something along the lines of "there are no collision rates", and I wanted to confirm whether that was limited to the context of that thread or whether it generally applies to Cryptomute hashes. Is the output guaranteed to always be free of collisions no matter what?

I'm looking to generate unique user-facing IDs using primary keys in a database as input, limited to 8 digits. I selected the aes-192-ecb cipher which doesn't have an IV, and set a range of 0, 99999999 for the length, plus padding. Can I expect this function to return none or low collisions, and would using a short password affect this? For that matter, is it a good idea to use another dynamic value in the database (such as email?) as a dynamic password, or does the password need to remain static?