University of Birmingham > Talks@bham > Computer Security Seminars > CANCELLED: How hard is LWE anyway?

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

CANCELLED: How hard is LWE anyway?

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Isra Ahmed.

In this talk I will give an overview of the state-of-the-art in solving hard lattice problems. In particular, I will focus on techniques for solving the Learning with Errors problem which underpins candidates for post-quantum solutions and advanced primitives such as homomorphic encryption.

This talk is part of the Computer Security Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Electromagnetic Communications and Sensing Research Seminar Series Computer Science Lunch Time Talk Series IRLab Seminars: Robotics, Computer Vision & AI

Other talks

Ultrafast, all-optical, and highly efficient imaging of molecular chirality Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems The development of an optically pumped magnetometer based MEG system Hodge Theory: Connecting Algebra and Analysis Modelling uncertainty in image analysis. Geometry of alternating projections in metric spaces with bounded curvature
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.