RSA cryptography

From: Dawnbell (xliu4_at_cox.net)
Date: 11/05/03 

Date: Wed, 5 Nov 2003 00:23:42 -0600

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!

Loading