Standard

A complete public-key cryptosystem. / Grigoriev, Dima; Hirsch, Edward A.; Pervyshev, Konstantin.

In: Groups, Complexity, Cryptology, Vol. 1, No. 1, 01.04.2009, p. 1-12.

Research output: Contribution to journal › Article › peer-review

Harvard

Grigoriev, D, Hirsch, EA & Pervyshev, K 2009, 'A complete public-key cryptosystem', Groups, Complexity, Cryptology, vol. 1, no. 1, pp. 1-12. https://doi.org/10.1515/GCC.2009.1

APA

Grigoriev, D., Hirsch, E. A., & Pervyshev, K. (2009). A complete public-key cryptosystem. Groups, Complexity, Cryptology, 1(1), 1-12. https://doi.org/10.1515/GCC.2009.1

Vancouver

Grigoriev D, Hirsch EA, Pervyshev K. A complete public-key cryptosystem. Groups, Complexity, Cryptology. 2009 Apr 1;1(1):1-12. https://doi.org/10.1515/GCC.2009.1

Author

Grigoriev, Dima ; Hirsch, Edward A. ; Pervyshev, Konstantin. / A complete public-key cryptosystem. In: Groups, Complexity, Cryptology. 2009 ; Vol. 1, No. 1. pp. 1-12.

BibTeX

@article{7354affb752d4554a2803833821affc8,
title = "A complete public-key cryptosystem",
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 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.",
author = "Dima Grigoriev and Hirsch, {Edward A.} and Konstantin Pervyshev",
year = "2009",
month = apr,
day = "1",
doi = "10.1515/GCC.2009.1",
language = "English",
volume = "1",
pages = "1--12",
journal = "Groups, Complexity, Cryptology",
issn = "1867-1144",
publisher = "De Gruyter",
number = "1",

}

RIS

TY - JOUR

T1 - A complete public-key cryptosystem

AU - Grigoriev, Dima

AU - Hirsch, Edward A.

AU - Pervyshev, Konstantin

PY - 2009/4/1

Y1 - 2009/4/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=67749089433&partnerID=8YFLogxK

U2 - 10.1515/GCC.2009.1

DO - 10.1515/GCC.2009.1

M3 - Article

AN - SCOPUS:67749089433

VL - 1

SP - 1

EP - 12

JO - Groups, Complexity, Cryptology

JF - Groups, Complexity, Cryptology

SN - 1867-1144

IS - 1

ER -

ID: 49827912