How to calculate the time it takes to crack a password?

Question

Encryption

Let's say there is hardware that sorts out 33100000000 options per second and they gave an md5 hash for the search, about which nothing is known.
But it is known that all possible md5 values ​​are maximum 2^128, i.e .: 340282366920938463463374607431768211456 And how to calculate taking into account the collision, because one hash can have several lines, but you need to find out all the lines that fall under this md5 hash?

Answer 1

Well, divide one by the other - and get the number of seconds.
similarly with collisions. you have the length of the string and the character set. Count the number of combinations, divide by the search speed - profit.

Answer 2

because one string can have multiple hashes

Wrong, this set of strings can have the same hash

you need to find out all the lines that fall under this md5 hash

There are an infinite number of such lines, it is impossible to know everything in principle

Answer 3

2^128/33100000000=1.028043405×10²⁸/(3600*24*365)=3.259904251×10²¹ years Well,
not one row has multiple hashes, multiple rows have the same hash, but it's not important for you to guess the same password , you need it to satisfy the hash condition
habrahabr.ru/post/110809
https://github.com/VladX/md5-bruteforcer
if we assume that the password is ASCII, then for a 20 character password the values ​​are slightly smaller, 64^20=1, 329227996×10³⁶
there are dictionaries, for several gigabytes, where typical passwords are collected