The memory-hard Argon2 password hash and proof-of-work function
This is an older version of an Internet-Draft that was ultimately published as RFC 9106.
Expired & archived
|Authors||Alex Biryukov , Daniel Dinu , Dmitry Khovratovich , Simon Josefsson|
|Last updated||2017-03-27 (Latest revision 2016-09-22)|
|RFC stream||Internet Research Task Force (IRTF)|
|IETF conflict review||conflict-review-irtf-cfrg-argon2, conflict-review-irtf-cfrg-argon2, conflict-review-irtf-cfrg-argon2, conflict-review-irtf-cfrg-argon2, conflict-review-irtf-cfrg-argon2, conflict-review-irtf-cfrg-argon2|
|Additional resources||Mailing list discussion|
|Send notices to||(None)|
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
This document describes the Argon2 memory-hard function for password hashing and proof-of-work applications. We provide an implementer oriented description together with sample code and test vectors. The purpose is to simplify adoption of Argon2 for Internet protocols.
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)