Sciweavers

Share
INDOCRYPT
2004
Springer

A Provably Secure Elliptic Curve Scheme with Fast Encryption

12 years 1 months ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2 , where n is an RSA modulus, and merges ideas from Paillier and Rabin related schemes. Despite the typical bit length of n, our encryption algorithm is faster than El Gamal elliptic curve cryptosystems. The one-wayness of the new cryptosystem is as hard as factoring n while the semantic security is proved under a reasonable decisional assumption. Two new length-preserving trapdoor permutations equivalent to factoring are also described.
David Galindo, Sebastià Martín Molle
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where INDOCRYPT
Authors David Galindo, Sebastià Martín Molleví, Tsuyoshi Takagi, Jorge Luis Villar
Comments (0)
books