What Is a Hash? A Simple Guide to Hashing

What is a hash?

A hash function takes input data and produces a fixed-length output often called a hash or digest. The input could be a word, a file or a much larger block of data.

With the same hashing algorithm, the same input should produce the same output. Even a tiny change to the input normally produces a very different-looking hash.

Want to try the idea yourself? Use the Hash Generator.

What are hashes used for?

Hashes can help check whether data has changed. If a downloaded file has the expected cryptographic hash, that provides evidence that its contents match the file used to generate the published value.

Hashing is also used in many security systems, data structures and identification workflows.

Hashing is not encryption

Encryption is designed so authorised users can decrypt data and recover the original information. A cryptographic hash is designed as a one-way transformation rather than a reversible encoding.

That distinction is important: generating a hash of text is not the same as hiding the text with encryption.

Different hash algorithms

Algorithms such as SHA-256 produce cryptographic hashes with different properties and output lengths. Older algorithms may still appear in legacy systems but may not be suitable for modern security-sensitive uses.

Choose an algorithm based on the actual requirement rather than simply choosing the shortest output.

Generate a hash

The Hash Generator lets you enter data and see its hash using supported algorithms. It is useful for learning, comparisons and straightforward checksum tasks.

For password storage or security design, use established password-hashing and security practices rather than treating a basic hash generator as a complete authentication system.