Newsgroups: sci.crypt
Path: msuinfo!uchinews!linac!uwm.edu!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!cunixf.cc.columbia.edu!cunixa.cc.columbia.edu!kasdan
From: kasdan@cunixa.cc.columbia.edu (John Kasdan)
Subject: Re: rsa encryption and large number modulus
Message-ID: <1992Feb5.183526.14021@cunixf.cc.columbia.edu>
Sender: usenet@cunixf.cc.columbia.edu (The Network News)
Nntp-Posting-Host: cunixa.cc.columbia.edu
Reply-To: kasdan@cunixa.cc.columbia.edu (John Kasdan)
Organization: Columbia University School of Law
References: <BARJUN.92Feb2213933@elaine55.Stanford.EDU> <5423@public.BTR.COM>
Date: Wed, 5 Feb 1992 18:35:26 GMT

In article <5423@public.BTR.COM> grady@public.BTR.COM (Grady Ward  grady@btr.com) writes:
>To play around with RSA encryption to encode/decode
>large ASCII files as well as generate qualified moduli
>takes only _five_ lines of code using Mathematica.
>

Are you asserting that you can generate numbers that are proved to be
prime, rather than just pseudo-primes, in four lines of Mathematica
code?  (I assume that the encryption takes at least one line.)

In any case, would you care to share these five lines with the rest of
us? 

>
>
>-- 
>Grady Ward  grady@btr.com  KD6ETH @ K6LY.#NOCAL.CA.USA.NA  Moby Lexicons


/JK (.sig closed for repairs)
