Alexander Dreyer: Applying Boolean Groebner Basis to Cryptography and Formal Verification

We will present and discuss some application examples for Boolean Groebner basis from cryptography and formal verification.

Computing Groebner basis is of double-exponential complexity in worst case. But thanks to very sophisticated heuristics a plenty of practical problem can be solved in reasonable time.

We will also talk about (still) open problems.