Invited talk: Applying Satisfiability to the Analysis of Cryptography

Dr. Aaron Tomb, research lead in Software Correctness at Galois, delivered the invited talk last Friday, Sept 25, 2015 at SAT 2015, the International Conference on Theory and Applications of Satisfiability Testing. In the talk Dr. Tomb walked through the properties of cryptographic code that are within the reach of existing solvers, and described some of the tools in applying SAT solvers to cryptographic algorithms.

PERMALINK