|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 listsBiology and bioengineering tools in the treatment of H2020 age-related diseases The Impact of Social Science Research Political Thought and Intellectual History
Other talksFood Allergy 2016 New mechanisms of inflammasome activation The 2017 Sports Science Summit Color-kinematics duality for QCD and pure gravities FESTIVAL of WELLBEING 2016 Statistical Modelling using Linked Data - Issues and Opportunities