|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Using SAT Solvers for Cryptographic Problems
If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.
As SAT solvers have become more advanced, their use-cases have expanded. One such area where SAT solves now competitively perform is cryptography. In this talk we investigate why and how SAT solvers are used in cryptography, and what advantages they bring relative to other solving methods such as brute force or Grobner basis algorithms. We present several specific use-cases and highlight some future possibilities.
This talk is part of the Microsoft Research Cambridge, public talks series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsBlueSci Talks CUED Control Group Seminars Genetics Department Seminar Series
Other talks2050: Sustainable UK? The use of recent advances in electron microscopy to study the ribosome Natural Killer cells, Innate Lymphoid cells and Innate Immunity News from RAVE Computational insights into stem cell differentiation using dynamic hybrid modelling. Are there limits to evolution? (Conference 25 & 26 September 2014)