Build the hardware deployment for the following algorithm:

The word M0 is the most significant. Similarly, the variable B0 is that more significant. In the first clock cycle, B0 is set to M0 (the first word of the message M) and is delivered at the exit. Starting with second clock cycle, variable B0 is updated according to algorithm on the previous page and delivered to the output. The functions and are related:

Draw a block diagram for implementation and build a testbench for non-exhaustive verification.

Input: Message M made up of 32-bit words Mi, i = 0... 15 Output: 32-bit word Bo Deliver Bo in each iteration 1: procedure MESSAGESCHEDULE(M) 2: Bo Mo Initialize the 16, 32-bit variables B; from message's words Mi 3: B1 + M1 4: 5: B14+ M14 6: B15 M15 7: for i = 0 to 63 do Update value of the 16 variables B; 8: U 01(B14) + Be + 00(B1) + Bo 9: Bo + Bi 10: B1 B2 11: 12: B14 + B15 13: B15 U 14: end for 15: end procedure = X oo(x) = right_rotate(x, 7) right_rotate(x, 18) right_shift(x, 3) 01(x) = right_rotate(x, 17) Oright_rotate(x, 19) right_shift(x, 10) Docenti diaarom blan nantruimnlementare i construiti