Chapter

Cryptography and Coding

Volume 7089 of the series Lecture Notes in Computer Science pp 10-22

Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme

  • Peter SchollAffiliated withLancaster UniversityDept. Computer Science, University of Bristol
  • , Nigel P. SmartAffiliated withLancaster UniversityDept. Computer Science, University of Bristol

* Final gross prices may vary according to local VAT.

Get Access

Abstract

A key problem with the original implementation of the Gentry Fully Homomorphic Encryption scheme was the slow key generation process. Gentry and Halevi provided a fast technique for 2-power cyclotomic fields. We present an extension of the Gentry–Halevi key generation technique for arbitrary cyclotomic fields. Our new method is roughly twice as efficient as the previous best methods. Our estimates are backed up with experimental data.