In some FHE schemes, the plaintext space decomposes as a product of “plaintext slots”. When these slots have high algebraic rank, we show how one can use Galois automorphisms to compute polynomial evaluations on points in the prime field faster than with standard methods. This situation appears during bootstrapping for BFV/BGV, and we demonstrate how our techniques can increase the performance by implementing the correspondingly modified bootstrapping algorithm.
Simon Pohmann finished his Bachelor in Mathematics and Computer Science at the University of Passau (Germany) in 2020. In 2022, he then completed the Master program “Mathematics and Foundations of Computer Science” at Oxford University. Since then, he is a PhD Student at the Centre for Doctoral Training at Royal Holloway, University of London.
After the event has finished, resources (including any slides, video, papers, etc) will be added to this resource page.
The newsletter where we post community announcements: https://fheorg.substack.com/
The discord server where you can discuss FHE related topics with the community: https://discord.fhe.org
Make sure to join either (or both) of these to stay informed about future events!