Next meetup scheduled: A Fast Heuristic for Mapping Boolean Circuits to Functional Bootstrapping w/ Sergiu Carpov
on Nov 21st, 4pm CEST (Paris, FR)
🗓️ The next FHE.org meetup has been scheduled for next week, Thursday, Nov 21st at 4pm CEST (Paris, FR).
This meetup features Sergiu Carpov, a senior cryptography engineer at Arcium, presenting A Fast Heuristic for Mapping Boolean Circuits to Functional Bootstrapping.
For more information and link to RSVP, see the event page at https://fhe.org/meetups/063.
Abstract
This presentation aims to highlight some of the recent advances in tools fof automatic Boolean circuit mapping to TFHE functional bootstrapping (FBS). One approach to using FBS is to map Boolean circuits to generic k-input LUTs, which is a straightforward method and extensive tools from the circuit synthesis field are available for this. However, manual optimisations may be necessary to fully leverage the potential of FBS. A fast and automatic method to perform this task will be presented together with empirical results on a set of representative benchmark circuits.
About the speaker
Sergiu Carpov is a senior cryptography engineer at Arcium. His main interests include applied cryptography for privacy-preserving computations and optimisation/compilation techniques for FHE/MPC programs. He participated in the development of Cingulata, the first FHE compiler, as well as tools for optimisation of Boolean circuits, and is a contributor to the TFHE library.
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