cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1997-08-12 - Re: Encrypting same data with many keys…

Header Data

From: Ray Arachelian <sunder@brainlink.com>
To: Matthew Ghio <ghio@temp0107.myriad.ml.org>
Message Hash: 09b82ee708357128e4cea618ca42c188afae936533c853236fed479574933146
Message ID: <Pine.SUN.3.96.970812155923.26326V-100000@beast.brainlink.com>
Reply To: <199708121945.MAA16770@myriad.alias.net>
UTC Datetime: 1997-08-12 20:12:44 UTC
Raw Date: Wed, 13 Aug 1997 04:12:44 +0800

Raw message

From: Ray Arachelian <sunder@brainlink.com>
Date: Wed, 13 Aug 1997 04:12:44 +0800
To: Matthew Ghio <ghio@temp0107.myriad.ml.org>
Subject: Re: Encrypting same data with many keys...
In-Reply-To: <199708121945.MAA16770@myriad.alias.net>
Message-ID: <Pine.SUN.3.96.970812155923.26326V-100000@beast.brainlink.com>
MIME-Version: 1.0
Content-Type: text/plain



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@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 ==========================

Thread