On 2012-03-09, natanae...@gmail.com wrote:
On #2: There MUST be collisions with fixed-length hashes. But with 2^256
possible results and sufficiently strong algorithms, it will not matter IRL.
We
won't find any collisions ever. But of course, the algorithms MIGHT be weak.
MD5 was thought to
He actually asked two different questions on #2, if all hashes have collisions
and if all messages have collisions. For MD5, the latter is almost proven
true. There's a tool that let you enter two plaintexts, and then it generates a
shared appended string (like
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Mar 9, 2012, at 3:25 AM, Florian Weingarten wrote:
Hello list,
first, excuse me if my questions are obvious (or irrelevant).
No, they're interesting and subtle.
I am interested in the following questions. Let h be a cryptographic
hash
On Sat, Mar 10, 2012 at 7:28 PM, Jon Callas j...@callas.org wrote:
2) Is it known if every (valid) digest has always more than one
preimage? To state it otherwise: Does a collision exist for every
message? (i.e., is the set h^{-1}(x) larger than 1 for every x in the
image of h?).
Sure, by
