🕵 Polynomial Time Quantum Algorithm
The FHE (and greater cryptography community) has had a busy month! Since our last digest, a paper was released by Yilei Chen claiming to outline a polynomial time quantum algorithm which solved LWE, the hardness problem which underlies all major FHE schemes. This work gained a lot of attention in the FHE (and PQC) communities, including lots of interesting discussion on our discord and elsewhere online by well known cryptographers. In the end, a bug was found in the algorithm which does not seem fixable “so the panic in lattice quarters is now over”.
Ultimately, this outlines a key fact about the world of cryptography: hardness assumptions that we use to base cryptography on are just that, assumptions! Talented cryptographers around the world are constantly working to understand the hardness of LWE, and other similar assumptions. Over time, our understanding of these problems becomes more refined, and we are able to act accordingly as a community as and when parameter changes are needed.
Stay up to date on this and other FHE topics by joining the FHE.org discord.
🌷 Spring Meetup lineup
Register for tomorrow’s meetup Convolution-friendly Image Compression in FHE, with Sergi Rovira, a PhD candidate in cryptography at Universitat Pompeu Fabra (UPF) under the supervision of Vanesa Daza (UPF) and Paz Morillo (UPC), and Axel Mertens, a PhD student in cryptography at COSIC, KU Leuven, under supervision of Nigel Smart. Meetup starts tomorrow, April 25th, 2024 at 4PM CEST.
And a quick tentative spoiler of the next meetups lineup:
On the Concrete Security of Approximate FHE Schemes with Noise-Flooding Countermeasures on May 2nd
Fregata: Faster Homomorphic Evaluation of AES via TFHE on May 9th
Functional bootstrapping for FV style cryptosystems on May 30th
Make sure to subscribe to the Meetup page to get notifications of all future FHE.org Meetups as they are scheduled.
Got a paper or presentation you think the community might be interested in or would make a good meetup? Get in touch at contact@fhe.org
📰🕺 Latest updates from the FHE.org community.
Check out the added resources from meetups since the last digest:
Video and slides added to 048 Homomorphic Logic Gates and Integrated Circuits: Designs and Applications
All resources added from the FHE.org 2024 Toronto Conference
Contributions to the FHE.org resources page you might have missed:
FPT: a Fixed-Point Accelerator for Torus Fully Homomorphic Encryption by Michiel Van Beirendonck, Jan-Pieter D'Anvers, Furkan Turan, and Ingrid Verbauwhede
Earlier this year FHE.org contributors came together with the idea of helping those inside and outside of the FHE community to understand where FHE came from and how far its come. From this, the FHE.org History Timeline project was born. Still a work-in-progress but it's now ready for initial viewing! The community is encouraged to provide feedback and propose their own entries as everything is open source! Check out the History of FHE project at https://fhe.org/history
FHE.org Discord
Do you have an idea, something to share, a resource to add, or something you’d like to change about FHE.org? You can post any suggestions and proposals in the #meta channel on the FHE.org discord!
Are you a PhD student in cryptography? Join the discussion on our the dedicated #phd-students channel on the FHE.org discord: https://discord.fhe.org.
Don’t forget that the FHE.org website is open source and that anyone can add resources by simply opening a PR on Github: https://github.com/FHE-org/fhe-org.github.io.
💙 FHE.org is an open-source community of researchers and developers interested in Fully Homomorphic Encryption (FHE), if you’d like to contribute, join the community:
👉 You think something is missing from this FHE.org digest? Help us craft the next one, join the discussion on Discord.