From a Logical Approach to Internal States of Hash Functions - How SAT Problem Can Help to Understand SHA-* and MD*.
Florian LegendreGilles DequenMichaël KrajeckiPublished in: SECRYPT (2013)
Keyphrases
- hash functions
- internal states
- sat problem
- input output
- satisfiability problem
- np complete
- constraint satisfaction problems
- similarity search
- sat solvers
- phase transition
- boolean satisfiability
- locality sensitive
- max sat
- randomly generated
- sat instances
- hamming distance
- data distribution
- random sat instances
- decision problems
- stochastic local search
- nearest neighbor search
- locality sensitive hashing
- propositional satisfiability
- orders of magnitude
- constraint satisfaction
- block cipher
- internal state
- low dimensional
- data streams
- weighted max sat
- hamming space
- search algorithm