Re: RSA
Christian Bau wrote:
RSA encryption chooses two primes p and q (with some extra conditions on
the prime), then calculates (x^3) mod (pq).
Nit pick. That should be x^e, where e is the "encryption" exponent,
which is part of the public key. It doesn't have to be different for
every different key -- in fact, *typical* values are 3 and 65537
(2^16 + 1). But from what I've seen, 65537 seems to be the typical
choice (at least all the RSA keypairs I've ever generated or seen,
use this exponent)
Carlos
--
.
