[145182] in cryptography@c2.net mail archive
Re: Question regarding common modulus on elliptic curve cryptosystems
daemon@ATHENA.MIT.EDU (Matt Crawford)
Thu Mar 25 08:44:55 2010
Date: Wed, 24 Mar 2010 09:09:59 -0500
From: Matt Crawford <crawdad@fnal.gov>
In-reply-to: <4BA68BDE.3010007@pentatek.com>
To: Cryptography List <cryptography@metzdowd.com>
On Mar 21, 2010, at 4:13 PM, Sergio Lerner wrote:
> I looking for a public-key cryptosystem that allows commutation of the operations of encription/decryption for different users keys
> ( Ek(Es(m)) = Es(Ek(m)) ).
> I haven't found a simple cryptosystem in Zp or Z/nZ.
>
> I think the solution may be something like the RSA analogs in elliptic curves. Maybe a scheme that allows the use of a common modulus for all users (RSA does not).
If your application can work with a trusted authority generating all the keypairs, and you sacrifice the use of short public exponents *and* sacrifice the possession of the factors of the modulus by the key owners, making them do more work on decryption, I think you can have what you asked for. But that's a lot of ifs.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
