Data hash
A data hash produces a fingerprint of arbitrary data. A small change results in a completely different hash.
Generate and verify data and password hashes locally. Hex, Base64, copying and analysis together in the result area.
Password hash / KDF
Ordinary hash functions are deliberately fast. For file and data hashes, that is desirable.
In password attacks, high speed is a disadvantage. Password KDFs deliberately increase the computational and memory cost.
A salt prevents identical passwords from producing identical stored hashes. The salt does not need to be secret.
Algorithms at a glance
- MD5: fast 128-bit hash function, cryptographically broken – only for non-security-critical checksums.
- SHA-1: 160-bit hash with known collision attacks, cryptographically outdated.
- SHA-2 (SHA-224/256/384/512): established standard for integrity and signatures.
- SHA-3 (Keccak-based, FIPS 202): modern sponge construction complementing SHA-2.
- Keccak-256: the original Keccak variant, not identical to SHA3-256, used in Ethereum among others.
- BLAKE2 (2b/2s): very fast, modern hash function.
- BLAKE3: very fast, parallelizable hash function.
- bcrypt: still widely used password hashing with a Cost factor and high compatibility; note the 72-UTF-8-byte limit. For new systems, Argon2id is preferred.
- Argon2id: the preferred modern choice for new password storage; memory- and compute-intensive.
- scrypt: memory-intensive password hashing with the parameters N, r and p.
- PBKDF2: established standard, especially relevant for existing platform or compliance requirements.
No algorithm is universally “always secure”. Parameters, implementation and usage context are decisive.