|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 University Wildlife Conservation Society's list Yishu's list cerf
Other talksCentre for Industrial Sustainability 5th Annual Conference - Capturing Sustainable Value Ice Templated Structures for Regenerative Medicine Hello From the Other Side: The Cutting Edge of Skeletal Reconstruction in Human Medicine’ From Sea to Shining Sea: The Future of American Education in a post-federalist era. Taxonomy, Translatability and Intelligibility of Scientific Images Biomedical Engineering: problem solving using clinical and biomedical applications