Description
rsync through 3.5.1 contains a denial of service vulnerability in the delta-transfer sender's hash_search() in match.c that allows malicious receivers to trigger unbounded strong-checksum work at consecutive offsets. Unauthenticated attackers pulling from a public daemon module can supply weak checksums colliding with consecutive rolling windows plus non-matching strong checksums, exhausting sender CPU across concurrent connections.
Published: 2026-11-03
Score: 8.7 High
EPSS: n/a
KEV: No
Impact: Denial of Service
Action: Apply Patch
AI Analysis

Impact

The vulnerability lies in rsync’s delta‑transfer sender hash_search() function, which can be forced to perform unbounded strong‑checksum calculations through crafted checksum collisions. An attacker can cause the sender to churn through many verification rounds, exhausting CPU resources and naming this as a denial‑of‑service flaw. The weakness is a poor handling of hash collisions (CWE‑407).

Affected Systems

This weakness affects Rsync by RsyncProject versions 3.5.1 and earlier. In practice, any system running a public rsync daemon that accepts unauthenticated pulls is susceptible.

Risk and Exploitability

The CVSS score of 8.7 marks the vulnerability as high severity. Because the EPSS score is not available, the exact likelihood of exploitation is unclear, but the flaw can be triggered by any remote client that can initiate a pull request to a public rsync server. The vulnerability is not listed in the CISA KEV catalog, though it could be exploited from anywhere on the Internet against exposed, unauthenticated rsync daemons.

Generated by OpenCVE AI on November 3, 2026 at 16:43 UTC.

Remediation

No solution or workaround provided in the CVE record.

OpenCVE Recommended Actions

  • Update rsync to version 3.5.2 or later to eliminate the hash_search collision handling bug.
  • If an immediate update is not possible, restrict or disable the public rsync daemon or tightly limit network access so that only trusted clients can connect.
  • Monitor server CPU consumption and rsync logs for spikes in strong‑checksum calculation activity that could indicate an attack attempt.
  • Consider lowering the maximum number of concurrent connections or applying other configuration limits to reduce the impact of a potential denial‑of‑service exploitation.

Generated by OpenCVE AI on November 3, 2026 at 16:43 UTC.

Tracking

Sign in to view the affected projects.

Advisories

No advisories yet.

History

Tue, 03 Nov 2026 17:30:00 +0000

Type Values Removed Values Added
Metrics ssvc

{'options': {'Automatable': 'yes', 'Exploitation': 'none', 'Technical Impact': 'partial'}, 'version': '2.0.3'}


Tue, 03 Nov 2026 15:45:00 +0000

Type Values Removed Values Added
Description rsync through 3.5.1 contains a denial of service vulnerability in the delta-transfer sender's hash_search() in match.c that allows malicious receivers to trigger unbounded strong-checksum work at consecutive offsets. Unauthenticated attackers pulling from a public daemon module can supply weak checksums colliding with consecutive rolling windows plus non-matching strong checksums, exhausting sender CPU across concurrent connections.
Title rsync through 3.5.1 Denial of Service via hash_search() Checksum Collisions
First Time appeared Samba
Samba rsync
Weaknesses CWE-407
CPEs cpe:2.3:a:samba:rsync:*:*:*:*:*:*:*:*
Vendors & Products Samba
Samba rsync
References
Metrics cvssV3_1

{'score': 7.5, 'vector': 'CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H'}

cvssV4_0

{'score': 8.7, 'vector': 'CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N'}


cve-icon MITRE

Status: PUBLISHED

Assigner: VulnCheck

Published:

Updated: 2026-11-03T16:44:12.242Z

Reserved: 2026-10-30T15:31:52.079Z

Link: CVE-2026-119741

cve-icon Vulnrichment

Updated: 2026-11-03T16:43:49.239Z

cve-icon NVD

Status : Awaiting Analysis

Published: 2026-11-03T16:17:21.940

Modified: 2026-11-03T17:18:07.287

Link: CVE-2026-119741

cve-icon Redhat

No data.

cve-icon OpenCVE Enrichment

Updated: 2026-11-03T16:45:14Z

Weaknesses
  • CWE-407

    Inefficient Algorithmic Complexity