Encryption has a remarkably long and varied history. spies have been using it to convey secret messages ever since there were secret messages to convey. one powerful method of encryption uses random digits. two documents are prepared with the same random sequence of numbers. the spy is sent out with one and the spy master retains the other. the digits are used as follows. suppose that the word to be encrypted is spy and the random digits are 352. then s becomes v (three letters after s), p becomes u (five letters after p), and y becomes a (two letters after y, restarting at a after z). the spy would encrypt a message and then destroy the document used to encrypt it. this is an early example of a. a hashing algorithm. b. asymmetric key encryption. c. symmetric key encryption. d. public key encryption.