[6163] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: rate of finding collisions

daemon@ATHENA.MIT.EDU (staym@accessdata.com)
Wed Dec 1 14:31:45 1999

From: staym@accessdata.com
Message-ID: <38454607.5504@accessdata.com>
Date: Wed, 01 Dec 1999 09:00:07 -0700
MIME-Version: 1.0
To: cryptography@c2.net
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit

I wrote:
>O(k*2^(N/2))?

It has to be faster than that by a counting argument.  How much faster?
-- 
Mike Stay
Programmer / Crypto guy
AccessData Corp.
mailto:staym@accessdata.com


home help back first fref pref prev next nref lref last post