17 Dec
2003
17 Dec
'03
11:17 p.m.
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