Scribd
Upload
3 views8 pages

HASH FUNCTIONS

Hash functions convert arbitrary-length input into fixed-length output, ensuring data integrity, password protection, and collision resistance. They are efficient, provide features like pre-image resistance, and are designed to produce vastly different hashes from small input changes. Popular hash functions include MD5, SHA-1, SHA-2, SHA-3, RIPEMD-160, and Whirlpool, with applications in password storage and data integrity.

Uploaded by

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

HASH FUNCTIONS

Hash functions convert arbitrary-length input into fixed-length output, ensuring data integrity, password protection, and collision resistance. They are efficient, provide features like pre-image resistance, and are designed to produce vastly different hashes from small input changes. Popular hash functions include MD5, SHA-1, SHA-2, SHA-3, RIPEMD-160, and Whirlpool, with applications in password storage and data integrity.

Uploaded by

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

HASH

FUNCTIONS
Definition:

Hash functions are essential for security,


ensuring data integrity, password protection,
and collision resistance

 Converts arbitrary-length input


into fixed-length output (hash
value).

 Output is called a message


digest or hash.
Features
of Hash
Functions

1. Fixed-Length Output:

- Converts data of any size to a fixed-size hash.


- Acts as a compression function.
- Example: n-bit hash functions (e.g., 160 to 512 bits).

2. Efficiency:

- Fast computation of hash values.


- Faster than symmetric encryption.
Features
of Hash
Functions

 Pre-Image Resistance:
- Hard to reverse: Cannot retrieve input from hash.

 Second Pre-Image Resistance:


- Hard to find a different input with the same hash.

 Collision Resistance:
- Hard to find two inputs with the same hash.
- Ensures security against forgery.
Design of Hashing
Algorithms

- Uses a hash function operating on


fixed-size data blocks.
- Avalanche Effect: Small input changes
produce vastly different hashes.
- Combines results from previous blocks
for final hash.
Popular Hash Functions

1. MD (Message Digest):
- MD5 (128-bit): Widely used but compromised due to collisions.

2. SHA (Secure Hash Algorithm):


- SHA-1 (160-bit): Popular but vulnerable.
- SHA-2 (e.g., SHA-256, SHA-512): Strong and widely used.
- SHA-3: Based on Keccak, efficient and secure.

3. RIPEMD:
- RIPEMD-160: Improved and widely used.

4. Whirlpool:
- 512-bit hash based on AES design
Applicatio
ns of Hash
Functions

 Password Storage:
- Stores hashed passwords instead of
plaintext.
- Protects against unauthorized access.

 Data Integrity:
- Ensures data has not been altered.
THANK YOU ….

You might also like