Below is a bit level representation of your message.

Your message contains bits. A given message needs be a specific number of bits (commonly 448 mod 512). Since your message is we will add because: MOD 512 = We will add ONE 1 and ZEROS. After this operation a 64 bit value which represents the original length of the message is appended to the message. For this particular message the input value added will be . So the message after all appending operations are complete will look like, at the bit level the text box below. If you look at the end of message you should be able to identify the added bits.

At this point the message is prepared and will be inputted into the heart of the hash algorithm This portion of the algorithm takes a variable number of 512 bit blocks and outputs a fixed length message digest. This digest is appended to the end of the original message.

Now your message could be sent across a vulnerable network and the receiver of your message could verify your message's authenticity by running it through the same hashing algorithm and comparing the digest created after transit with the the one created before.

This was created as part of the Cryptography Module of NSF Award No. 0113627: "Increasing Security Expertise in Aviation-oriented Computing Education: A Modular Approach", at Embry-Riddle Aeronautical University in Prescott, Arizona.

Created by Nathaniel Alderson