Cryptanalysis with SAT - a propositional programming environment

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

• Mateusz Srebrny
• Tuesday 14 August 2007, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact Thomas Tuerk.

Room changed

In this talk, a polynomial time translation of integer factorization and the cryptographic hash functions MD5 and SHA -1 into propositional formulas will be presented and discussed, along with some interesting experimental results obtained with the use of the current best SAT solvers. Those computational problems can also serve as benchmark for various SAT solvers.

Propositional satisfiability, SAT , is one of the best known NP-complete problems. There is no feasible algorithm known for testing satisfiability of the propositional formulas in general. Nevertheless, there are algorithms (implemented by so-called SAT solvers, or SAT checkers) that turn out to be feasible and very efficient on many instances of propositional formulas.

On the other hand, no one knows any polynomial run-time solving algorithm for the problem of integer factorization. The famous and challenging cryptosystem RSA was built on the problem in 1977 and has been widely applied since then.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.