Evaluating Larger Lookup Tables using CKKS w/ Jules Dumezy

​#Abstract

​This presentation will introduce two novel algorithms for functional bootstrapping in CKKS: Binary Multiplexer Tree (BMT-FBT) and Collapsed Multiplexer Tree (CMT-FBT). While standard CKKS functional bootstrapping struggles with efficiency for larger Lookup Tables (LUTs), these new methods leverage ciphertext bit and digit decompositions to overcome these limitations. The talk will demonstrate how these techniques allow for the practical evaluation of LUTs up to 20+ bits.

​#About the Speaker

Jules Dumezy is a PhD candidate at CEA-List and Université Paris-Saclay, France. He holds an Engineering Degree in Embedded and Cyber-Physical Systems from Centrale Lille. His research focuses on applied cryptography and privacy-preserving technologies, specifically on general improvements for the CKKS scheme and enabling more efficient computations for FHE.

​#More Information

Want more information, recordings of the presentations, slides, and other resources from the meetup? Visit this meetup's resource page at https://fhe.org/meetups/086

#Never Miss an Update

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!