Scribd
Upload
8 views4 pages

Sha 1

SHA-1 is a cryptographic algorithm that produces a 160-bit hash value from an input message through a series of processing steps including padding, word computation, and iterative rounds. It has key properties such as determinism, fixed output size, and collision resistance, but is now considered insecure due to vulnerabilities to collision attacks. As a result, SHA-1 is deprecated in favor of more secure algorithms like SHA-256 and SHA-3.

Uploaded by

vian703233
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views4 pages

Sha 1

SHA-1 is a cryptographic algorithm that produces a 160-bit hash value from an input message through a series of processing steps including padding, word computation, and iterative rounds. It has key properties such as determinism, fixed output size, and collision resistance, but is now considered insecure due to vulnerabilities to collision attacks. As a result, SHA-1 is deprecated in favor of more secure algorithms like SHA-256 and SHA-3.

Uploaded by

vian703233
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

SHA-1(Secure Hash Algorithm)

SHA-1 or Secure Hash Algorithm 1 is a cryptographic algorithm that


takes an input and produces a 160-bit (20-byte) hash value. This hash
value is known as a message digest. This message digest is usually
then rendered as a hexadecimal number which is 40 digits long.
How SHA-1 Works
The block diagram of the SHA-1 (Secure Hash Algorithm 1)
algorithm. Here’s a detailed description of each component and
process in the diagram:
Components and Process Flow:
1. Message (M):
 The original input message that needs to be hashed.
2. Message Padding(64 bit less than exact multiple of 512)
 The initial step where the message is padded to ensure its length
is congruent to 448 modulo 512. This step prepares the message
for processing in 512-bit blocks.
3. Round Word Computation (Wt):
 After padding, the message is divided into blocks of 512 bits,
and each block is further divided into 16 words of 32 bits. These
words are then expanded into 80 32-bit words, which are used in
the subsequent rounds.
4. Round Initialize (A, B, C, D, and E):
 Initialization of five working variables (A, B, C, D, and E) with
specific constant values. These variables are used to compute the
hash value iteratively.

 A = 0x67452301
 B = 0xEFCDAB89
 C = 0x98BADCFE
 D = 0x10325476
 E = 0xC3D2E1F0

5. Round Constants (K1t to K2t):


 SHA-1 uses four constant values (K1t,K2t,K3t,K4t), each
applied in a specific range of rounds:
o K1t for rounds 0-19
o K2t for rounds 20-39
o K3t for rounds 40-59
o K4t for rounds 60-79
6. Rounds (0-79):
 The main computation loop of SHA-1, divided into four stages
(each corresponding to one of the constants K1t to K4t). In each
round, a combination of logical functions and operations is
performed on the working variables (A, B, C, D, and E) using
the words generated in the previous step.
7. Final Round Addition:
 After all 80 rounds, the resulting values of A, B, C, D, and E are
added to the original hash values to produce the final hash.
8. MPX (Multiplexing):
 Combines the results from the final round addition to form the
final message digest.
Summary of Steps:
 Input (Message M): The process starts with the input message
MMM.
 Message Padding: The message is padded to meet the length
requirements.
 Word Computation: The padded message is divided into blocks
and further into words, which are expanded for use in the rounds.
 Initialization: Initial hash values are set.
 Round Processing: The main loop performs 80 rounds of
computation using the message words and round constants.
 Final Addition: The results from the rounds are added to the initial
hash values.
 Output (Hash Value): The final message digest is produced.

Key Properties of SHA-1:


1. Deterministic: The same input always produces the same output.
2. Fixed Output Size: Regardless of the input size, the output (hash)
is always 160 bits.
3. Efficient: It can be computed quickly, even for large data.
4. Pre-image resistance: It should be computationally infeasible to
find an input that hashes to a specific hash value.
5. Small changes in input drastically change the output (avalanche
effect).
6. Collision resistance: It is difficult to find two different inputs that
produce the same hash.
Security Considerations:

 Collision Vulnerabilities: SHA-1 is no longer considered secure


for cryptographic purposes because of vulnerabilities to collision
attacks (two different messages producing the same hash).
 Deprecation: SHA-1 is deprecated in favor of more secure
algorithms like SHA-256 and SHA-3, especially for uses like
SSL/TLS certificates and digital signatures.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy