Finding Preimages in Full MD5 Faster Than Exhaustive Search.
Yu SasakiKazumaro AokiPublished in: EUROCRYPT (2009)
Keyphrases
- exhaustive search
- computational complexity
- dynamic programming
- brute force
- solution space
- nearest neighbor search
- search methods
- computationally feasible
- search space
- simulated annealing
- optimal solution
- artificial intelligence
- special case
- neural network
- database
- lower bound
- multiscale
- clustering algorithm
- data mining
- real world