But I am missing something about the rainbow tables; how can one be sure that the hashes for all valid passwords are covered by the table ?
Lets say the passwords are 8 characters are long from [a-z][A-Z][0-9]. If I am constructing a rainbow table with 10000 hash & reverse iteration in a chain how can I determine at what point the table is complete ? ie: the password and the final hash stored includes the hashes for all the 628 valid passwords somewhere in the chain ?
Is there a mathematical way to verify the completeness of a rainbow table ?