This program implements the following procedure, as recommended by the argon2 authors:
- 1. Select the type
y. If you do not know the difference between them, choose Argon2id.
- 2. Figure out the maximum number of threads
hthat can be initiated by each call to Argon2. This is the
- 3. Figure out the maximum amount of memory
mthat each call can a afford.
- 4. Figure out the maximum amount
xof time (in seconds) that each call can a afford.
- 5. Select the salt length. 16 bytes is suffient for all applications, but can be reduced to 8 bytes in the case of space constraints.
- 6. Select the tag (output) size. 16 bytes is suffient for most applications, including key derivation.
- 7. Run the scheme of type
hlanes and threads, using different number of passes
t. Figure out the maximum
tsuch that the running time does not exceed
x. If it exceeds
t = 1, reduce
maccordingly. If using Argon2i, t must be at least 3.
- 8. Hash all the passwords with the just determined values
Leon Timmermans <email@example.com>
Daniel Dinu, Dmitry Khovratovich, Jean-Philippe Aumasson, Samuel Neves, Thomas Pornin and Leon Timmermans has dedicated the work to the Commons by waiving all of his or her rights to the work worldwide under copyright law and all related or neighboring legal rights he or she had in the work, to the extent allowable by law.
Works under CC0 do not require attribution. When citing the work, you should not imply endorsement by the author.