linux-kernel - Re: If not readdir() then what?

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:	Wed, 11 Apr 2007 15:06:44 -0700 (PDT)
From:	David Lang <david.lang@...italinsight.com>
To:	Neil Brown <neilb@...e.de>
cc:	Theodore Tso <tytso@....edu>,
	Jörn Engel <joern@...ybastard.org>,
	"H. Peter Anvin" <hpa@...or.com>,
	Christoph Hellwig <hch@...radead.org>,
	Ulrich Drepper <drepper@...il.com>,
	Linux Kernel Mailing List <linux-kernel@...r.kernel.org>
Subject: Re: If not readdir() then what?

On Thu, 12 Apr 2007, Neil Brown wrote:

> For the second.
>  You say that you " would need at least 96 bits in order to make that
>  guarantee; 64 bits of hash, plus a 32-bit count value in the hash
>  collision chain".  I think 96 is a bit greedy.  Surely 48 bits of
>  hash and 16 bits of collision-chain-position would plenty.  You would
>  need 65537 entries before a collision was even possible, and
>  billions before it was at all likely. (How big does a set of 48bit
>  numbers have to get before the probability that "No subset of 65536
>  numbers are all the same" drops below 0.95?)

Neil,
   you can get a hash collision with two entries.

David Lang
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/