1. Alice creates message m and calculates the hash H(m) (for example with SHA-1).
2. Alice then appends H(m) to the message m, creating an extended message (m, H(m)), and sends the extended message to Bob.
3. Bob receives an extended message (m, h) and calculates H(m). If H(m) = h,Bob concludes that everything is fine.