|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 listsCambridge Screen Media Group Thinking Society: Is our university a place of free thinking? Graduate and internship applications
Other talksCurrent status of Herwig7 Manufacturing - the vital capability for effective innovation Are humans the new geology? Distributed Search Conrad Gessner, the Zurich Lectorium, and the study of physics and medicine in the early modern world Dr Megan MacLeod: Regulation of CD4 T cell retention and function at inflamed sites