SHA-1 algorithm

Hello!

I'm working on a implementing the hash algorithm SHA-1. I know might be a bit of a longshot to ask about that here, but I'll give it a try.

I've been trying to implement the algorithm using the following two documents:

http://www.ietf.org/rfc/rfc3174.txt

http://signal.hut.fi/~kjarvine/documents/sha.pdf

In SHA-1 there is a message to be hashed, the message is padded to blocks of 512 bits width. The algorithm then has 80 steps to calculate the hash for each 512 bit block.

The first sixten steps a different 32-bit word is taken from the 512 bit block, called w_t where t is 0:15. What I'm not entierly shure of is if w_0 is the 32 most significant bits or the 32 least sigificant bits of 512 bit block.

Best regards,

Ola Bångdahl