Public mode

No access to your tenant or devices. Every item links to its source. What this means

Sources need attention Customize Public modeDiscuss ChangeIntel on Discord

Beego Vulnerable to Collision Hazards of MD5 in Cache Key Filenames

CVSS 4.0 6.9 MEDIUMEUVD CVSS 4.0 6.9 CVSS 4.0 · [email protected] · Secondary 6.9 MEDIUMCVSS 3.1 · [email protected] · Primary 7.5 HIGHCVSS_V4 Publisher rating MODERATEFixed by github.com/beego/beego/v2 2.3.4osv · severity unknownFixed by github.com/beego/beego/v2 2.3.4KEV status unknown

cve-program · CVE-2024-55885

Published

beego is an open-source web framework for the Go programming language. Versions of beego prior to 2.3.4 use MD5 as a hashing algorithm. MD5 is no longer considered secure against well-funded opponents due to its vulnerability to collision attacks. Version 2.3.4 replaces MD5 with SHA256.

Read the publisher's advisory

euvd · EUVD-2024-3454

Published

beego is an open-source web framework for the Go programming language. Versions of beego prior to 2.3.4 use MD5 as a hashing algorithm. MD5 is no longer considered secure against well-funded opponents due to its vulnerability to collision attacks. Version 2.3.4 replaces MD5 with SHA256.

Read the publisher's advisory

nvd · CVE-2024-55885

Published

beego is an open-source web framework for the Go programming language. Versions of beego prior to 2.3.4 use MD5 as a hashing algorithm. MD5 is no longer considered secure against well-funded opponents due to its vulnerability to collision attacks. Version 2.3.4 replaces MD5 with SHA256.

Read the publisher's advisory

osv · GHSA-9j3m-fr7q-jxfw

Published

In the context of using MD5 to generate filenames for cache keys, there are significant collision hazards that need to be considered. MD5, or Message Digest Algorithm 5, is a widely known cryptographic hash function that produces a 128-bit hash value. However, MD5 is no longer considered secure against well-funded opponents due to its vulnerability to collision attacks. ### Understanding Collisions A collision in hashing occurs when two different inputs produce the same hash output. For MD5, this means that it is theoretically possible, and even practical, to find two distinct cache keys that result in the same MD5 hash. This vulnerability has been well-documented and exploited in various security contexts. ### Implications for Cache Systems In a cache system where filenames are derived from the MD5 hash of cache keys, a collision could lead to several critical issues: Data Integrity Risks: If two different keys collide, they will map to the same filename. This could result in data being overwritten incorrectly, leading to data loss or corruption. Security Vulnerabilities: An attacker could potentially exploit collisions to manipulate cache data. For instance, by crafting a key that collides with another key, an attacker might gain unauthorized access to sensitive cached information or inject malicious data. Unpredictable Behavior: Collisions can cause the cache system to behave unpredictably, as it may retrieve or store data in unintended files, leading to system instability or incorrect behavior. ### Mitigation Strategies To mitigate these risks, consider the following strategies: Use a More Secure Hash Function: Replace MD5 with a more secure hash function like SHA-256, which has a significantly lower probability of collisions and is resistant to known attack vectors. code at:https://github.com/beego/beego/blob/bb72dc27ac3970e51d38ee52fc3dc1465ae25b9d/client/cache/file.go#L126

Read the publisher's advisory

osv · GO-2024-3331

Published

Beego has Collision Hazards of MD5 in Cache Key Filenames in github.com/beego/beego

Read the publisher's advisory

Affected versions, risk and source history

Related advisories and sources

Related changes

Linked by CVE identifier

No related changes are available here.

ChangeIntel

An IT change radar: releases, security, known issues, retirements, documentation changes, and service status from public sources. Every item links to supporting evidence; dates and statuses can change after they are read.

Sources read 15 Nov 12:11 UTC · 256 of 275 readable · 252 fully read · documentation 469/469 current