|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 listsSemitic Philology Lecture Cambridge Networks Forum Semitic linguistics
Other talksA V HILL LECTURE - Title to be confirmed Synthetic Data as a Method for Protecting Confidentiality PSI : a Private data Sharing Interface Production Processes Group Seminar Aspects of the Leggett Garg Inequalities TBA (Gravitational waves with LIGO)