RFC Errata


Errata Search

 
Source of RFC  
Summary Table Full Records

Found 3 records.

Status: Reported (2)

RFC 6234, "US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF)", May 2011

Source of RFC: IETF - NON WORKING GROUP
Area Assignment: sec

Errata ID: 5179
Status: Reported
Type: Editorial

Reported By: Russ Housley
Date Reported: 2017-11-06

Section 8.5 says:

 *    This file will exercise the HKDF code performing
 *      the seven tests documented in RFC 4869.

It should say:

 *    This file will exercise the HKDF code performing
 *      the seven tests documented in RFC 5869.

Notes:

Typo. Provide the correct reference in the code comment.

Errata ID: 5240
Status: Reported
Type: Editorial

Reported By: Yeong-u Kim (K.)
Date Reported: 2018-01-21

Section 6 says:

6.1.  SHA-224 and SHA-256 Initialization

   For SHA-224, the initial hash value, H(0), consists of the following
   32-bit words in hex:

      H(0)0 = c1059ed8
      H(0)1 = 367cd507
      H(0)2 = 3070dd17
      H(0)3 = f70e5939
      H(0)4 = ffc00b31
      H(0)5 = 68581511
      H(0)6 = 64f98fa7
      H(0)7 = befa4fa4

It should say:

6.1.  SHA-224 and SHA-256 Initialization

   For SHA-224, the initial hash value, H(0), consists of the following
   32-bit words in hex.  These words were obtained by taking the second
   32 bits of the fractional parts of the square roots of the ninth
   through sixteenth prime numbers.

      H(0)0 = c1059ed8
      H(0)1 = 367cd507
      H(0)2 = 3070dd17
      H(0)3 = f70e5939
      H(0)4 = ffc00b31
      H(0)5 = 68581511
      H(0)6 = 64f98fa7
      H(0)7 = befa4fa4

Notes:

The explanation for the way in which the initial hash value of SHA-224 was obtained is missing.

Status: Held for Document Update (1)

RFC 6234, "US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF)", May 2011

Source of RFC: IETF - NON WORKING GROUP
Area Assignment: sec

Errata ID: 5238
Status: Held for Document Update
Type: Editorial

Reported By: Yeong-u Kim (K.)
Date Reported: 2018-01-19
Held for Document Update by: Warren Kumari (Ops AD)
Date Held: 2018-01-22

Section 3 says:

   e. The rotate left (circular left shift) operation ROTL^n(x), where x
      is a w-bit word and n is an integer with 0 <= n < w, is defined by

         ROTL^n(X) = (x<<n) OR (x>>(w-n))

It should say:

   e. The rotate left (circular left shift) operation ROTL^n(x), where x
      is a w-bit word and n is an integer with 0 <= n < w, is defined by

         ROTL^n(x) = (x<<n) OR (x>>(w-n))

Notes:

A typo. The function argument has to be x, not X.

Report New Errata