Basic principles of mechanical theorem proving in elementary geometrics
Journal of Automated Reasoning
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Cube Attacks on Tweakable Black Box Polynomials
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Two trivial attacks on TRIVIUM
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Chosen IV statistical analysis for key recovery attacks on stream ciphers
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Attacking Bivium using SAT solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Hi-index | 0.01 |
In this paper we utilize an algebraic method called the characteristic set method to attack Bivium and Trivium in the guess-and-determine way. Our attack focuses on recovering the internal states of these two ciphers. We theoretically analyze the performance of different guessing strategies in the guess-and-determine method and present a good one. We show a large amount of experimental results about these two problems with different parameters. From these experimental data we obtain the following results. For Bivium, with 177-bit keystream the expected attack time by the characteristic set method is about 231.81 seconds. And for Trivium, with 288-bit keystream the expected attack time is about 2114.27 seconds.