Applications of SAT Solvers to Cryptanalysis of Hash Functions
From MaRDI portal
Publication:5756584
DOI10.1007/11814948_13zbMath1187.94028OpenAlexW2131719221MaRDI QIDQ5756584
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11814948_13
Cryptography (94A60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (26)
Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath ⋮ Preprocessing for DQBF ⋮ Side-channel cryptographic attacks using pseudo-Boolean optimization ⋮ Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms ⋮ A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions ⋮ Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE ⋮ Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP ⋮ A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure ⋮ A View from the Engine Room: Computational Support for Symbolic Model Checking ⋮ The complexity of inverting explicit Goldreich's function by DPLL algorithms ⋮ Mind the propagation of states. New automatic search tool for impossible differentials and impossible polytopic transitions ⋮ Algebraic and Slide Attacks on KeeLoq ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Empirical Study of the Anatomy of Modern Sat Solvers ⋮ On propositional coding techniques for the distinguishability of objects in finite sets ⋮ Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA ⋮ Algebraic Cryptanalysis of the Data Encryption Standard ⋮ Unnamed Item ⋮ Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks ⋮ Practical Algebraic Attacks on the Hitag2 Stream Cipher ⋮ Covered clauses are not propagation redundant ⋮ Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages ⋮ Automatic verification of differential characteristics: application to reduced Gimli ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 ⋮ Study of discrete automaton models of gene networks of nonregular structure using symbolic calculations ⋮ Hash-based preprocessing and inprocessing techniques in SAT solvers
Uses Software
This page was built for publication: Applications of SAT Solvers to Cryptanalysis of Hash Functions
