Re: RSA cryptography

From: Dave Thornburgh (dave-thorn_at_nodash.adelphia.net)
Date: 11/05/03 

Date: Wed, 05 Nov 2003 20:05:59 GMT

"Dawnbell" <xliu4@cox.net> wrote in message
news:_I0qb.2658$iE.945@okepread01...
> Hi, all!
>
> I have a question regarding RSA algorithm. Suppose two users A and B have
> the RSA public keys (ea, n) and (eb, n). Further assume that ea and eb
are
> relatively prime. C sends a message m to both A and B encrypting it with
> their respective public keys. If E gets hold of these messages, is it
> possible for E to find m? If so, how?
>
> Thank you very much for your help!
>

Homework due soon?