Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme

  • Peter Scholl
  • Nigel P. Smart
Conference paper

DOI: 10.1007/978-3-642-25516-8_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7089)
Cite this paper as:
Scholl P., Smart N.P. (2011) Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme. In: Chen L. (eds) Cryptography and Coding. IMACC 2011. Lecture Notes in Computer Science, vol 7089. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Peter Scholl
    • 1
  • Nigel P. Smart
    • 1
  1. 1.Dept. Computer ScienceUniversity of BristolBristolUnited Kingdom

Personalised recommendations