Alexander Dreyer: Applying Boolean Groebner Basis to Cryptography and Formal Verification
Alexander Dreyer, Fraunhofer Institute for Industrial Mathematics ITWM
Time: Wed 2012-11-07 13.15
Location: Room E53, Osquars backe 14, KTH
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.