Discuss SHA-1 algorithm in brief?

This standard specifies a Secure Hash Algorithm (SHA), which is necessary to ensure the security of the Digital Signature Algorithm (DSA). When a message of any length < 264 bits is input, the SHA produces a 160-bit output called a message digest. The message digest is then input to the DSA, which computes the signature for the message. Signing the message digest rather than the message often improves the efficiency of the process, because the message digest is usually much smaller than the message. The same message digest should be obtained by the verifier of the signature when the received version of the message is used as input to SHA. The SHA is called secure because it is designed to be computationally infeasible to recover a message corresponding to the message digest. Any change to the message in transit will, with a very high probability, result in a different message digest, and the signature will fail to verify. The SHA is based on principles similar to those used by Professor Ronald L. Rivest of MIT when designing the MD4 message digest algorithm, and is closely modelled after that algorithm.

  1. SHA originally designed by NIST & NSA in 1993
  2. was revised in 1995 as SHA-1
  3. US standard for use with DSA signature scheme
    • standard is FIPS 180-1 1995, also Internet RFC3174
    • nb. the algorithm is SHA, the standard is SHS
  4. based on design of MD4 with key differences
  5. produces 160-bit hash values
  6. recent 2005 results on security of SHA-1 have raised concerns on its use in future applications

Steps of SHA-1:

  1. Step 1: Append padding bits
  2. Step 2: Append length
  3. Step 3: Initialize hash buffer
  4. Step 4: Process the message in 512-bit (16-word) blocks, which forms the heart of the algorithm
  5. Step 5: Output the final state value as the resulting hash

SHA-1 Compression Function:

  1. Each round has 20 steps which replaces the 5 buffer words thus:
    (A,B,C,D,E) <-(E+f(t,B,C,D)+(A<<5)+Wt+Kt),A,(B<<30),C,D)
  2. a,b,c,d refer to the 4 words of the buffer
  3. t is the step number
  4. f(t,B,C,D) is nonlinear function for round
  5. Wt is derived from the message block
  6. Kt is a constant value derived from sin


SHA-1 verses MD5:

  1. Brute force attack is harder (160 vs 128 bits for MD5)
  2. not vulnerable to any known attacks (compared to MD4/5)
  3. a little slower than MD5 (80 vs 64 steps)
  4. both designed as simple and compact
  5. optimised for big endian CPU’s (vs MD5 which is optimised for little endian CPU’s)

Leave a Reply

Your email address will not be published. Required fields are marked *