[svn.haxx.se] · SVN Dev · SVN Users · SVN Org · TSVN Dev · TSVN Users · Subclipse Dev · Subclipse Users · this month's index

Re: Antwort: Re: ... Re: dangerous implementation of rep-sharing cache for fsfs

From: Daniel Shahaf <d.s_at_daniel.shahaf.name>
Date: Thu, 1 Jul 2010 17:41:23 +0300 (IDT)

Mark Mielke wrote on Thu, 1 Jul 2010 at 10:40 -0400:
> I read that article several years ago. Correct me if I am wrong - but the
> article does not describe a "real world collision". It describes how it is
> technically possible to find a collision in fewer than previous thought
> sample.

Yeah. And in general, these results have a tendency of using "2**n time
and space"... (don't know if this one too; haven't studied the details)

Fortunately hard disks of 2**70 bytes are still scarce :)

> Where "find" does not mean real world document. It's still theoretical
> that a real life a.c will collide with a real life z.jpg in the same
> repository.

On a tangent... what's the state of the art in finding almost-collisions?
e.g., to find two datas whose sha1's agree on X bits? (X < 160)
Received on 2010-07-01 16:59:19 CEST

This is an archived mail posted to the Subversion Dev mailing list.