What is degree of randomness in individual bits of MD5 hash? I am researching on Hashing Algorithms and would like to know if we take individual bits of MD5, say we take first 8 bits or any random 8 bits of MD5 then what is the randomness probability of having same 8-bits (at exactly the same position) in any two different MD5 hashes ?

I´ve read somewhere that MD5 being good PRF has uniform randomness in each individual bit. Is this statement true? Also, is there any reference for this?
MD5 was designed with the goal that any change in the input uniformly affects all the bits of the output. It's not perfect, but it's pretty good. If you're choosing the input "randomly enough" (e.g., by appending random bits before hashing) then your question approaches this one: 


  Given two randomly generated 8-bit strings, what is the probability
  that they match?


This is $\frac{1}{2^{8}}$.

References: 


RFC 1321, Rivest's original description of the MD5 algorithm
How to Break MD5 and Other Hash Functions, by Wang and Yu
The same question
Again
Slightly differently
Yet again
And again