Scribd
Upload
36 views

Hash Functions: Presentation by Nilesh Gade

Hash functions map data of any size to a fixed-size bit string known as the hash value or message digest. Hash functions are deterministic, non-predictable, provide collision resistance, and are irreversible. They are used for signing software, verifying digital signatures, securing website connections, storing data blocks for cryptocurrency, ensuring data integrity, and storing password hashes in databases. Common hashing algorithms include Secure Hash Algorithm (SHA), Message Digest (MD), RACE Integrity Primitives Evaluation Message Digest (RIPEMD), and Windows NTHash.

Uploaded by

Nilesh Gade
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
36 views

Hash Functions: Presentation by Nilesh Gade

Hash functions map data of any size to a fixed-size bit string known as the hash value or message digest. Hash functions are deterministic, non-predictable, provide collision resistance, and are irreversible. They are used for signing software, verifying digital signatures, securing website connections, storing data blocks for cryptocurrency, ensuring data integrity, and storing password hashes in databases. Common hashing algorithms include Secure Hash Algorithm (SHA), Message Digest (MD), RACE Integrity Primitives Evaluation Message Digest (RIPEMD), and Windows NTHash.

Uploaded by

Nilesh Gade
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

HASH FUNCTIONS

Presentation by Nilesh Gade

20BSD009
• INTRODUCTION :
■ A hash function is a mathematical algorithm that maps data of any size to a bit string of
a fixed size.
■ We can refer to the function input as message or simply as input. The fixed-size string
function output is known as the hash or the message digest or hash value.
■ Hash Values are simply number but are often written in Hexadecimal.
■ It’s a way to hide your original data to make it as challenging as possible to reverse
engineer.
• Properties of Hash Functions :
■ In order to be an effective cryptographic tool, the hash
function is desired to possess following properties −
1. Determinism.
2. Non-predictable.
3. Collision Resistance.
4. Irreversible.
• Use of Hash Function :
■ Hashing is use for everything signing new software,
verifying digital signatures to securing the website
connections in your computer and mobile web
browsers.
■ Data blocks in cryptocurrency.
■ Data integrity of software, emails, and documents.
■ Passwords and storing password hashes in online
databases.
• Examples of Hashing Algorithms :
1. Secure Hash Algorithm (SHA).
2. Message Digest (MD).
3. RACE Integrity Primitives Evaluation Message Digest
(RIPEMD).
4. Windows NTHash.
THANK YOU

You might also like