🗓️The next FHE.org meetup has been scheduled for next week, Thursday, March 19th at 4PM CET (Paris, FR).
This meetup features Jules Dumezy, a PhD candidate at CEA-List and Université Paris-Saclay, France, presenting Evaluating Larger Lookup Tables using CKKS.
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.
Never miss an update
Join the discord server to discuss FHE related topics with the community: discord.fhe.org.
