Home | Resources | Meetups | Conference 2025 | Join the community
In the context of fully-homomorphic-encryption, we consider the representation of large integers by their decomposition over a product of rings (through the Chinese Remainder Theorem) and introduce a new algorithm for the determination of the sign solely through the knowledge of ring-components. Our implementation with 128 bits of security delivers a correct result and a probability higher than 1-1.e-9 in less than 100 milliseconds for 32-bit integers on a laptop.
Senior researcher at Inria. Previously at Ravel Technologies for the last three years.
Visit FHE.org’s lu.ma event page to RSVP and have the event added to your calendar.
After the event has finished, resources (including any slides, video, papers, etc) will be added to this resource page.
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!