CARVIEW |
Select Language
HTTP/2 200
date: Fri, 10 Oct 2025 11:36:51 GMT
content-type: text/html; charset=UTF-8
content-encoding: gzip
set-cookie: PHPSESSID=3k3vjl4bjs3prphm72kq8onrqb; path=/
set-cookie: __cf_bm=QMN9YcG2ZaHRe.TI4AWX5BA4UY1k4Nj.Eynlr0TIq7g-1760096211-1.0.1.1-B4ZvMqfcGUSVW7DL3NDzTD_kFlw4L.uVEfzIamvH8_uX48EpIxE07SSgt4lXZsBhH7gNqvKKLjM7fl5cgGk6DpLCeRQIn5_OVdDUQG7wG9E; path=/; expires=Fri, 10-Oct-25 12:06:51 GMT; domain=.rfc-editor.org; HttpOnly; Secure; SameSite=None
expires: Thu, 19 Nov 1981 08:52:00 GMT
cache-control: no-store, no-cache, must-revalidate
pragma: no-cache
vary: Accept-Encoding
strict-transport-security: max-age=31536000; includeSubDomains
x-frame-options: SAMEORIGIN
x-xss-protection: 1; mode=block
x-content-type-options: nosniff
cf-cache-status: DYNAMIC
server: cloudflare
cf-ray: 98c5d2859c372ffb-BLR
alt-svc: h3=":443"; ma=86400
RFC Errata Report » RFC Editor
Area Assignment: sec
Search RFCs
The Series
For Authors
Sponsor
RFC Errata
Found 1 record.
Status: Verified (1)
RFC 6194, "Security Considerations for the SHA-0 and SHA-1 Message-Digest Algorithms", March 2011
Source of RFC: IETF - NON WORKING GROUPArea Assignment: sec
Errata ID: 3683
Status: Verified
Type: Editorial
Publication Format(s) : TEXT
Reported By: Quynh Hung Dang
Date Reported: 2013-07-15
Verifier Name: Stephen Farrell
Date Verified: 2014-01-14
Section 3.2 says:
When n = 160, as is the case for SHA-1, it will take 2^106 computations to find a second pre-image in a 60-byte message.
It should say:
When n = 160, as is the case for SHA-1, the estimated computational complexity of finding a second preimage of any given message of about 2^60 bytes in length is 2^106 (compression function executions) which is significantly less than 2^160.
Notes:
Clarification.
spt: I replaced 2^55 blocks with 2^60 bytes after some consultation with Lily and Quynh.
IAB • IANA • IETF • IRTF • ISE • ISOC • IETF Trust
Reports • Privacy Statement • Site Map • Contact Us