Using SAT Solvers for Cryptographic Problems

Add to your list(s) Download to your calendar using vCal

• Mate Soos, U. Pierre & Marie Curie
• Friday 05 November 2010, 14:00-15:00
• Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This talk has been canceled/deleted

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:

This talk is not included in any other list

Note that ex-directory lists are not shown.