On the necessity of cryptanalytic exhaustive search.

Martin E. Hellman Ehud D. Karnin Justin M. Reyneri

Published in: SIGACT News (1983)

Keyphrases

exhaustive search
brute force
computational complexity
search space
dynamic programming
computationally feasible
search methods
solution space
nearest neighbor search
optimal solution
simulated annealing
lower bound
learning algorithm
special case
greedy search