|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 listsEPRG Energy and Environment Seminar Series Lent 2009 Exploring modern South Asian history with visual research methods: theories and practices Imagined Civities
Other talksBeers and Careers: Cambridge Engineering Network Event After Independence: India, Pakistan and Bangladesh Pair-rule patterning in Drosophila: how does it work, and what does it tell us about short-germ segmentation Can the sort of large-scale automatic language processing that interests engineers tell us anything about human language processing? Distribution-Free Detection of Structured Anomalies: Permutation and Rank-Based Scans Making Picturebooks: What an Artist Brings