Unruh <unruh-spam@physics.ubc.ca> wrote:

> > People talk about "the key length" in discussions of the RSA algorithm.
> >
> > In learning about it at a textbook level I know that an RSA key is a
> > pair of integers. (One is used as a power to exponentiate a value
> > and ususally labeled e or d, the other as a divisor to then divide
> > the result usually labeled n.)
>
> NO. The pair of integers are two primes which are multiplied together
> to give n. the exponents e and d are easily computed from those. e is
> usually only about 6 bits long. d is roughly the same size as n.

Actually, Daniel is right. The modulus alone doesn't make a useful RSA
key. The modulus together with an exponent does. That would be a pair
of integers (he didn't talk about primes).


Regards,
Ertugrul.


--
http://ertes.de/