A Fast Heuristic for Mapping Boolean Circuits to Functional Bootstrapping

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.

How to join?

To join the meetup, use https://fhe.org/meetups/join

Unable to make it?

After the event has finished, resources (including slides, video, papers, etc) will be available at the resource page at https://fhe.org/meetups/063

Never miss an update

1. The newsletter where we post community announcements: https://fheorg.substack.com/
2. 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!