[6162] in cryptography@c2.net mail archive
rate of finding collisions
daemon@ATHENA.MIT.EDU (staym@accessdata.com)
Wed Dec 1 14:18:13 1999
From: staym@accessdata.com
Message-ID: <3845457C.4E46@accessdata.com>
Date: Wed, 01 Dec 1999 08:57:48 -0700
MIME-Version: 1.0
To: cryptography@c2.net
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
On average, you'll find one N-bit collision after looking at O(2^(N/2))
random N-bit strings; how long does it take, on average, to find k
collisions? O(k*2^(N/2))?
--
Mike Stay
Programmer / Crypto guy
AccessData Corp.
mailto:staym@accessdata.com
