Problem
a) Give an explanation of the relation between brute force and exhaustive search.
b) Learn about the basic idea of Caesar's Cipher and ABS. Are they vulnerable to brute force attacks? Explain your answer.
c) Why does the naive solution to primality testing (for input n, checking if x E {2, 3, ..., n - 1} divides a) grow exponentially?