So given some (any length!) input (p1), a Hash will create a finite length output (z1). This output is such that p1 = z1, while p2 != z1. the margin of difference between p1 and p2 can be very very very small, and yet the probability is that the hash z1 = p1 will be *very very different* from z1 = p2. But it is not *impossible* for some p1 to be unequal to p2 but for both to have the same hash z1 = z2.
Posted on: Sat, 31 Aug 2013 08:33:55 +0000
Trending Topics
Recently Viewed Topics
© 2015