Path: utzoo!utgpu!water!watmath!clyde!motown!vilya!lcuxlm!whuts!att!rutgers!gatech!uflorida!mailrus!tut.cis.ohio-state.edu!osupyr.mast.ohio-state.edu!gae
From: gae@osupyr.mast.ohio-state.edu (Gerald Edgar)
Newsgroups: comp.sys.mac
Subject: Re: Encryption
Keywords: RSA, public key encryption
Message-ID: <786@osupyr.mast.ohio-state.edu>
Date: 18 Aug 88 12:14:24 GMT
References: <7596@trwrb.UUCP> <870215@hpcilzb.HP.COM> <6149@spool.cs.wisc.edu>
Reply-To: gae@osupyr.mast.ohio-state.edu.UUCP (Gerald Edgar)
Organization: The Ohio State University, Dept. of Math.
Lines: 20

In article <6149@spool.cs.wisc.edu> engber@speedy.cs.wisc.edu (Mike Engber) writes:
>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)

Isn't it true that the RSA paper does not specify the exact sizes to use:
(the examples in the paper are much too small to keep anyone from
factoring them).  So as a consequence, every implementor has done it
differently?

How about it if all Mac people agree to use Mr. Engber's choices for this?
(I haven't seen them yet.  Are they big enough to resist factorization for
the next few years, at the rate the factoring technology is growing?)
How about all of you publicizing your keys, so we can really try it out?
-- 
  Gerald A. Edgar                               TS1871@OHSTVMA.bitnet
  Department of Mathematics                     gae@osupyr.mast.ohio-state.edu
  The Ohio State University                     gae@osupyr.UUCP
  Columbus, OH 43210                            70715,1324  CompuServe