I am searching info on dependencies between different hash functions.
Let's say that we have a set of x hashes H1, H2 ... Hn (using different hashing functions) of the same string S. For every hash we can find collision in some time T1, T2 ... Tn
It seems logical that finding collision for every hash in set will take time T = T1+T2+..Tn
On the other hand, every hash exposes additional information on string, thus there is a possibility that some hashes could have properties which can speed up finding collision in another hash (to give a simplified example, something like "if md5 ends with 1111 then last bit of sha1 must be 0")
So, question is, if there exists any research on that subject (or maybe a proof or counter -proof that such dependencies exists for some hashing alghoritms) ?