![]() |
![]() |
Post-quantum cryptographyAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Andreea Radu. All asymmetric cryptography widely deployed today is essentially based on two number-theoretic problems, namely factoring and the problem of computing (elliptic-curve) discrete logarithms. In 1994, Shor described how these two problems can be solved in polynomial time on a sufficiently large universal quantum computer. It is thus clear that once such a computer can be built, all of today’s asymmetric crypto will be broken. The area of so-called “post-quantum cryptography” therefore works on asymmetric cryptography that is based on different underlying hard problems that survive attacks even by attackers equipped with a large quantum computer. In my talk I will present two recent examples of such schemes, a signature scheme and a key-encapsulation mechanism and highlight future research challenges. This talk is part of the Computer Security Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsQuantitative Methods in Finance seminar Birmingham Popular Maths Lectures Postgraduate Seminars in the School of Computer ScienceOther talksProvably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Metamaterials for light-matter interaction studies Geometry of alternating projections in metric spaces with bounded curvature Quantum simulations using ultra cold ytterbium TBC TBC |