|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 listsCombining chemical-genetic with metabolic profiling to study a dynamic metabolic transition Civic Matter Faculty Research Group @ CRASSH Judge Business School
Other talksSea monsters to sonar: mapping the Polar oceans Revisiting the Urban Graveyard Debate: An analysis of mortality differences between natives and migrants in North-Western European port cities: Antwerp, Rotterdam and Stockholm, 1850-1930 Talyllyn Railway - 21st Century Engineering on a 150 Year Old Railway Activation and inhibition of the phosphoinositide 3-kinase family of enzymes Second Language Acquisition of Chinese and Thai Nominal Phrases (Part II) TBC