|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 listsCreative Research at Museum of Archaeology & Anthropology Type the title of a new list here Chemistry Departmental-wide lectures
Other talksThe Emergence of the Sovereign Consumer – from Adam Smith to the Socialist Calculation Debate Explorations in computing motion and their implications for motion processing in monkey and man. Postgraduate Diploma in Entrepreneurship webinar Celebrating (or Not) the Centenary of the Russian Revolution Revealing my purpose - Spirituality in Daily Life series Production Processes Group Seminar - TBC