Seonglae ChoBcrypt: Purpose-Built for Password Security
Bcrypt was specifically designed from the ground up as a slow hashing algorithm for password storage. The intentional computational overhead—taking approximately 300ms to compute a hash on the server—makes it resistant to brute-force attacks.
Key Features:
- Recommended Configuration: 10 rounds of complexity with salt application
- Historical Strength: Developed by Niels Provos and David Mazières in 1999, it remains one of the most robust hashing mechanisms in use today
- Industry Adoption: Serves as the default password authentication mechanism in OpenBSD
- Adjustable Security: The work factor parameter determines the computational intensity required to generate a single hash digest, allowing administrators to easily enhance system security by simply adjusting this value
- Technical Constraint: Limited to 72-byte character input values
bcryptjs
Optimized bcrypt in JavaScript with zero dependencies. Compatible to the C++ bcrypt binding on node.js and also working in the browser. Besides incorporating a salt to protect against rainbow table attacks, bcrypt is an adaptive function: over time, the iteration count can be increased to make it slower, so it remains resistant to brute-force search attacks even with increasing computation power.
https://www.npmjs.com/package/bcryptjs
