Programmable Devices
CPLDs, FPGAs, SoC FPGAs, Configuration, and Transceivers
Announcements
FPGA community forums and blogs on community.intel.com are migrating to the new Altera Community and are read-only. For urgent support needs during this transition, please visit the FPGA Design Resources page or contact an Altera Authorized Distributor.
21615 Discussions

SHA-1 algorithm

Altera_Forum
Honored Contributor II
‎11-27-2009 03:05 PM
1,275 Views

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
0 Kudos

Link Copied

1 Reply
Altera_Forum
Honored Contributor II
‎03-14-2014 07:02 AM
513 Views

w_0 is the most significant bit. 

suppose you have entered 'abcdefgh' then the w_0 will store 'abcd'.
0 Kudos
Copy link
Reply

Community support is provided Monday to Friday. Other contact methods are available here.

Intel does not verify all solutions, including but not limited to any file transfers that may appear in this community. Accordingly, Intel disclaims all express and implied warranties, including without limitation, the implied warranties of merchantability, fitness for a particular purpose, and non-infringement, as well as any warranty arising from course of performance, course of dealing, or usage in trade.

For more complete information about compiler optimizations, see our Optimization Notice.