|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 listsAnglia Ruskin University - Community Engagement Electron Microscopy Group Seminars Humanitas lectures
Other talksLung cancer, biomarkers and unanswered questions - a clinical translational perspective Further Thoughts on the Undivided Past The balance of power: accretion and outflow in black holes and neutron stars Where's the Matter? (Tails from the Milky Way's destructive past) A scalable approach to the design of large networks HGV-Cyclist collision avoidance