CipherTools
ToolsBlogsSnippets
ToolsBlogsSnippets
  • MD5 Text Hash
  • MD5 File Hash
  • BKDR Text Hash
  • BKDR File Hash
  • SHA-256 Text Hash
  • SHA-256 File Hash
  • SHA-512 Text Hash
  • SHA-512 File Hash
  • SHA-3 Text Hash
  • SHA-3 File Hash
  • SHAKE Text Hash
  • SHAKE File Hash
  • Argon2 Text Hash
  • Argon2 File Hash
  • CRC Text Checksum
  • CRC File Checksum
  • HMAC Text Generator
  • HMAC File Generator
  • BLAKE2 Text Hash
  • BLAKE2 File Hash
  • BLAKE3 Text Hash
  • BLAKE3 File Hash
  • CityHash Text Hash
  • CityHash File Hash
  • FarmHash Text Hash
  • FarmHash File Hash
  • xxHash Text Hash
  • xxHash File Hash
  • MurmurHash2 Text Hash
  • MurmurHash2 File Hash
  • MurmurHash3 Text Hash
  • MurmurHash3 File Hash
  • bcrypt Text Hash
  • bcrypt File Hash
  • scrypt Text Derivation
  • scrypt File Derivation
  • AES Encryption and Decryption
  • AES File Encryption
  • AES File Decryption
  • AES-GCM Encryption and Decryption
  • ChaCha20-Poly1305 Text
  • ChaCha20-Poly1305 File Encryption
  • ChaCha20-Poly1305 File Decryption
  • DES Encryption and Decryption
  • DES File Encryption
  • DES File Decryption
  • RSA Encryption and Decryption
  • RSA File Encryption
  • RSA File Decryption

Password hashing · Client-side

bcrypt Text Hash Generator

Produce bcrypt password hashes with full control over the cost factor and salt handling. Run everything in the browser to keep sensitive values local. Need file support? Switch to the bcrypt file tool →

Text bcrypt hash

Generate bcrypt password hashes with configurable cost factors. Salts are generated automatically, and bcrypt only processes the first 72 bytes of the input.

Current length: 0 characters

Higher costs slow down hashing but improve resistance to brute force attacks. Typical values range from 10 to 14.

Enter a password and click Generate to produce a bcrypt hash.

Enter a target hash to validate.

bcrypt overview

bcrypt is deliberately slow to hamper brute-force attacks. The cost factor controls how many rounds are run (specifically 2cost iterations). Bumping the cost by 1 roughly doubles the runtime, so scale it to match the responsiveness you need on your deployment hardware.

Salts are fixed-size 16-byte values that must be random and unique per hash to defend against rainbow tables. The generated bcrypt hash already bundles both the salt and cost factor, so storing the hash alone is sufficient for later verification.

Why do we need random salts?

Random salts ensure that two users choosing the same password never share a hash. They defeat rainbow tables, undermine precomputed attack dictionaries, and stop attackers from spotting password reuse across accounts. Because the salt is embedded in the hash output, every run automatically produces a unique fingerprint even if the underlying password and log rounds stay unchanged.

How many rounds should I use?

12 rounds is a common production baseline. Raising the cost increases security but also processing time, so pick a value that balances user experience with your threat model—higher is better if your environment can tolerate the latency.

Is this tool secure?

All hashing happens locally in your browser using the bcryptjs library. No input data or generated hashes are transmitted or stored on any server.

Can I use this in production?

Treat this interface as a learning and testing aid. For production environments, integrate bcrypt directly into your application with a vetted server-side library so you can manage secrets, rate limiting, and audit trails properly.

© 2026 CipherTools. All computations run locally in your browser.