[8867] in cryptography@c2.net mail archive

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

Re: septillion operations per second

daemon@ATHENA.MIT.EDU (Mike Brodhead)
Thu Jun 21 10:45:36 2001

Message-Id: <200106202050.f5KKoqE10754@valis.black-ice.org>
Reply-To: mkb@black-ice.org
To: Barry Wels <crypto6@nah6.com>
Cc: cryptography@wasabisystems.com
In-Reply-To: Your message of "Wed, 20 Jun 2001 12:16:57 +0200."
             <4.2.0.58.20010620115736.00b3ddb0@pop.xs4all.nl> 
Date: Wed, 20 Jun 2001 13:50:52 -0700
From: Mike Brodhead <mkb@black-ice.org>


> If they ever build such a computer (or 1.000.000 of them) what would that mean for today's key lengths ?
> I am curious how long a computer capable of a septillion operations per second would take to crack one 128 bit or 256 bit key.
> Or a RSA 1024 or 2048 bit key for that matter ...

take a peek at the chapter on key lengths in Schneier's Applied
Cryptography.  it is an entertaining read.  in short, he makes the
case that computers as we understand them simply cannot conduct brute
force attacks against 128-bit or larger semetric keys.  (i won't
repeat his explanation here.)

RSA keys are a bit dodgier.  new techniques for prime number factoring
could conceivably weaken keys that are considered strong today.

having said all that, there are often weaknesses other than key
length: predicting the key generation, keystroke monitoring, bribing
your system administrator, etc.

--mkb





---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com

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