017 Estimating the difficulty of breaking lattice-based cryptography w/ Martin Albrecht

Опубликовано: 25 Ноябрь 2022
на канале: FHE_org

743

👀 Side note: as announced at the beginning of this Meetup by Rand Hindi, Zama just launched a Bounty Program to encourage the FHE open source community to move the space forward. More than €500,000 in prizes available.
🔗 All info here: https://github.com/zama-ai/bounty-pro...

FHE.org is a community of researchers and developers interested in advancing Fully Homomorphic Encryption (FHE) and other secure computation techniques.

Abstract

In this talk Martin will give an introduction to estimating the difficulty of breaking constructions in lattice-based cryptography, with a focus on Learning with Errors and related problems. Martin will give an introduction to the algorithms available, how we cost them and how the Lattice Estimator at https://github.com/malb/lattice-estim... aims to make this accessible.

About the speaker

Martin R. Albrecht is currently a professor in the Information Security Group and the director of the Cryptography Group; He’ll soon join King’s College London and work for SandboxAQ. His research is focused on all aspects of cryptography from the hard mathematical problems underlying it to the cryptanalysis of deployed cryptographic protocols and implementations. His recent work focuses on lattice-based and post-quantum cryptography, block ciphers for algebraic platforms and attacks on cryptographic protocols. He is also a contributor to the Sage Mathematics Software and other open-source projects, especially for lattice-based cryptography. His Erdős–Bacon Number is six.

Important Links

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!