Scribd
Upload
11 views1 page

Secure Hash Functions

Secure Hash Functions (SHFs) are cryptographic functions that convert any input into a fixed-size output securely. Key properties include determinism, fast computation, pre-image resistance, second pre-image resistance, collision resistance, and the avalanche effect. Popular SHFs include SHA-1, SHA-256, SHA-512, SHA-3, and BLAKE2, each with varying levels of security and output sizes.

Uploaded by

Iniyavanibtech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views1 page

Secure Hash Functions

Secure Hash Functions (SHFs) are cryptographic functions that convert any input into a fixed-size output securely. Key properties include determinism, fast computation, pre-image resistance, second pre-image resistance, collision resistance, and the avalanche effect. Popular SHFs include SHA-1, SHA-256, SHA-512, SHA-3, and BLAKE2, each with varying levels of security and output sizes.

Uploaded by

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

Secure Hash Functions

ChatGPT said:

Great! Let's explore Secure Hash Functions, first in English and then in Tamil for better
understanding.

🔐 Secure Hash Functions (SHFs)

A Secure Hash Function is a special kind of cryptographic function that turns any input (text, file,
etc.) into a fixed-size output — usually called a hash or digest — in a secure way.

✅ Key Properties of Secure Hash Functions:

1. Deterministic

o Same input always gives the same output.

2. Fast Computation

o Hashes should be quick to compute for any input.

3. Pre-image Resistance

o Given a hash, it should be very hard to find the original input.

4. Second Pre-image Resistance

o Given one input and its hash, you shouldn't be able to find a different input with the
same hash.

5. Collision Resistance

o No two different inputs should result in the same hash.

6. Avalanche Effect

o Small changes in input should cause big changes in output.

🔐 Popular Secure Hash Functions:

Algorithm Output Size Notes

SHA-1 160 bits Deprecated (not secure now)

SHA-256 256 bits Strong, widely used

SHA-512 512 bits Higher strength

SHA-3 256–512 bits Newer standard, very secure

BLAKE2 Variable Fast and secure alternative

You might also like