The memory-hard Argon2 password hash and proof-of-work function
draft-irtf-cfrg-argon2-02

Document Type Active Internet-Draft (cfrg RG)
Last updated 2017-06-21 (latest revision 2017-03-27)
Replaces draft-josefsson-argon2
Stream IRTF
Intended RFC status Informational
Formats plain text xml pdf html bibtex
Stream IRTF state (None)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Network Working Group                                        A. Biryukov
Internet-Draft                                                   D. Dinu
Intended status: Informational                           D. Khovratovich
Expires: September 26, 2017                     University of Luxembourg
                                                            S. Josefsson
                                                                  SJD AB
                                                          March 25, 2017

    The memory-hard Argon2 password hash and proof-of-work function
                       draft-irtf-cfrg-argon2-02

Abstract

   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.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on September 26, 2017.

Copyright Notice

   Copyright (c) 2017 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of

Biryukov, et al.       Expires September 26, 2017               [Page 1]
Internet-Draft                   Argon2                       March 2017

   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Notation and Conventions  . . . . . . . . . . . . . . . . . .   3
   3.  Argon2 Algorithm  . . . . . . . . . . . . . . . . . . . . . .   3
     3.1.  Argon2 Inputs and Outputs . . . . . . . . . . . . . . . .   4
     3.2.  Argon2 Operation  . . . . . . . . . . . . . . . . . . . .   4
     3.3.  Variable-length hash function H'  . . . . . . . . . . . .   6
     3.4.  Indexing  . . . . . . . . . . . . . . . . . . . . . . . .   6
       3.4.1.  Getting the 32-bit values J_1 and J_2 . . . . . . . .   7
       3.4.2.  Mapping J_1 and J_2 to reference block index  . . . .   7
     3.5.  Compression function G  . . . . . . . . . . . . . . . . .   8
     3.6.  Permutation P . . . . . . . . . . . . . . . . . . . . . .   9
   4.  Parameter Choice  . . . . . . . . . . . . . . . . . . . . . .  10
   5.  Example Code  . . . . . . . . . . . . . . . . . . . . . . . .  11
   6.  Test Vectors  . . . . . . . . . . . . . . . . . . . . . . . .  20
     6.1.  Argon2d Test Vectors  . . . . . . . . . . . . . . . . . .  20
     6.2.  Argon2i Test Vectors  . . . . . . . . . . . . . . . . . .  21
     6.3.  Argon2id Test Vectors . . . . . . . . . . . . . . . . . .  22
   7.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .  24
   8.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  24
   9.  Security Considerations . . . . . . . . . . . . . . . . . . .  24
     9.1.  Security as hash function and KDF . . . . . . . . . . . .  24
     9.2.  Security against time-space tradeoff attacks  . . . . . .  24
     9.3.  Security for time-bounded defenders . . . . . . . . . . .  25
     9.4.  Recommendations . . . . . . . . . . . . . . . . . . . . .  25
   10. References  . . . . . . . . . . . . . . . . . . . . . . . . .  25
     10.1.  Normative References . . . . . . . . . . . . . . . . . .  25
     10.2.  Informative References . . . . . . . . . . . . . . . . .  25
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  26

1.  Introduction

   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.
Show full document text