A Complete Public-Key Cryptosystem

Dima Grigoriev 1 , Edward A. Hirsch 2  and Konstantin Pervyshev 3
  • 1 IRMAR, Université de Rennes, Campus de Beaulieu, 35042 Rennes, France. http://perso.univ-rennes1.fr/dmitry.grigoryev/
  • 2 Steklov Institute of Mathematics at St.Petersburg, 27 Fontanka, 191023 St.Petersburg, Russia. http://logic.pdmi.ras.ru/~hirsch/
  • 3 University of California, San Diego, USA

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 and probabilistic encryption of Goldwasser and Micali, this class contains also Ajtai-Dwork and NTRU cryptosystems. The latter two make errors with a small positive probability.

Purchase article
Get instant unlimited access to the article.
Log in
Already have access? Please log in.

Journal + Issues

Groups – Complexity – Cryptology is a journal for speedy publication of articles in the areas of combinatorial and computational group theory, computer algebra, complexity theory, and cryptology. GCC primarily publishes research papers, but comprehensive and timely survey articles on a topic inside the scope of the journal are also welcome.