Trend of Bootstrapping from 2009 to 2016

The pedestal of fully homomorphic encryption is bootstrapping which allows unlimited processing on encrypted data. This technique is a bottleneck in the practicability of homomorphic encryption. From 2009 to 2016, the execution time of bootstrapping decreased from several hours to a few thousandths of a second for processing a logic gate on two encrypted bits. This paper makes a comparative study of the evolution of bootstrapping during the period. An implementation of multiplication on 16-bit integers on an Intel i7 architecture through three schemes whose libraries are respectively DGHV, FHEW and TFHE makes it possible to corroborate the trend that to date the best bootstrapping on bits is that of the TFHE which executes this processing in 29 seconds improving that of the FHEW 30 times despite the multiplication algorithm used.

@article{Bomolo2021,
  title     = {Trend of Bootstrapping from 2009 to 2016},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {12},
  number    = {12},
  year      = {2021},
  publisher = {The Science and Information Organization},
  author    = {Paulin Boale Bomolo and Eugene Mbuyi Mukendi and Simon Ntumba Badibanga},
  doi       = {10.14569/IJACSA.2021.0121212},
  url       = {https://doi.org/10.14569/IJACSA.2021.0121212}
}