The security model for encryption that we learned in class involved distinguishing a black box containing real encryption from a black box that returned the same number of random bits.

For each of the following modes, if the permutation's block length is b bits, at about how many permutation calls does the mode become easy to distinguish?

Note: popup menus can't do math formatting, so sqrt is square root and pow$($a$,$b$)$ is ab$.$