|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 listsConference CUSAS Forum Speaker Series Cambridge Central Asia Forum
Other talksMod-Phi Convergence: precise asymptotics and local limit theorems for dependent random variables: IV Large scale genomic analyses of complex traits in human populations. Computer Science and Social Mobility High-content microscopy: big-data biology goes spatio-temporal Death and sanitation: Imperial representations of The Ganges Hedgehog signalling and cell polarity in killer lymphocytes