|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 listsCambridge Classical Reception Seminar Series Cambridge Research Seminar in Political Economy Cambridge University Linguistic Society
Other talksFunctional genomics for schistosomes: approaches to interrogate host-parasite interaction, and schistosomiasis-associated diseases. The human brain - a lesson in green technology Non-melanoma skin cancer:- estimating the size of the elephant in the NHS room Solving the current crisis in the NHS: why the powers that be are missing the point and why they don’t need to. Open Innovation Forum Food & FMCG Pitching Event Monopole chains with cyclic symmetry