|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 listsBiology is Technology: The Promise, Peril, and New Business of Engineering Life Cambridge Central Asia Forum Assessment Principles
Other talksHow Inflammation-Driven Angiogenesis Impacts Extracellular Matrix Turnover & Organ Fibrosis Towards a molecular psychophysics of decision making in neuro-development and repair Imaging phagocytosis: receptors, phospholipids and the cytoskeleton The Interpretation of Musical Notation: A Performer’s View Impulsivity and compulsivtiy; Neural substrates and neuropsychiatric implications. Meta-Interpretive Learning and Program Induction