Attacking Bivium Using SAT Solvers
From MaRDI portal
Publication:3502695
DOI10.1007/978-3-540-79719-7_7zbMath1138.68536OpenAlexW1493429498MaRDI QIDQ3502695
Tobias Eibach, Gunnar Völkel, Enrico Pilz
Publication date: 27 May 2008
Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_7
Cryptography (94A60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
On black-box optimization in divide-and-conquer SAT solving ⋮ Mutant Differential Fault Analysis of Trivium MDFA ⋮ Optimising Gröbner bases on Bivium ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Finding Effective SAT Partitionings Via Black-Box Optimization ⋮ Attacking Bivium and Trivium with the Characteristic Set Method ⋮ Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA ⋮ Unnamed Item ⋮ Improving OBDD attacks against stream ciphers ⋮ Numerical solvers and cryptanalysis ⋮ An algebraic attack to the Bluetooth stream cipher \textsc{E0} ⋮ Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages ⋮ A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters
Uses Software
Cites Work
- OBDD-based cryptanalysis of oblivious keystream generators
- New stream cipher designs. The eSTREAM finalists
- Slimgb: Gröbner bases with slim polynomials
- Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators
- Branching Programs and Binary Decision Diagrams
- SINGULAR
- Extended BDD-Based Cryptanalysis of Keystream Generators
- Two Trivial Attacks on Trivium
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
