Imperial College London > Talks@ee.imperial > COMMSP Seminar > On the concrete hardness of Learning with Errors
Log inImperial users Other users No account?Information onFinding a talk Adding a talk Syndicating talks Who we are Everything else |
On the concrete hardness of Learning with ErrorsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Cong Ling. 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 “noisy” 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.
Martin obtained his PhD in the Information Security Group at Royal Holloway, University of London. He then moved on as a postdoc to LIP6 in Paris and to DTU in Copenhagen. He is now back at Royal Holloway as a postdoc investigating cryptographic multilinear maps. His Erdős-Bacon number is 6. This talk is part of the COMMSP Seminar series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsPowertalk Type the title of a new list here Circuits and Systems Group: Internal SeminarsOther talksFast object detection with binary feature representation (Fujiyoshi) & Facial Analysis and Human Understanding with Deep Learning (Yamashita) |