AES Encryption Explained: How It Works and Why It Matters
Jun 23, 2026
Generate PBKDF2 password hashes with configurable iterations, key length, and hash algorithm.
PBKDF2 (Password-Based Key Derivation Function 2) is a key derivation function that applies a pseudorandom function (like HMAC-SHA256) many times to derive a cryptographic key from a password. It is widely used for password hashing and is recommended by NIST (National Institute of Standards and Technology).
The security of PBKDF2 comes from the iteration count — each iteration adds computational cost, making brute-force attacks slower. This tool uses the Web Crypto API's built-in PBKDF2 implementation, which is hardware-accelerated in modern browsers. The recommended minimum of 600,000 iterations follows OWASP 2023 guidelines.
As of 2024, OWASP recommends at least 600,000 iterations for PBKDF2-HMAC-SHA256. For SHA-512, you can use slightly fewer iterations (around 400,000) as SHA-512 is slower per iteration. Higher iterations increase security but also increase computation time.
PBKDF2 is NIST-approved and widely available in many platforms and libraries. Bcrypt is memory-hard (resistant to GPU attacks) and includes salt by design. Argon2 is the most modern — it's both CPU-hard and memory-hard. PBKDF2 is pure CPU-hard, making it more vulnerable to GPU and ASIC-based attacks than bcrypt or Argon2 at similar iteration counts.
The tool outputs a PBKDF2 hash in the format pbkdf2:{algorithm}:{iterations}:{salt_base64}:{key_base64}. This format includes all parameters needed for verification — algorithm, iterations, salt, and derived key. To verify, parse the format and recompute PBKDF2 with the same parameters.
No. Semua proses terjadi di browser Anda menggunakan Web Crypto API. Data tidak pernah dikirim ke server.
Blog
Jun 23, 2026
Jun 23, 2026
Jun 23, 2026
Jun 23, 2026
Jun 23, 2026
Jun 23, 2026