next up previous
Next: 6.1 Introduction to ``Hill-Climbing'' Up: Project 7 Decryption Write-Up: Previous: 5.3 Exhaustive Search

6. Improving Decryption Methods with Swaps

Recall that it is infeasible to exhaustively search over all the keys, so we must look at a small subset of all the possible keys, i.e. perform an incomplete search. To motivate our incomplete search algorithm, let us take another look at the exhaustive search from Figure 29 in the previous section.



 

Thomas Yan
2000-05-01