Hi!

I am wondering whether it would be worth to implement a SHA1 hash calculation over given memory address range. In this way one could assure for example that the binary image version is correct or that binary image is intact.

For those who are not familiar waith SHA1 (or other hash algorithms), the SHA1 algorithm computes a 160 bit "fingerprint" of given byte stream. The algorithm is designed so that collisions between any given byte stream is "unlikely" as it is very unlikely that two persons have identical fingerprints or dna.

Wikipedia: http://en.wikipedia.org/wiki/SHA-1

Source code: http://www. cr0.net:8040/code/crypto/sha1/

Any comments?

br,

Tom