From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.6 required=5.0 tests=BAYES_40,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,8947310381c2a3f
X-Google-Attributes: gid103376,public
From: David L Brown <dbrown@ted.vigra.com>
Subject: Re: Ada & Encryption / Compression
Date: 1997/03/06
Message-ID: <osn2shxb7e.fsf@ted.vigra.com>#1/1
X-Deja-AN: 223541480
References: <5fikh7$ras$1@nargun.cc.uq.edu.au>
Organization: VisiCom Laboratories, Inc.
Newsgroups: comp.lang.ada
Date: 1997-03-06T00:00:00+00:00
List-Id: <comp.lang.ada>


John Howard <jhoward@sky.net> writes:

> Forget about doing your own RSA encryption.
> 1)  RSA is patented.  You'd have to wait for the patent to expire.

Agreed, and this might be enough to stop you.  RSA claims that you can
only use their implementation.  You could probably call the C just
fine from Ada.  (I don't know if it is available outside of the US,
PGP uses the code, and is available outside of the US).

> 2)  RSA can't be implemented unless you know the two large prime numbers
>     it uses (which are a secret).  As of a year ago, RSA was still not
>     reported as cracked to reveal the two primes.  Presumably many skilled 
>     researchers have tried to crack RSA.

Hmm?  The secret key is something that I generate.  I tell someone the
product of these two primes which they can use to encrypt, but I need
to know the factors in order to decrypt.

Don't confuse the RSA algorithm with the contest that RSA is holding
to crack a particular key.  They are witholding this key, not because
it has to do with the algorithm, but because it is part of a contest.

Please see <http://www.rsa.com/>

I do not speak for RSA,
David Brown
dbrown@vigra.com