Re: Re: OODL: Security - One-way functions

[MP0werd]

In a message dated 5/4/99 5:39:27 PM, you wrote:

<<In the end it comes 
down to using the formula:

E(x) = x^e mod n>>

Very nice, this page explains it well: 
<A 
HREF="http://www.trincoll.edu/academics/departments/cpsc/cryptography/rsa.html
">Cryptography -- RSA
</A>
Only problem is how the #$@#$ are P and Q generated? I don't understand the 
math, mind explaining it to me (and I still like DES better)