|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 listsWhipple Museum of the History of Science Centre for Commonwealth Education (CCE) Darwin Humanities and Social Sciences Seminar
Other talksModulation spectrum-based approach to high-quality statistical parametric speech synthesis Sex and Death Evolution of turbulence and buoyancy under strong rotation - the role of inertial waves in structure formation Mestizo genomics: race mixture, nation and science in Latin America Genetic instability - observation and concepts Jumps, twists & reflections in integrable field theories