1996-04-14 - key bit lengths

Header Data

From: Jack Mott <thecrow@iconn.net>
To: cypherpunks@toad.com
Message Hash: cc2aaf2a24c4130908e65ff2e8e70e4c5a4ee3a363cb4eb83bde26b1188df1fc
Message ID: <31713CED.42E2@iconn.net>
Reply To: N/A
UTC Datetime: 1996-04-14 21:07:35 UTC
Raw Date: Mon, 15 Apr 1996 05:07:35 +0800

Raw message

From: Jack Mott <thecrow@iconn.net>
Date: Mon, 15 Apr 1996 05:07:35 +0800
To: cypherpunks@toad.com
Subject: key bit lengths
Message-ID: <31713CED.42E2@iconn.net>
MIME-Version: 1.0
Content-Type: text/plain


In Applied Crypto, it talks about thermodynamic limitations of brute 
force attacks.  I did some calculations and it looks like it will take, 
given a perfectly effecient computer, the combined energy of 509,485,193 
average supernovas to brute force a 256 bit key. I was just wondering if 
there are any theoretical ways around this. I am just talking about 
plain brute force here, not attacking other weaknesses.
-- 
thecrow@iconn.net
"It can't rain all the time"

RSA ENCRYPTION IN 3 LINES OF PERL
---------------------------------------------------------
#!/bin/perl -sp0777i<X+d*lMLa^*lN%0]dsXx++lMlN/dsM0<j]dsj
$/=unpack('H*',$_);$_=`echo 16dio\U$k"SK$/SM$n\EsN0p[lN*1
lK[d2%Sa2/d0$^Ixp"|dc`;s/\W//g;$_=pack('H*',/((..)*)$/)





Thread