bcrypt.” is not the best recommendation (anymore).
Preamble: if you’re hashing your passwords with
PBKDF2 today, there’s nothing to worry about in the immediate future. This article is for you if you’re choosing a password hash today and want a future-proof solution. Not a call for action like my TLS articles.
bcrypt is a password hash. The difference to cryptographic hashes like SHA-1 is that it adds a computational cost to password hashing. In other words: it’s intentionally slow. The reasoning is that if someone steals the hashes of the passwords of your customers, it’s going to be much more expensive to compute the passwords (which are probably also the passwords to their e-mail accounts) to those hashes.
Fast-forward to 2016.
The attackers caught up big time. Making a password hash computationally expensive is not enough anymore because people started utilizing GPUs and building highly parallel hardware specifically for cracking as many passwords in parallel as possible: ASICs1.
Thus the next step in this arms race was to introduce an additional memory cost to hashing passwords. That makes the highly parallelized cracking of passwords infeasible by significantly raising the costs.
Currently, the most popular memory hard implementation is
scrypt by the former FreeBSD Security Officer Dr. Colin Percival. Sadly,
scrypt never got the attention it deserved; mostly due to the popularity of
bcrypt and the NIST approval of PBKDF2 (that unfortunately also is not memory hard).
Password hashing is everywhere, from web services’ credentials storage to mobile and desktop authentication or disk encryption systems. Yet there wasn’t an established standard to fulfill the needs of modern applications and to best protect against attackers. We started the Password Hashing Competition (PHC) to solve this problem.
In 2015, they announced the winner: Argon2.
Argon2 is a secure, memory hard password hash. It comes in two variants but for password hashing only the side-channel hardened Argon2i is relevant. On 2015-11-05, an IETF draft has been submitted in order to make it an official Internet standard ASAP.
The Argon2 authors released a reference implementation in portable C with an optimized version for SSE2-enabled CPUs under the permissive CC0 license (~ Public Domain). This implementation isn’t packaged for any operating system (yet) but due to its license it’s already possible to build bindings against it by vendorizing it.
If you use Python you’re in luck: I’ve released CFFI bindings for the official Argon2 implementation:
argon2_cffi with wheel files for Python 2.6, 2.7, 3.3, 3.4, 3.5, and PyPy on both OS X and Windows. So you don’t even need a compiler on those two platforms – just a recent enough
After installing it from PyPI, all you need to do is:
>>> from argon2 import PasswordHasher >>> ph = PasswordHasher() >>> hash = ph.hash("s3kr3tp4ssw0rd") >>> hash u'$argon2i$m=512,t=2,p=2$0FFfEeL6JmUnpxwgwcSC8g$98BmZUa5A/3t5wb3ZxFLBg' >>> ph.verify(hash, "s3kr3tp4ssw0rd") True >>> ph.verify(hash, "t0t411ywr0ng") Traceback (most recent call last): ... argon2.exceptions.VerificationError: Decoding failed
As you can see,
hash() returns a self-contained hash with all parameters (including a random salt that can be fed into
verify()3. All parameters can be set using keyword arguments when instantiating
If you want to build your own high-level abstractions, the argon2.low_level module is for you. It offers direct bindings to all relevant APIs:
>>> import argon2 >>> argon2.low_level.hash_secret( ... b"secret", b"somesalt", ... time_cost=1, memory_cost=8, parallelism=1, hash_len=64, ... type=argon2.Type.D ... ) b'$argon2d$m=8,t=1,p=1$c29tZXNhbHQ$H0oN1/L3H8t8hcg47pAyJZ8toBh2UbgcMt0zRFrqt4mEJCeKSEWGxt+KpZrMwxvr7M5qktNcc/bk/hvbinueJA'
Finally it also comes with a CLI interface that allows you to benchmark its defaults and play with the parameters:
$ python -m argon2 Running Argon2i 100 times with: hash_len: 16 memory_cost: 512 parallelism: 2 time_cost: 2 Measuring... 0.618ms per password verification $ python -m argon2 -t 4 -m 1024 -p 5 Running Argon2i 100 times with: hash_len: 16 memory_cost: 1024 parallelism: 5 time_cost: 4 Measuring... 1.7ms per password verification
Please have a look at the relevant documentation on how to determine the optimal parameters for your use case.
Brief googling shows there are bindings for most other platforms too. Official Django integration is available since the 1.10 release.
If your programming language or framework of choice is lacking an implementation, I encourage you to help out. I have experienced the Argon2 authors as most helpful while fighting the ancient Visual Studio 2008 so I can offer Python 2.7 wheel files for Windows4. Of course I’ll happily help you out with Python-related woes.
I’d like to close with another quote from the PHC website:
We recommend that use you use Argon2 rather than legacy algorithms.
Also popular for mining Bitcoin. ↩︎
In case you wonder why
verify()raises an exception instead of just returning
False: the Argon2 library has no concept of a “wrong password” error. Therefore an exception with the full error is raised so you can inspect what went wrong if needed. Also IMHO a wrong password should raise an exception such that it can’t pass unnoticed by accident. ↩︎
It took me five betas and the help of five people. ↩︎