On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis.
Martin E. HellmanEhud D. KarninJustin M. ReyneriPublished in: CRYPTO (1981)
Keyphrases
- exhaustive search
- dynamic programming
- brute force
- nearest neighbor search
- computational complexity
- search space
- solution space
- affine transformation
- computationally feasible
- search methods
- affine invariant
- simulated annealing
- lower bound
- secret key
- scatter search
- optimal solution
- neural network
- markov random field
- moment invariants