From: kevin lyda (kevin at domain suberic.net)
Date: Sat 15 Sep 2001 - 02:07:43 IST
On Sat, Sep 15, 2001 at 02:51:01AM +0100, John McCormac wrote:
> difficult to factor large numbers. If someone was to develop a faster
> factoring algorithm then RSA encryption could be vulnerable. Even with
> PGP, as far as I remember, the core encryption algorithm (that used to
> encrypt the data) is not RSA. RSA is used for the keyhandling. In some
> cases, who the encrypted e-mail is going to can be far more revealing
> than the contents.
that's not due to a weakness in rsa, but because public key encryption
is compute intensive. and for pgp it allows for a size efficient way to
send multi-recipient email (which i always do - the recipient and myself).
you encrypt a key that is relatively small with one (or more) public keys
and then use that key to encrypt loads of data. this is true for pgp,
ssh and ssl. and if rsa is weak, then you can find the key and then
the message is broken.
this, btw, is why the public key crypto that sarah something-or-other
(? the caley-purser algorithm thingy) was hyped. it was faster.
sadly it also had flaws.
-- kevin at domain suberic.net terrorism is about spreading terror, fear & fork()'ed on 37058400 divisions between people. fight back. broaden meatspace place: home your world, reduce fear & help add to the voices http://suberic.net/~kevin of condemnation. --me, "visit a mosque" on /.
This archive was generated by hypermail 2.1.6 : Thu 06 Feb 2003 - 13:12:09 GMT