Scribd
Upload
12 views1 page

Hashing

Uploaded by

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

Hashing

Uploaded by

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

Hashing is a process used in computer science and cryptography to map data of any

size (often called a "message") to a fixed size, typically a smaller, unique value
known as a "hash value" or "hash code." This transformation is done using a hash
function, which takes an input (or "key") and produces a unique output (the hash
value).

The main properties of hashing include:

Deterministic: The same input always produces the same output.


Fixed Size: The output, or hash value, has a fixed size regardless of the input
size.
Efficient: Hash functions are designed to be computationally efficient, even for
large inputs.
Collision-Resistant: Ideally, different inputs should produce different hash
values, although in practice, collisions (where different inputs produce the same
hash) can occur. Cryptographic hash functions aim to minimize these collisions.
Irreversible: Given a hash value, it should be difficult (or practically
impossible) to reverse-engineer the original input.
Hashing is widely used in data structures like hash tables (for efficient lookups),
data integrity checks (like checksums), and cryptographic applications (such as
storing passwords securely or generating digital signatures). It is particularly
important for ensuring data integrity and fast lookups in databases or distributed
systems.

You might also like