RFC 9106: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications
In plain English — editorial summary, not part of the RFC
This document describes the Argon2 memory-hard function for password hashing and proof-of-work applications. We provide an implementer-oriented description with test vectors. The purpose is to simplify adoption of Argon2 for Internet protocols. This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF.
Document record
- Document ID
- RFC9106
- Published
- September 2021
- Authors
- A. Biryukov; D. Dinu; D. Khovratovich; S. Josefsson
- Status
- INFORMATIONAL
- Stream
- IRTF
- Area
- —
- Pages
- 21
- Also known as
- —
Topics
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 8937Randomness Improvements for Security ProtocolsCurrent
October 2020
- RFC 9414Unfortunate History of Transient Numeric IdentifiersCurrent
July 2023
- RFC 9415On the Generation of Transient Numeric IdentifiersCurrent
July 2023
- RFC 8576Internet of Things (IoT) Security: State of the Art and ChallengesCurrent
April 2019
- RFC 6538The Host Identity Protocol (HIP) Experiment ReportCurrent
March 2012
- RFC 6179The Internet Routing Overlay Network (IRON)Current
March 2011
- RFC 9109Network Time Protocol Version 4: Port RandomizationCurrent
August 2021
- RFC 9099Operational Security Considerations for IPv6 NetworksCurrent
August 2021
Also filed under
About this page
The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.
Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.
Data sources · Editorial policy · Report a correction · What is an RFC?