A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Equivalency reasoning to solve a class of hard SAT problems
Information Processing Letters
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Algorithms for solving linear and polynomial systems of equations over finite fields, with applications to cryptanalysis
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Trivium: a stream cipher construction inspired by block cipher design principles
ISC'06 Proceedings of the 9th international conference on Information Security
Extending Clause Learning DPLL with Parity Reasoning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Sensitivity versus block sensitivity of Boolean functions
Information Processing Letters
DPLL+ROBDD Derivation applied to inversion of some cryptographic functions
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Exposing iClass key diversification
WOOT'11 Proceedings of the 5th USENIX conference on Offensive technologies
Algebraic precomputations in differential and integral cryptanalysis
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Parallel logical cryptanalysis of the generator A5/1 in BNB-grid system
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
COSADE'12 Proceedings of the Third international conference on Constructive Side-Channel Analysis and Secure Design
Lynx: a programmatic SAT solver for the RNA-folding problem
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Conflict-driven XOR-clause learning
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Learning polynomials over GF(2) in a SAT solver
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
When boolean satisfiability meets gaussian elimination in a simplex way
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Gone in 360 seconds: Hijacking with Hitag2
Security'12 Proceedings of the 21st USENIX conference on Security symposium
SAS+ planning as satisfiability
Journal of Artificial Intelligence Research
Classifying and propagating parity constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Security margin evaluation of SHA-3 contest finalists through SAT-Based attacks
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Controversy Corner: Efficient Hamming weight-based side-channel cube attacks on PRESENT
Journal of Systems and Software
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
COSADE'13 Proceedings of the 4th international conference on Constructive Side-Channel Analysis and Secure Design
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Knowledge compilation for model counting: affine decision trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain problems and have successfully been used to test hardness assumptions. This paper extends a SAT solver to efficiently work on cryptographic problems. The paper further illustrates how SAT solvers process cryptographic functions using automatically generated visualizations, introduces techniques for simplifying the solving process by modifying cipher representations, and demonstrates the feasibility of the approach by solving three stream ciphers. To optimize a SAT solver for cryptographic problems, we extended the solver's input language to support the XOR operation that is common in cryptography. To better understand the inner workings of the adapted solver and to identify bottlenecks, we visualize its execution. Finally, to improve the solving time significantly, we remove these bottlenecks by altering the function representation and by pre-parsing the resulting system of equations. The main contribution of this paper is a new approach to solving cryptographic problems by adapting both the problem description and the solver synchronously instead of tweaking just one of them. Using these techniques, we were able to solve a well-researched stream cipher 26 times faster than was previously possible.