|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 listsMelville Laboratory Seminars Qualitative Research Forum - Open meetings Plant Sciences Departmental Seminars
Other talksAdaptive computations for flexible cognition in the human brain CERF in the City Mendel the fraud? A social history of truth in genetics Role of Pair and Higher Order Correlations in Entropy and Dynamics of Glass Forming Systems The Historian's Task in the Anthropocene: Finding a Useful Past in Japan Production Processes Group Seminar - "Carbon Footprint in the Cement Industry: Performance Variation and its Causes"