Velocity Reviews > RSA cryptography

# RSA cryptography

Dawnbell
Guest
Posts: n/a

 11-05-2003
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!

Dave Thornburgh
Guest
Posts: n/a

 11-05-2003

"Dawnbell" <(E-Mail Removed)> wrote in message
> 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?

Jim Watt
Guest
Posts: n/a

 11-06-2003
On Wed, 5 Nov 2003 00:23:42 -0600, "Dawnbell" <(E-Mail Removed)> wrote:

>Further assume that ea and eb are relatively prime.

I know a woman who is slightly pregnant.
--
Jim Watt http://www.gibnet.com

John D Loop
Guest
Posts: n/a

 11-06-2003
Not sure what "n" is, key length?
E can only see m if he can get the private key corresponding to either A or
B.
Hopefully he can't get the private keys....
J

--
Check my web site for tips on insuring safe computing in wired and wireless
homenetworking environments!
www.pccitizen.com

"Dawnbell" <(E-Mail Removed)> wrote in message
> 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!
>
>