Cryptography and SAT Solvers -- Why and How

In this presentation we give a brief overview of cryptography and show how and why SAT solvers are an important tool in this field. We approach SAT solvers from a particular angle that allows us to make use of SAT solvers in ways that is not readily apparent if approached from the typical resolution-engine viewpoint. The presentation will first describe this particular angle, then show how it can be used to break and analyse cryptographic primitives, and finally show some real-world examples to crypto-primitives that have been seriously compromised through of such attacks.

Mate Soos, Security Research Labs

Mate Soos is a cryptographer specializing in analysing cryptographic primitives using SAT solvers. Mate graduated from Budapest's University for Technology and Economics (BUTE) in 2006 and finished his PhD in 2009 from INRIA, Grenoble. He is currently working at Security Research Labs.