This is more of a theoretical rather than a practical question. To give a bit of background, the discussion at work has come up with what to set our password complexity to and what the logistics would be if a DB was stolen (for this situation lets say I have 1000 passwords in md5).
I've done the following math (no idea if I'm correct)
hashrate (H/s)
GTX 1080ti 43750000000
Size length keyspace Total(comb) build time in days
8 lower 26 2.08827E+11 5.52453E-05
10 lower+upper 52 1.44555E+17 38.24209152
11 lower+upper+numeric 62 5.20366E+19 13766.2859
hashrate(H/s)-https://gist.github.com/epixoip/a83d38f412b4737e99bbef804a270c40
8 gpu cards 3.5E+11
Size length keyspace Total build time in days
8 lower 26 2.08827E+11 6.90566E-06
10 lower+upper 52 1.44555E+17 4.78026144
11 lower+upper+numeric 62 5.20366E+19 1720.785737
Since hashcat is just brute forcing I can assume that the build time would be the same as my crack time? How can I calculate how long it would take rainbow tables to crack the DB