Most programmers aren't aware of this - but we actually don't really know if one-way functions can actually exist. So all hash algorithms might be built on a fa

Most programmers aren't aware of this - but we actually don't really know if one-way functions can actually exist. So all hash algorithms might be built on a false and faulty premise. In fact, whether a good hash algorithm can actually exist, is related to P = NP: http://www.cs.cornell.edu/courses/cs6830/2009fa/scribes/lecture5.pdf http://www.cs.cornell.edu/courses/cs6830/2009fa/scribes/lect...