BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Using SAT Solvers for Cryptographic Problems - Mate Soos\, Pierre 
 and Marie Curie University
DTSTART:20101105T140000Z
DTEND:20101105T150000Z
UID:TALK27778@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:As SAT solvers have become more advanced\, their use-cases hav
 e expanded. One such area where SAT solves now competitively perform is cr
 yptography. In this talk we investigate why and how SAT solvers are used i
 n cryptography\, and what advantages they bring relative to other solving 
 methods such as brute force or Grobner basis algorithms. We present severa
 l specific use-cases and highlight some future possibilities.
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR