[CFRG] [Errata Verified] RFC9106 (7721)

RFC Errata System <rfc-editor@rfc-editor.org> Thu, 07 December 2023 18:46 UTC

To: david.finnie@infrasoft.com.au, alex.biryukov@uni.lu, daniel.dinu@intel.com, khovratovich@gmail.com, simon@josefsson.org
From: RFC Errata System <rfc-editor@rfc-editor.org>
Cc: rfc-ed@rfc-editor.org, irsg@irtf.org, cfrg@irtf.org, iana@iana.org, rfc-editor@rfc-editor.org
Content-Type: text/plain; charset="UTF-8"
Message-Id: <20231207184642.63896E43BC@rfcpa.amsl.com>
Date: Thu, 07 Dec 2023 10:46:42 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/cfrg/2E1P_bR0ztZFO5_dbVl3R-aFjVw>
Subject: [CFRG] [Errata Verified] RFC9106 (7721)
Precedence: list

The following errata report has been verified for RFC9106,
"Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications". 

--------------------------------------
You may review the report below and at:
https://www.rfc-editor.org/errata/eid7721

--------------------------------------
Status: Verified
Type: Editorial

Reported by: David Finnie <david.finnie@infrasoft.com.au>
Date Reported: 2023-12-07
Verified by: RFC Editor  

Section: 3.2

Original Text
-------------
   6.  If the number of passes t is larger than 1, we repeat step 5.  We
       compute B[i][0] and B[i][j] for all i raging from (and including)
       0 to (not including) p and for all j ranging from (and including)
       1 to (not including) q.  However, blocks are computed differently
       as the old value is XORed with the new one:

       B[i][0] = G(B[i][q-1], B[l][z]) XOR B[i][0];
       B[i][j] = G(B[i][j-1], B[l][z]) XOR B[i][j].


Corrected Text
--------------
   6.  If the number of passes t is larger than 1, we repeat step 5.  We
       compute B[i][0] and B[i][j] for all i ranging from (and
       including) 0 to (not including) p and for all j ranging from (and
       including) 1 to (not including) q.  However, blocks are computed
       differently as the old value is XORed with the new one:

       B[i][0] = G(B[i][q-1], B[l][z]) XOR B[i][0];
       B[i][j] = G(B[i][j-1], B[l][z]) XOR B[i][j].


Notes
-----
Firstly: nice, clear RFC. Well done.

I know it's really minor, and we all like to have "fun with flags", but..."ranging" rather than "raging" :-)

--------------------------------------
RFC9106 (draft-irtf-cfrg-argon2-13)
--------------------------------------
Title               : Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications
Publication Date    : September 2021
Author(s)           : A. Biryukov, D. Dinu, D. Khovratovich, S. Josefsson
Category            : INFORMATIONAL
Source              : Crypto Forum Research Group
Area                : N/A
Stream              : IRTF

[CFRG] [Errata Verified] RFC9106 (7721) RFC Errata System