swarren@eugene.uucp (Steve Warren) (10/03/89)
In article <558@nigel.udel.EDU> new@udel.edu (Darren New) writes: >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. Actually, what I am discussing here is the contents of a Scientific American article which I read about 8 years ago, and which, I believe (and I could be wrong ;^), introduced the technique for implementing public key encryption for the first time. I've never heard of RSA, but if it implements this algorithm then it was probably done by the author of that article. Since I read that article, this is the first place I'd ever heard anyone discussing it. >However,I don't know of any other algorithm that gives the desired results, so >right now the point is moot. -- Darren Exactly. --Steve ------------------------------------------------------------------------- {uunet,sun}!convex!swarren; swarren@convex.COM