argon2_elixir v2.1.1 Argon2 View Source
Elixir wrapper for the Argon2 password hashing function.
This module implements the Comeonin and Comeonin.PasswordHash behaviours, providing the following functions:
add_hash/2
- takes a password as input and returns a map containing the password hashcheck_pass/3
- takes a user struct and password as input and verifies the passwordno_user_verify/1
- runs the hash function, but always returns falsehash_pwd_salt/2
- hashes the password with a randomly-generated saltverify_pass/2
- verifies a password
For a lower-level API, see Argon2.Base
.
Configuration
See the documentation for Argon2.Stats
for information about configuration.
Options
In addition to the options listed below, the add_hash
, no_user_verify
and hash_pwd_salt
functions all take options that are then passed on
to the hash_password
function in the Argon2.Base
module.
See the documentation for Argon2.Base.hash_password/3
for details.
add_hash
:hash_key
- the key used in the map for the password hash- the default is
password_hash
- the default is
:salt_len
- the length of the random salt- the default is 16 (the minimum is 8) bytes
check_pass
:hash_key
- the key used in the user struct for the password hash- if this is not set,
check_pass
will look forpassword_hash
, and thenencrypted_password
- if this is not set,
:hide_user
- runno_user_verify
to prevent user enumeration- the default is true
- set this to false if you do not want to hide usernames
hash_pwd_salt
:salt_len
- the length of the random salt- the default is 16 (the minimum is 8) bytes
Examples
The following examples show how to hash a password with a randomly-generated salt and then verify a password:
iex> hash = Argon2.hash_pwd_salt("password")
...> Argon2.verify_pass("password", hash)
true
iex> hash = Argon2.hash_pwd_salt("password")
...> Argon2.verify_pass("incorrect", hash)
false
add_hash
The put_pass_hash
function below is an example of how you can use
add_hash
to add the password hash to the Ecto changeset.
defp put_pass_hash(%Ecto.Changeset{valid?: true, changes:
%{password: password}} = changeset) do
change(changeset, Argon2.add_hash(password))
end
defp put_pass_hash(changeset), do: changeset
This function will return a changeset with %{password_hash: password_hash, password: nil}
added to the changes
map.
check_pass
The following is an example of calling this function with no options:
def verify_user(%{"password" => password} = params) do
params
|> Accounts.get_by()
|> Argon2.check_pass(password)
end
The Accounts.get_by
function in this example takes the user parameters
(for example, email and password) as input and returns a user struct or nil.
Argon2
Argon2 is the winner of the Password Hashing Competition (PHC).
Argon2 is a memory-hard password hashing function which can be used to hash passwords for credential storage, key derivation, or other applications.
Argon2 has the following three variants (Argon2id is the default):
- Argon2d - suitable for applications with no threats from side-channel timing attacks (eg. cryptocurrencies)
- Argon2i - suitable for password hashing and password-based key derivation
- Argon2id - a hybrid of Argon2d and Argon2i
Argon2i, Argon2d, and Argon2id are parametrized by:
- A time cost, which defines the amount of computation realized and therefore the execution time, given in number of iterations
- A memory cost, which defines the memory usage, given in kibibytes
- A parallelism degree, which defines the number of parallel threads
More information can be found in the documentation for the Argon2.Stats
module and at the Argon2 reference C implementation
repository.
Comparison with Bcrypt / Pbkdf2
Currently, the most popular password hashing functions are Bcrypt, which was presented in 1999, and Pbkdf2 (pbkdf2_sha256 or pbkdf2_sha512), which dates back to 2000. Both are strong password hashing functions with no known vulnerabilities, and their algorithms have been used and widely reviewed for over 10 years. To help you decide whether you should use Argon2 instead, here is a brief comparison of Bcrypt / Pbkdf2 with Argon2.
Argon2 is a lot newer, and this can be considered to be both an advantage and a disadvantage. On the one hand, Argon2 benefits from more recent research, and it is designed to combat the kinds of attacks which have become more common over the past decade, such as the use of GPUs or dedicated hardware. On the other hand, Argon2 has not received the same amount of scrutiny that Bcrypt / Pbkdf2 has.
One of the main differences is that Argon2 is a memory-hard function, and this means that it is designed to use a lot more memory than Bcrypt / Pbkdf2. With Bcrypt / Pbkdf2, attackers can use GPUs to hash several hundred / thousand passwords in parallel. This can result in significant gains in the time it takes an attacker to crack passwords. Argon2's memory cost means that it is a lot more difficult for attackers to benefit from using GPUs or other dedicated hardware.
Link to this section Summary
Functions
Generate a random salt.
Link to this section Functions
gen_salt(salt_len \\ 16) View Source
Generate a random salt.
The default length for the salt is 16 bytes. We do not recommend using a salt shorter than the default.