Understanding Hashing
Join us as we delve into the world of hashing, exploring its
fundamentals, methodologies, and diverse applications across
various domains.
PRESENTED BY: IDUME VICTORY AJIRIOGHENE & CHIDUBEM
CELESTINE CHIDALU
Introduction to Hashing
Definition Key Features
Hashing converts data into a fixed-length string using a Fixed-length output, one-way (irreversible), and
mathematical function, known as a hash. collision-resistant, making it suitable for data integrity
verification, password security, and supporting
blockchain systems.
Why Hashing Matters
Data Integrity Password Security
Ensures data remains Prevents unauthorized access
unchanged during by storing password hashes
transmission, safeguarding instead of plain text, making
against accidental or it difficult to recover the
malicious alterations. original password.
Data Lookup Cryptographic Systems
Provides efficiency in data Enhances security in
lookup operations, such as in cryptographic systems by
hash tables, allowing quick ensuring data authenticity
retrieval of data based on its and integrity, crucial for
hash value. secure communication and
transactions.
Methodology
Hash Function Basics Steps to Calculate a Hash
A hash function takes any input data and produces a 1. Choose a hashing algorithm, such as SHA-256.
fixed-length hash value. This value is independent of 2. Input the data you want to hash.
the input's size, making it suitable for various data
3. Apply the selected algorithm to compute the hash
sizes.
value.
Example Problem
Problem
Compute the hash value for "ABC" using a simple hypothetical hash
1 function.
Steps
Convert "ABC" to ASCII values: A = 65, B = 66, C =
2
67. Sum the values: 65 + 66 + 67 = 198. Take the
result modulo 10: 198 mod 10 = 8. Hash: 8.
Advanced Hashing Concepts
Collision Salt
Occurs when two distinct inputs Random data added to passwords
generate the same hash value, before hashing, enhancing security
potentially compromising security. by preventing brute force attacks
and rainbow table attacks.
Cryptographic Hashing
Hashing algorithms specifically
designed for security, such as SHA-2
and bcrypt, offering greater
resistance to collisions and reverse
engineering.
Conclusion
Crucial
1
Hashing plays a vital role in modern computing, ensuring data integrity, security, and efficiency.
Strength
2 The strength of a hashing algorithm lies in its ability to produce unique, irreversible, and
consistent outputs for any given input.
Implementation
3 Proper implementation is crucial to prevent vulnerabilities like hash collisions
or reverse engineering, ensuring robust security.
Foundation
Hashing serves as a foundational element in fields like
4
cybersecurity, data management, and blockchain technology,
enabling secure and efficient operations.
Hashing: A Journey into the Heart of Security
1 2 3
Data Integrity Password Security Blockchain Technology
Hashing ensures data remains Hashing protects sensitive Hashing is at the heart of blockchain
unchanged, safeguarding against information like passwords by storing technology, ensuring the integrity
corruption or manipulation, crucial for their hashes, making it impossible to and immutability of transactions,
reliable data management. recover the original data, enhancing fostering trust and transparency.
system security.