FHE.org Meetup: Homomorphic Polynomial Evaluation using Galois structure and application to BFV bootstrapping
on Oct 5th, 4pm CEST (Paris, FR)
Greetings cryptographers!
We’re happy to have had Nicolas Gama last week presenting on Revisiting Key Decomposition Techniques for FHE: Simpler, Faster and More Generic. Check out the resources here.
🗓️ This week’s Meetup is scheduled for Thursday, October 5th at 4pm CEST (Paris, FR).
The meetup features Simon Pohmann presenting a talk on Homomorphic Polynomial Evaluation using Galois structure and application to BFV bootstrapping.
Here is the link to register:
Abstract
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.
About the speakers
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.
Resources from last meetup
You can access resources from the last meetup Revisiting Key Decomposition Techniques for FHE: Simpler, Faster and More Generic on the FHE.org website here.
Never miss an update
Join the discord server to discuss FHE related topics with the community: discord.fhe.org
See you soon!
The FHE.org team