Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!wuarchive!udel!new
From: new@udel.edu (Darren New)
Newsgroups: comp.sys.amiga
Subject: Re: WB 1.3.2
Keywords: encrypt workbench release
Message-ID: <558@nigel.udel.EDU>
Date: 3 Oct 89 01:03:50 GMT
References: <14203@polyslo.CalPoly.EDU> <7825@cbmvax.UUCP> <6068@tekigm2.MEN.TEK.COM> <7850@cbmvax.UUCP> <6097@tekigm2.MEN.TEK.COM> <226@estinc.UUCP> <193@teslab.lab.OZ> <188@grape3.UUCP> <1928@convex.UUCP>
Sender: usenet@udel.EDU
Reply-To: new@udel.edu (Darren New)
Organization: University of Delaware
Lines: 10

In article <1928@convex.UUCP> swarren@eugene.UUCP (Steve Warren) writes:
>The technique involves the use of very large prime numbers, one of which
    [ . . . ]
>	  {uunet,sun}!convex!swarren; swarren@convex.COM

Actually, what you are discussing here is the RSA public-key encryption
algorithm.  All should be aware that "public key encryption" != "RSA algorithm".
Rather, RSA is one method of implementing a public-key system.
However, I don't know of any other algorithm that gives the desired results, so
right now the point is moot.                  -- Darren