rate of finding collisions

[staym]

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:[EMAIL PROTECTED]