Paper 2016/488

Efficient Homomorphic Integer Polynomial Evaluation based on GSW FHE

Husen Wang and Qiang Tang


We introduce new methods to evaluate integer polynomials with GSW FHE, which has much slower noise growth and per integer multiplication cost $O((\log k/k)^{4.7454}/n)$ times the original GSW, where $k$ is the input plaintext width, $n$ is the LWE dimention parameter. Basically we reduce the integer multiplication noise by performing the evaluation between two kinds of ciphertexts, one in $\mathbb{Z}_q$ and another in $\mathbb{F}_2^{\lceil \log q \rceil}$. The conversion between two ciphertexts can be achieved by the integer bootstrapping. We also propose to solve the ciphertext expansion problem by symmetric encryption with stream ciphers.

Available format(s)
Publication info
Preprint. MINOR revision.
GSWHomomorphic Encryptioninteger multiplicationPolyno- mialbootstrappingpacking
Contact author(s)
wanghs thu @ gmail com
2016-12-23: last of 2 revisions
2016-05-20: received
See all versions
Short URL
Creative Commons Attribution


      author = {Husen Wang and Qiang Tang},
      title = {Efficient Homomorphic Integer Polynomial Evaluation based on GSW FHE},
      howpublished = {Cryptology ePrint Archive, Paper 2016/488},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.