|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 listsSustainability in the Built Environment (GreenBRIDGE) Meditation Laboratory Statistical Laboratory Graduate Seminars
Other talks'Careers in Renewables' + 'Shale Gas in the UK: will it solve our energy issue?' The Science of Whisky - A tasting tour of Scotland's finest ‘Though this be madness, yet there is method in't’. Landscapes and Identities: the case of the English Landscape c. 1500 BC – AD 1086 The Interactive Christmas Quiz Institutions and their Discontents: Rethinking Economic Development in South Asia Modeling Tumorigenesis and Drug Resistance in Three Dimensions