Use modular arithmetic to find the digest of a message. Figure 11.16 shows the procedure. The steps are as follows: a. Let the length of the message digest be m bits. b. Choose a prime number, p, of m bits as the modulus. c. Represent the message as a binary number and pad the message with extra 0s to make it multiple of m bits. d. Divide the padded message into N blocks, each of m bits. Call the ith block Xi . e. Choose an initial digest of m bits, H0. f. Repeat the following N times: Hi = (Hi-1 Xi ) 2 mod p g. The digest is HN. What is the value of the digest if the message is HELLO? Why is this digest not secure?