On 4 déc. 08, at 17:06, Florian Hars wrote:
Alan Schmitt schrieb:
But I don't think this applies here, as the hashes I'm
looking at are the one used by Unison to identify file contents.
Then it is *especially* relevant, as it is quite trivial to generate
several files with different content
Florian Hars wrote:
> Alan Schmitt schrieb:
>> But I don't think this applies here, as the hashes I'm
>> looking at are the one used by Unison to identify file contents.
>
> Then it is *especially* relevant, as it is quite trivial to generate
> several files with different content and the same MD
second.
--- On Thu, 12/4/08, Florian Hars <[EMAIL PROTECTED]> wrote:
> From: Florian Hars <[EMAIL PROTECTED]>
> Subject: Re: [Caml-list] Computing with big numbers?
> To: "Alan Schmitt" <[EMAIL PROTECTED]>
> Cc: [EMAIL PROTECTED]
> Date: Thursday, Dec
Alan Schmitt schrieb:
> But I don't think this applies here, as the hashes I'm
> looking at are the one used by Unison to identify file contents.
Then it is *especially* relevant, as it is quite trivial to generate
several files with different content and the same MD5 hash, all you
need is a Play
On 1 déc. 08, at 14:47, Dario Teixeira wrote:
I reckon that by saying "how good 128 bits MD5 hashes were"
you are aware of the recent attacks that make MD5's effective
security less than 128-bit. The Wikipedia has a good summary:
http://en.wikipedia.org/wiki/MD5
Thanks for the link. I knew of
On 1 déc. 08, at 13:52, Martin Jambon wrote:
If I understand your problem correctly, this is the so-called birthday
problem with 2^128 days in a year. The Wikipedia article gives useful
approximations:
http://en.wikipedia.org/wiki/Birthday_problem
Thank you for the link, this was very informa
Hi,
> In preparation for a talk I'm going to give, I wanted
> to estimate how good 128 bits MD5 hashes were: how many
> hashes must be taken before the probability for a collision
> become non negligible? (I'm assuming equi-probability of
> every hash.)
I reckon that by saying "how good 128 bits
Alan Schmitt wrote:
> Hello,
>
> In preparation for a talk I'm going to give, I wanted to estimate how
> good 128 bits MD5 hashes were: how many hashes must be taken before the
> probability for a collision become non negligible? (I'm assuming
> equi-probability of every hash.)
>
> The brute forc
