An IND-CPA cryptosystem from Demytko´s primitive

Author

Galindo, David ; Martín, Sebastià ; Morillo, Paz ; Villar, Jorge L.

Author_Institution

Dept. de Matematica Aplicada IV, Univ. Politecnica de Catalunya, Barcelona, Spain

fYear

2003

Firstpage

167

Lastpage

170

Abstract

An encryption scheme should satisfy semantic security or indistinguishability of encryptions against chosen plaintext attack (IND-CPA). We propose an elliptic curve scheme over the ring Z(n²), which is efficient and semantically secure in the standard model. It is based on factoring, and it has expansion factor 2 (previous schemes with these features present expansion factors greater than or equal to 4). Demytko´s primitive has been used to obtain efficiency and probabilistic encryption. Semantic security of this scheme is based on a new decisional assumption, namely, the decisional small root assumption. Confidence in this assumption is also discussed.

Keywords

cryptography; Demytko primitive; chosen plaintext attack; cryptosystem; decisional assumption; decisional small root assumption; elliptic curve scheme; encryption indistinguishability; expansion factor; factoring; probabilistic encryption; semantic security; Computational efficiency; Elliptic curve cryptography; Elliptic curves; Information security; Polynomials; Proposals; Public key cryptography; Read only memory;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop, 2003. Proceedings. 2003 IEEE

Print_ISBN

0-7803-7799-0

Type

conf

DOI

10.1109/ITW.2003.1216721

Filename

1216721