From: Matthew J Ghio <mg5n+@andrew.cmu.edu>
Date: Mon, 7 Mar 94 12:37:19 PST
To: cypherpunks@toad.com
Subject: Re: basic RSA info
In-Reply-To: <Pine.3.87.9403062148.A9061-0100000@crl2.crl.com>
Message-ID: <AhSt1ZS00VoyEAvkcG@andrew.cmu.edu>
MIME-Version: 1.0
Content-Type: text/plain


Jeremy Cooper <jeremy@crl.com> wrote:

> Now that I think about it.  I am sure to have messed something up.
> Please send a flame back attacking what I foobared.  Thank you.

okay...  overall pretty good tho.

> When you make an RSA key, you generate three numbers.
> Two of them are prime and one is just odd.

The encryption exponent must not contain any common factors with
(p-1)(q-1).  This means that it is always odd, but that's not
necessarily the only factor that you need to check.

>       P^s
> E =  ------ 
>        l   

The remainder, not the quotient.  Usually written as E = P^s mod l