|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 lists8th International Prader-Willi Syndrome Organisation conference Cambridge Carbon Nanotechnology Society MRC Human Nutrition Research
Other talksHow does an industrial reviewer assess a grant bid? Jewellers, travellers and the classification of gems, c. 1600–1800 ICASSP presentations Disturbance Amplification in Mass Chains: how to prevent buildings from falling over Silent Cinema and the Comedy of Birth: An Evening of Shorts (1896–1935) Solving the Hartree-Fock equations using the finite element method