|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 listsPDN Postdoc Symposium Plenary talks OpenCoffee Cambridge ESRC Festival of Science
Other talksInferno XIX, Purgatorio XIX, Paradiso XIX TBC The 2015 Forensic Forums 'Birth 1871' a film screening to be followed by a Q and A session Empirical Models of Galaxy Formation - Constraints and Predictions Genetic instability - observation and concepts