On the concrete hardness of Learning with Errors
Event details
| Date | 17.06.2015 |
| Hour | 10:00 › 11:00 |
| Speaker | Martin Albrecht, Royal Holloway, University of London (UK) |
| Location | |
| Category | Conferences - Seminars |
The Learning with Errors (LWE) problem has become a central building block of
modern cryptographic constructions, underpinning constructions from public key
cryptography to fully homomorphic encryption. In a nutshell the problem is to
solve a "noise" linear system of equations.
In this talk we will introduce the problem and then given an overview of
hardness results for concrete instances of LWE. In particular, we will discuss
strategies and algorithms proposed in the literature for solving LWE and give
the expected resources required to run them.
modern cryptographic constructions, underpinning constructions from public key
cryptography to fully homomorphic encryption. In a nutshell the problem is to
solve a "noise" linear system of equations.
In this talk we will introduce the problem and then given an overview of
hardness results for concrete instances of LWE. In particular, we will discuss
strategies and algorithms proposed in the literature for solving LWE and give
the expected resources required to run them.
Links
Practical information
- General public
- Free
Organizer
- Adeline Langlois
Contact
- Sylvie Thomet