Path: utzoo!attcan!uunet!husc6!uwvax!speedy!engber From: engber@speedy.cs.wisc.edu (Mike Engber) Newsgroups: comp.sys.mac Subject: Re: Encryption Summary: free RSA source code Keywords: RSA, public key encryption Message-ID: <6149@spool.cs.wisc.edu> Date: 17 Aug 88 16:03:41 GMT References: <7596@trwrb.UUCP> <870215@hpcilzb.HP.COM> Sender: news@spool.cs.wisc.edu Reply-To: engber@speedy.cs.wisc.edu (Mike Engber) Organization: U of Wisconsin CS Dept Lines: 42 The original RSA article is in the 1978 CACM pp 120-126. It is a very good article an surprisingly easy to read. Reading the article should be enough for most programmers to understand how it works and how to implement it (it was for me) However, really understanding why it works requires some number theory (which I don't pretend to have) I implemented it for a course last semester and I'd be glad to email the source to anyone who wants it. There is one catch: I wrote it in Common Lisp (specifically Allegro Common Lisp, but it should run under any Common Lisp, I've also tested it under KCL) I used Lisp because it allows integers to be of arbitrary size (like 200 digits). The code is by no means a commercial encryption package (and I make no warranties about it) If you want to use this you're going to have to know Lisp, the more you know, the better you'll understand what's going on, but a novice should be able to run it. Reading the paper will also help in understanding it (I used the papers naming conventions for my variables), but again, a novice can still figure out enough to run it without the paper. I'll also throw in some very large prime numbers (50 & 100 digits). You'll need to use these numbers in forming your keys. The larger the prime, the more secure your key. But wait, there's more. If you order now I'll throw in, at no extra charge, an implementation of the Solovay & Strassen prime test algorithm which will allow you to find very large primes right in your own home. In fact, this versetile algorithm will let you take all those spare numbers you have lying around the home and test them for primality to whatever accuracy you desire (it's a probabalistic test). So you get: -functions to encrypt/decrypt a string using RSA -functions to encrypt/decrypt a text file RSA -some 50 and 100 digit primes -the Solovay & Strassen prime test -sorry, you don't get the steak knives All for the low low price of $0.00 Send your check or money order to: engber@speedy.cs.wisc.edu -ME