<abstract xmlns="http://www.w3.org/1999/xhtml"><p> In this paper we propose an improvement of the implementation of the original Gentry-Halevi somewhat homomorphic scheme. We suggest to choose a bigger plaintext space, by changing the underlying ideal from <italic>I </italic>= (2) to <italic>I </italic>= (<italic>p</italic>) for some bigger prime <italic>p</italic>. Our analysis shows that bigger plaintext space will improve the homomorphic computation of the somewhat homomorphic scheme while it only slightly increases the complexity of the key generation procedure. The encryption and decryption functions have the same complexity. We provide also some experimental computations that support the analysis.</p></abstract>

In this paper we propose an improvement of the implementation of the original Gentry-Halevi somewhat homomorphic scheme. We suggest to choose a bigger plaintext space, by changing the underlying ideal from I = (2) to I = (p) for some bigger prime p. Our analysis shows that bigger plaintext space will improve the homomorphic computation of the somewhat homomorphic scheme while it only slightly increases the complexity of the key generation procedure. The encryption and decryption functions have the same complexity. We provide also some experimental computations that support the analysis.

Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme

Institute of Computer Science and Mathematics, Faculty of Electrical Engineering and Information Technology, Slovak University of Technology, Ilkovičova 3, SK–812-19, Bratislava,SLOVAKIA

Tatra Mountains Mathematical Publications

In this paper we propose an improvement of the implementation of the original Gentry-Halevi somewhat homomorphic scheme. We suggest to choose a bigger...

Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme

Online veröffentlicht: 01. Feb. 2013

Seitenbereich: 147 - 154

DOI: https://doi.org/10.2478/v10127-012-0044-6

Schlüsselwörter
homomorphic encryption, efficient homomorphic computing, lattice based cryptography

This content is open access.

Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme

Online veröffentlicht: 01. Feb. 2013

Seitenbereich: 147 - 154

DOI: https://doi.org/10.2478/v10127-012-0044-6

Schlüsselwörterhomomorphic encryption, efficient homomorphic computing, lattice based cryptography

This content is open access.

Schlüsselwörter
homomorphic encryption, efficient homomorphic computing, lattice based cryptography