|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 listsType the title of a new list here Health Mongolia & Inner Asia Studies Unit Seminar Series
Other talksThe search for neurophysiological biomarkers of dementia using MEG and Performing and mediating science on television National and Regional Institutional Dynamics in the Aftermath of Non-Traditional Security Crises in Southeast Asia. What role for the EU? Sea monsters to sonar: mapping the Polar oceans Electron and nuclear spin qubits based on donors in silicon (Prof. John J. L. Morton, University College London) Maps and seafarers in the English Channel (eighteenth century)