From: Mordy Ovits <movits@lockstar.com>
To: Fade <fade@mail1.i1.net>
Message Hash: 2de4527618e6b8186731653ffc867d3fb1ffcd623cc1e20b4de262009373f644
Message ID: <35E1D201.82D41E98@lockstar.com>
Reply To: <Pine.BSI.3.95.980824130502.222A-100000@mail1.i1.net>
UTC Datetime: 1998-08-24 20:43:56 UTC
Raw Date: Mon, 24 Aug 1998 13:43:56 -0700 (PDT)
From: Mordy Ovits <movits@lockstar.com>
Date: Mon, 24 Aug 1998 13:43:56 -0700 (PDT)
To: Fade <fade@mail1.i1.net>
Subject: Re: "Unbreakable Crypto" announcement??
In-Reply-To: <Pine.BSI.3.95.980824130502.222A-100000@mail1.i1.net>
Message-ID: <35E1D201.82D41E98@lockstar.com>
MIME-Version: 1.0
Content-Type: text/plain
It's not snake oil (yet?), but the word unbreakable is lame.
check out a preliminary paper on it...
http://www.cs.wisc.edu/~shoup/papers/
Title A practical public key cryptosystem provably secure against adaptive
chosen ciphertext attack
Fade wrote:
> Does anyone with access to the Financial Times know what the hell this
> snippet is talking about??
>
> -=fade=-
>
> ENCRYPTION BREAKTHROUGH ANNOUNCED TODAY
> August 24, 1998
>
> According to the Financial Times a new "unbreakable" encryption
> technology, called the "Cramer-Shoup cryptosystem," will be annouced today
> by mathematicians from the International Federal Institute of Technology
> which supposedly will thwart even the most aggressive Internet hackers.
> They claim to have created the first "unbreakable protection" which would
> reportedly be a breakthrough that could ensure the security of electronic
> commerce. The Financial Times said, "The breakthrough comes amid growing
> anxiety about the vulnerability of Internet transactions since the
> discovery by researchers earlier this year of a new way to break through
> even the strongest encryption systems."
--
o Mordy Ovits
o Programmer/Cryptographer
o LockStar Inc.
---------------------------------------------------------------------------
#!/usr/local/bin/python
from sys import*;from string import*;a=argv;[s,p,q]=filter(lambda x:x[:1]!=
'-',a);d='-d'in a;e,n=atol(p,16),atol(q,16);l=(len(q)+1)/2;o,inb=l-d,l-1+d
while s:s=stdin.read(inb);s and map(stdout.write,map(lambda i,b=pow(reduce(
lambda x,y:(x<<8L)+y,map(ord,s)),e,n):chr(b>>8*i&255),range(o-1,-1,-1)))
Return to August 1998
Return to ““William H. Geiger III” <whgiii@openpgp.net>”