BDD-Based Cryptanalysis of Keystream Generators
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
OBDD-Based Cryptanalysis of Oblivious Keystream Generators
Theory of Computing Systems
SINGULAR: a computer algebra system for polynomial computations
ACM Communications in Computer Algebra
Extended BDD-based cryptanalysis of keystream generators
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Two trivial attacks on TRIVIUM
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Reducing the space complexity of BDD-Based attacks on keystream generators
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Restart Strategy Selection Using Machine Learning Techniques
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Bivium as a Mixed-Integer Linear Programming Problem
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Scalable formula decomposition for propositional satisfiability
Proceedings of the Third C* Conference on Computer Science and Software Engineering
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Attacking Bivium and Trivium with the characteristic set method
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
A compact encoding of pseudo-boolean constraints into SAT
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
| Hi-index | 0.00 |
In 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.