Should I use SHA-256 or SHA-512?

For most applications, SHA-256 is sufficient — 256 bits of security is beyond the computational capacity of any classical computer. SHA-512 produces a 512-bit hash and is designed for 64-bit CPUs (it operates on 64-bit words vs 32-bit for SHA-256). On 64-bit hardware, SHA-512 is often faster than SHA-256 for large inputs because it processes twice as much data per round. Choose SHA-256 for compatibility; choose SHA-512 when you need the extra security margin for compliance (e.g., certain government or financial systems mandate SHA-512) and run on 64-bit infrastructure.

What is a rainbow table attack?

A rainbow table is a precomputed database of hash-to-plaintext mappings for millions of common passwords. If your database stores unsalted SHA-256 hashes, an attacker can look up every hash in a rainbow table and instantly recover the original passwords for all commonly used passwords in your system. Defenses: (1) add a random salt — a unique random string per user — so the same password produces different hashes for different users (rainbow tables become useless because they would need to be recomputed for every possible salt); (2) use a slow, memory-hard password hashing algorithm (bcrypt, scrypt, Argon2id) instead of general-purpose hash functions.

What is HMAC and when do I use it?

HMAC (Hash-based Message Authentication Code) is a construction that turns a hash function and a secret key into a message authentication code. It answers: "Did this message come from someone who knows the secret key, and has it been modified in transit?" HMAC is used in JWT tokens (HMAC-SHA256 signing), AWS Signature v4 API authentication, OAuth 1.0, and TLS. Use HMAC when both the sender and receiver share a secret key and you need to validate the integrity and authenticity of each message.

Can hash functions be reversed?

No. Cryptographic hash functions are designed to be one-way — it is computationally infeasible to recover the original input from its hash. However, for small input spaces (e.g., short passwords), an attacker can hash every possible input (a brute-force attack) and compare against the target hash. This is not "reversing" the hash; it is a brute-force preimage search made practical by the limited input space. Strong password hashing algorithms (bcrypt, Argon2id) make brute-force attacks impractical by being intentionally slow.

What is the avalanche effect?

The avalanche effect means that changing even one bit of the input changes approximately 50% of the output bits. For example, SHA-256("hello") and SHA-256("Hello") produce completely different hashes — not just a single character difference. This property ensures that similar inputs do not produce similar hashes, preventing attackers from making inferences about the input from partial hash matches. All modern hash functions (SHA-256, SHA-3, BLAKE3) exhibit a strong avalanche effect.

Developer Tools2026-05-10

Online Hash Generator: MD5, SHA-1, SHA-256, SHA-512, BLAKE2, and More

A cryptographic hash function takes any input — a password, a file, or an entire hard drive image — and produces a fixed-size output called a hash or digest. The defining properties are: (1) deterministic — the same input always produces the same hash; (2) one-way — you cannot reverse a hash to recover the original input; (3) avalanche effect — changing one bit of the input changes approximately 50% of the hash bits; (4) collision-resistant — it must be computationally infeasible to find two different inputs that produce the same hash. Different algorithms offer different trade-offs between speed, security, and output size. MD5 (128-bit output) takes microseconds to compute but is cryptographically broken — collisions can be generated in seconds on a laptop. SHA-256 (256-bit) remains secure for all practical purposes and is used in TLS certificates, Bitcoin mining, and Git commit identifiers. Our hash generator computes hashes for text input and file uploads using seven algorithms — MD5, SHA-1, SHA-256, SHA-384, SHA-512, SHA-3-256, BLAKE2b, and BLAKE3 — entirely in your browser. The tool also provides HMAC (Hash-based Message Authentication Code) mode that combines a secret key with the hash function to produce an authenticated digest, and a file-integrity checker that verifies whether a downloaded file matches its published checksum.

tag

Hash Generator

Free · No registration

Try this tool for free →open_in_new

Step-by-Step Guide

Choose Your Input Type and Algorithm

Select Text mode (type or paste any string) or File mode (upload a file up to 100 MB — processed locally, not uploaded to any server). Choose your hash algorithm from the dropdown: MD5 (128-bit, fast, broken — only use for non-security checksums), SHA-1 (160-bit, deprecated), SHA-256 (256-bit, secure, NIST standard), SHA-512 (512-bit, more secure but slower), SHA-3-256 (newest NIST standard, sponge construction), BLAKE2b (faster than MD5, more secure than SHA-256), or BLAKE3 (fastest, parallel, 2020 release).

Generate and Compare Hashes

Click "Generate" to compute the hash. The output is displayed in hexadecimal (lowercase, the standard representation) and optionally as Base64. For file validation, paste the expected checksum (e.g., from the download page) into the "Expected Hash" field — the tool highlights a green match or red mismatch. The HMAC toggle lets you enter a secret key for keyed-hash authentication.

Copy or Download Hash Results

Click the copy icon to copy the hash to your clipboard. For batch verification, upload multiple files and the tool generates a manifest file (hashes.json) listing each file name and its hash, compatible with common verification tools. Download checksum files in sha256sum or md5sum format for use with command-line verification.

Tips & Best Practices

check_circle

MD5 (128-bit, RFC 1321) is broken for security but still useful for non-security checksums. Two different files can be engineered to produce the same MD5 hash in under 1 second on modern hardware (a chosen-prefix collision attack). Use MD5 only for detecting accidental corruption during file transfers, never for verifying integrity against an adversary.

check_circle

SHA-1 (160-bit) was deprecated by NIST in 2011 and fully retired from TLS certificates in 2017. The SHAttered attack (2017, Google/CWI) generated two different PDF files with the same SHA-1 hash using 9,223,372,036,854,775,808 SHA-1 computations — equivalent to 110 GPU-years at the time but now achievable in weeks on modern hardware. Migrate any remaining SHA-1 usage to SHA-256.

check_circle

SHA-256 is the current workhorse of cryptographic hashing. It produces a 256-bit (32-byte, 64-hex-character) digest. Bitcoin uses double SHA-256 for its proof-of-work. Git identifies every commit, tree, and blob with a SHA-1 hash (migration to SHA-256 is ongoing as of 2025). TLS certificates and code signing use SHA-256 as the minimum acceptable hash.

check_circle

BLAKE3, released in 2020 by the same team that created BLAKE2 and the SHA-3 finalist BLAKE, is 5x faster than SHA-256 on x86-64 CPUs (thanks to SIMD parallelization), 10x faster than SHA-3, and designed for parallelism across any number of cores. It is an excellent choice for content-addressable storage and file deduplication systems. BLAKE3 has no known practical attacks as of 2026.

check_circle

Never store raw password hashes. If an attacker gets your database, they will run a rainbow table attack — a precomputed table mapping hash values to their original passwords. Instead, hash passwords with a purpose-built algorithm: bcrypt (1999, adjustable cost factor), scrypt (2009, memory-hard, designed to resist ASIC attacks), or Argon2id (2015, winner of the Password Hashing Competition, recommended by OWASP as of 2024). These algorithms are intentionally slow (configurable to 100-500ms per hash), making brute-force attacks infeasible. Our generator supports HMAC mode for keyed authentication, but for password storage, use a dedicated password-hashing library.

check_circle

HMAC (Hash-based Message Authentication Code, RFC 2104) combines a secret key with a hash function: HMAC-SHA-256(key, message) = SHA-256((key XOR outer_pad) + SHA-256((key XOR inner_pad) + message)). It provides both integrity (the message has not been tampered with) and authenticity (only someone with the secret key could have generated that specific HMAC). HMAC is used in JWT signing, API request authentication, and TLS record integrity.

check_circle

When verifying a downloaded file against a published checksum, always get the checksum from a separate source than the download. If both the file and the checksum are on the same compromised page, an attacker can replace both. Many open-source projects publish checksums on their official website while hosting downloads on mirrors or CDNs.

check_circle

For large file hashing (1 GB+), use BLAKE3 or SHA-256 with chunked reading. Our file upload mode processes files incrementally to handle files up to 100 MB in the browser. Command-line alternatives for larger files: `sha256sum largefile.iso` (Linux), `shasum -a 256 largefile.iso` (macOS), or `Get-FileHash largefile.iso -Algorithm SHA256` (PowerShell).

Frequently Asked Questions

The three key differences are output size, security level, and speed. MD5 produces a 128-bit hash and is the fastest but cryptographically broken — collisions can be generated in under a second. SHA-1 produces a 160-bit hash, is moderately fast, but is deprecated because collision attacks are now practical (the SHAttered attack in 2017 cost approximately $110,000 in cloud compute). SHA-256 produces a 256-bit hash, is slower than MD5 and SHA-1, but remains secure — no known practical collision attack exists against SHA-256 as of 2026.

Hash functions are the invisible backbone of digital security — protecting passwords, verifying file integrity, and authenticating messages billions of times per day. Whether you need a quick MD5 checksum for a file download or SHA-256 for a security audit, our free hash generator computes it instantly in your browser — no file leaves your machine. Generate your hash now.

Try this tool for free →open_in_new