Encrypting same data with many keys...

[Ray Arachelian]

On Tue, 12 Aug 1997, Matthew Ghio wrote:

> Having identical plaintexts raised to the same power modulo different
> numbers makes the solution much easier.  If you have enough RSA
> encryptions of the same number to the same power, you can solve it
> outright by the remainder theorem.

So if I wanted to do this and use RSA, how could it be shielded from
attack?  I take it switching to DH or MH won't help.   Would Eliptic
Curves have different properties against this attack?

Maybe a random session key in the middle would help?

i.e.:	File[N]=RSA(PublicKey[n],RandomSessionKey[N]+IDEA(SessionKey[N],Data))


=====================================Kaos=Keraunos=Kybernetos==============
.+.^.+.|  Ray Arachelian    |Prying open my 3rd eye.  So good to see |./|\.
..\|/..|sunder at sundernet.com|you once again. I thought you were      |/\|/\
<--*-->| ------------------ |hiding, and you thought that I had run  |\/|\/
../|\..| "A toast to Odin,  |away chasing the tail of dogma. I opened|.\|/.
.+.v.+.|God of screwdrivers"|my eye and there we were....            |.....
======================= http://www.sundernet.com ==========================