Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitleAttacking Bivium using SAT solvers.
Author(s) Tobias Eibach, Enrico Pilz, Gunnar Völkel
TypeBook, Chapter in Book, Conference Proceeding
AbstractIn this paper we present experimental results of an application of SAT solvers in current cryptography. Trivium is a very promising stream cipher candidate in the final phase of the eSTREAM project. We use the fastest industrial SAT solvers to attack a reduced version of Trivium called Bivium. Our experimental attack time using the SAT solver is the best attack time that we are aware of, it is faster than the following attacks: exhaustive search, a BDD based attack, a graph theoretic approach and an attack based on Gröbner bases. The attack recovers the internal state of the cipher by first setting up an equation system describing the internal state, then transforming it into CNF and then solving it. When one implements this attack, several questions have to be answered and several parameters have to be optimised.
KeywordsSAT Solver, Application, Cryptography
URL http://link.springer.com/chapter/10.1007%2F978-3-540-79719-7_7
PublisherBerlin: Springer
Translation No
Refereed No