Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR06-046 | 1st April 2006 00:00

A Complete Public-Key Cryptosystem

RSS-Feed

Abstract:

We present a cryptosystem which is complete for the class of probabilistic public-key cryptosystems with bounded error. Besides traditional encryption schemes such as RSA and El Gamal, this class contains probabilistic encryption of Goldwasser-Micali as well as Ajtai-Dwork and NTRU cryptosystems. The latter two are known to make errors with some small positive probability.


Comment(s):

Comment #1 to TR06-046 | 17th January 2007 22:33





Comment #1
Authors: Dima Grigoriev, Edward Hirsch, Konstantin Pervyshev
Accepted on: 17th January 2007 22:33
Downloads: 1599
Keywords: 


Abstract:




ISSN 1433-8092 | Imprint