Show that Trudy’s known-plaintext attack, in which she knows the (ciphertext, plaintext) translation pairs for seven letters, reduces the number of possible substitutions to be checked in the example in Section 8.2.1
by approximately 109 .
Subtract 7 from total number of letters 26 is 19.
19 factorial words can be got. For 26 factorial words,it is difference of approximately 10^9.