CWE-407
Weakness Allowed-with-ReviewInefficient Algorithmic Complexity
Abstraction: Class · Status: Incomplete
An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.
Mapping guidance
This CWE entry is a Class and might have Base-level children that would be more appropriate
Examine children of this entry to see if there is a better fit
Modes of introduction
Detection methods
Automated Static Analysis
Automated static analysis, commonly referred to as Static Application Security Testing (SAST), can find some instances of this weakness by analyzing source code (or binary/compiled code) without having to execute it. Typically, this is done by building a model of data flow and control flow, then searching for potentially-vulnerable patterns that connect "sources" (origins of input) with "sinks" (destinations where the data interacts with external components, a lower layer such as the OS, etc.)
Effectiveness: High
Content history
updated Time_of_Introduction
updated Common_Consequences, Relationships, Other_Notes, Taxonomy_Mappings
updated Functional_Areas, Other_Notes
updated Common_Consequences
updated Applicable_Platforms, Likelihood_of_Exploit
updated Common_Consequences
updated Observed_Examples, Relationships
updated Relationships
updated Relationships
updated Likelihood_of_Exploit
updated Name, Relationships, Type
updated Relationships
updated Relationships
updated References, Relationships
updated References
updated Alternate_Terms, Observed_Examples, Relationships
updated Demonstrative_Examples, Observed_Examples, References
updated Relationships
updated Mapping_Notes
updated Weakness_Ordinalities
updated Detection_Factors, References
622 vulnerabilities reference this CWE, most recent first.
CVE-2026-134366 (GCVE-0-2026-134366)
Vulnerability from cvelistv5 – Published: 2026-11-21 16:34 – Updated: 2026-11-21 16:34- CWE-407 - Inefficient Algorithmic Complexity
| URL | Tags |
|---|---|
| https://github.com/py-pdf/pypdf/security/advisori… | vendor-advisory |
| https://www.vulncheck.com/advisories/pypdf-before… | third-party-advisory |
{
"containers": {
"cna": {
"affected": [
{
"defaultStatus": "unaffected",
"packageURL": "pkg:pypi/pypdf",
"product": "pypdf",
"vendor": "py-pdf",
"versions": [
{
"lessThan": "7.0.0",
"status": "affected",
"version": "0",
"versionType": "semver"
},
{
"status": "unaffected",
"version": "7.0.0",
"versionType": "semver"
}
]
}
],
"cpeApplicability": [
{
"nodes": [
{
"cpeMatch": [
{
"criteria": "cpe:2.3:a:py-pdf:pypdf:*:*:*:*:*:*:*:*",
"versionEndExcluding": "7.0.0",
"vulnerable": true
}
],
"negate": false,
"operator": "OR"
}
]
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "Be33eD"
}
],
"datePublic": "2026-11-06T00:00:00.000Z",
"descriptions": [
{
"lang": "en",
"value": "pypdf before 7.0.0 contains a resource exhaustion vulnerability that allows attackers to cause large memory usage by supplying crafted PDF cross-reference streams. Attackers can craft a PDF whose cross-reference stream offsets all point to one large object, exhausting memory in applications parsing the file."
}
],
"metrics": [
{
"cvssV4_0": {
"Automatable": "NOT_DEFINED",
"Recovery": "NOT_DEFINED",
"Safety": "NOT_DEFINED",
"attackComplexity": "LOW",
"attackRequirements": "NONE",
"attackVector": "NETWORK",
"baseScore": 8.7,
"baseSeverity": "HIGH",
"exploitMaturity": "NOT_DEFINED",
"privilegesRequired": "NONE",
"providerUrgency": "NOT_DEFINED",
"subAvailabilityImpact": "NONE",
"subConfidentialityImpact": "NONE",
"subIntegrityImpact": "NONE",
"userInteraction": "NONE",
"valueDensity": "NOT_DEFINED",
"vectorString": "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",
"version": "4.0",
"vulnAvailabilityImpact": "HIGH",
"vulnConfidentialityImpact": "NONE",
"vulnIntegrityImpact": "NONE",
"vulnerabilityResponseEffort": "NOT_DEFINED"
},
"format": "CVSS"
},
{
"cvssV3_1": {
"attackComplexity": "LOW",
"attackVector": "NETWORK",
"availabilityImpact": "HIGH",
"baseScore": 7.5,
"baseSeverity": "HIGH",
"confidentialityImpact": "NONE",
"integrityImpact": "NONE",
"privilegesRequired": "NONE",
"scope": "UNCHANGED",
"userInteraction": "NONE",
"vectorString": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
"version": "3.1"
},
"format": "CVSS"
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-21T16:34:15.709Z",
"orgId": "83251b91-4cc7-4094-a5c7-464a1b83ea10",
"shortName": "VulnCheck"
},
"references": [
{
"name": "GitHub Security Advisory (GHSA-59jv-x5x2-gg4c)",
"tags": [
"vendor-advisory"
],
"url": "https://github.com/py-pdf/pypdf/security/advisories/GHSA-59jv-x5x2-gg4c"
},
{
"name": "VulnCheck Advisory: pypdf before 7.0.0 Memory Exhaustion via Cross-Reference Streams with Identical Offsets",
"tags": [
"third-party-advisory"
],
"url": "https://www.vulncheck.com/advisories/pypdf-before-7.0.0-memory-exhaustion-via-cross-reference-streams-with-identical-offsets"
}
],
"title": "pypdf before 7.0.0 Memory Exhaustion via Cross-Reference Streams with Identical Offsets",
"x_generator": {
"engine": "vulncheck-endgame"
}
}
},
"cveMetadata": {
"assignerOrgId": "83251b91-4cc7-4094-a5c7-464a1b83ea10",
"assignerShortName": "VulnCheck",
"cveId": "CVE-2026-134366",
"datePublished": "2026-11-21T16:34:15.709Z",
"dateReserved": "2026-11-21T00:01:23.102Z",
"dateUpdated": "2026-11-21T16:34:15.709Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-134164 (GCVE-0-2026-134164)
Vulnerability from cvelistv5 – Published: 2026-11-20 22:30 – Updated: 2026-11-20 22:30- CWE-407 - Inefficient Algorithmic Complexity
| URL | Tags |
|---|---|
| https://github.com/nodeca/probe-image-size/securi… | vendor-advisory |
| https://github.com/nodeca/probe-image-size/commit… | patch |
| https://github.com/nodeca/probe-image-size/blob/6… | technical-description |
| https://www.npmjs.com/package/probe-image-size/v/7.5.0 | product |
| https://www.vulncheck.com/advisories/probe-image-… | third-party-advisory |
| Vendor | Product | Version | |
|---|---|---|---|
| nodeca | probe-image-size |
Affected:
0 , < 7.5.0
(semver)
|
{
"containers": {
"cna": {
"affected": [
{
"defaultStatus": "unaffected",
"packageURL": "pkg:npm/probe-image-size",
"product": "probe-image-size",
"repo": "https://github.com/nodeca/probe-image-size",
"vendor": "nodeca",
"versions": [
{
"lessThan": "7.5.0",
"status": "affected",
"version": "0",
"versionType": "semver"
}
]
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "Zachariah Mithani (AploSec)"
}
],
"datePublic": "2026-10-26T22:45:13.000Z",
"descriptions": [
{
"lang": "en",
"value": "probe-image-size before 7.5.0 contains an algorithmic-complexity denial of service vulnerability in lib/exif_utils.js that allows remote unauthenticated attackers to exhaust CPU by supplying self-referencing EXIF IFDs. Attackers can submit a crafted 9.6 KB JPEG with repeated ExifIFD and InteropIFD pointers to block the Node.js event loop for about 23 seconds."
}
],
"metrics": [
{
"cvssV4_0": {
"attackComplexity": "LOW",
"attackRequirements": "NONE",
"attackVector": "NETWORK",
"baseScore": 8.7,
"baseSeverity": "HIGH",
"privilegesRequired": "NONE",
"subAvailabilityImpact": "NONE",
"subConfidentialityImpact": "NONE",
"subIntegrityImpact": "NONE",
"userInteraction": "NONE",
"vectorString": "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",
"version": "4.0",
"vulnAvailabilityImpact": "HIGH",
"vulnConfidentialityImpact": "NONE",
"vulnIntegrityImpact": "NONE"
},
"format": "CVSS"
},
{
"cvssV3_1": {
"attackComplexity": "LOW",
"attackVector": "NETWORK",
"availabilityImpact": "HIGH",
"baseScore": 7.5,
"baseSeverity": "HIGH",
"confidentialityImpact": "NONE",
"integrityImpact": "NONE",
"privilegesRequired": "NONE",
"scope": "UNCHANGED",
"userInteraction": "NONE",
"vectorString": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
"version": "3.1"
},
"format": "CVSS"
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T22:30:42.184Z",
"orgId": "83251b91-4cc7-4094-a5c7-464a1b83ea10",
"shortName": "VulnCheck"
},
"references": [
{
"name": "GitHub Security Advisory (GHSA-gvwc-5hr5-44p8)",
"tags": [
"vendor-advisory"
],
"url": "https://github.com/nodeca/probe-image-size/security/advisories/GHSA-gvwc-5hr5-44p8"
},
{
"tags": [
"patch"
],
"url": "https://github.com/nodeca/probe-image-size/commit/d91678eaff2aad93f7b05bc5212b75856164ec7a"
},
{
"tags": [
"technical-description"
],
"url": "https://github.com/nodeca/probe-image-size/blob/64565c3c8b4b69655426cdfce250e6a93455c9da/lib/exif_utils.js#L210-L216"
},
{
"tags": [
"product"
],
"url": "https://www.npmjs.com/package/probe-image-size/v/7.5.0"
},
{
"name": "VulnCheck Advisory: probe-image-size before 7.5.0 Denial of Service via EXIF Sub-IFD Traversal",
"tags": [
"third-party-advisory"
],
"url": "https://www.vulncheck.com/advisories/probe-image-size-before-7.5.0-denial-of-service-via-exif-sub-ifd-traversal"
}
],
"title": "probe-image-size before 7.5.0 Denial of Service via EXIF Sub-IFD Traversal",
"x_generator": {
"engine": "vulncheck-endgame"
}
}
},
"cveMetadata": {
"assignerOrgId": "83251b91-4cc7-4094-a5c7-464a1b83ea10",
"assignerShortName": "VulnCheck",
"cveId": "CVE-2026-134164",
"datePublished": "2026-11-20T22:30:42.184Z",
"dateReserved": "2026-11-20T22:01:20.467Z",
"dateUpdated": "2026-11-20T22:30:42.184Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-133428 (GCVE-0-2026-133428)
Vulnerability from cvelistv5 – Published: 2026-11-20 07:32 – Updated: 2026-11-20 17:19- CWE-407 - Inefficient Algorithmic Complexity
{
"containers": {
"adp": [
{
"metrics": [
{
"other": {
"content": {
"id": "CVE-2026-133428",
"options": [
{
"Exploitation": "none"
},
{
"Automatable": "no"
},
{
"Technical Impact": "partial"
}
],
"role": "CISA Coordinator",
"timestamp": "2026-11-20T17:19:11.695942Z",
"version": "2.0.3"
},
"type": "ssvc"
}
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T17:19:22.719Z",
"orgId": "134c704f-9b21-4f2e-91b3-4a467353bcc0",
"shortName": "CISA-ADP"
},
"title": "CISA ADP Vulnrichment"
}
],
"cna": {
"affected": [
{
"collectionURL": "https://pypi.org",
"defaultStatus": "unaffected",
"packageName": "pydantic",
"product": "pydantic",
"repo": "https://github.com/pydantic/pydantic",
"vendor": "pydantic",
"versions": [
{
"lessThan": "2.14.0",
"status": "affected",
"version": "2.0.0",
"versionType": "python"
}
]
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "iamibi"
}
],
"descriptions": [
{
"lang": "en",
"supportingMedia": [
{
"base64": false,
"type": "text/html",
"value": "\u003ch3\u003eSummary\u003c/h3\u003e\n\u003cp\u003eValidating an untrusted URL with a long scheme and many hosts into a multi-host URL field (e.g. \u003ccode\u003ePostgresDsn\u003c/code\u003e) takes quadratic time and memory: an input of about a hundred kilobytes takes around a gigabyte of memory to validate.\u003c/p\u003e\n\u003ch3\u003eDetails\u003c/h3\u003e\n\u003cp\u003eThe \u003ca href=\"https://github.com/pydantic/pydantic/blob/v2.13.5/pydantic-core/src/validators/url.rs#L537\"\u003e\u003ccode\u003eparse_multihost_url()\u003c/code\u003e\u003c/a\u003e function (in \u003ccode\u003epydantic-core/src/validators/url.rs\u003c/code\u003e) parses each host separately, prepending the whole URL prefix (including the scheme) to every one of them (\u003ca href=\"https://github.com/pydantic/pydantic/blob/v2.13.5/pydantic-core/src/validators/url.rs#L644-L649\"\u003eL644-L649\u003c/a\u003e):\u003c/p\u003e\n\u003cpre\u003e\u003ccode class=\"language-rust\"\u003elet extra_urls: Vec\u0026lt;Url\u0026gt; = hosts\n .iter()\n .map(|host| {\n let reconstructed_url = format!(\"{prefix}{host}\");\n parse_url(\u0026amp;reconstructed_url, input, strict)\n })\n .collect::\u0026lt;ValResult\u0026lt;_\u0026gt;\u0026gt;()?;\n\u003c/code\u003e\u003c/pre\u003e\n\u003cp\u003eAs the scheme can be arbitrarily long, and is parsed and stored once per host, both time and memory grow quadratically with the input size. Allowed schemes (e.g. \u003ccode\u003epostgres\u003c/code\u003e for \u003ccode\u003ePostgresDsn\u003c/code\u003e) are only checked after parsing, so they don\u0027t prevent the issue.\u003c/p\u003e\n\u003cp\u003eThe issue was fixed in commit \u003ca href=\"https://github.com/pydantic/pydantic/commit/b4028f9d87e34750e53be0ba011d70f3c0fcc94e\"\u003eb4028f9d87e34750e53be0ba011d70f3c0fcc94e\u003c/a\u003e.\u003c/p\u003e\n\u003ch3\u003eImpact\u003c/h3\u003e\n\u003cp\u003eDenial of service through validation of untrusted input. Affected are applications validating untrusted strings into multi-host URL fields (\u003ccode\u003ePostgresDsn\u003c/code\u003e, \u003ccode\u003eMongoDsn\u003c/code\u003e, \u003ccode\u003eNatsDsn\u003c/code\u003e, or custom types built on \u003ccode\u003eMultiHostUrl\u003c/code\u003e).\u003c/p\u003e"
}
],
"value": "Validating an untrusted URL with a long scheme and many hosts into a multi-host URL field (e.g. PostgresDsn) takes quadratic time and memory: an input of about a hundred kilobytes takes around a gigabyte of memory to validate.\n\nThe parse_multihost_url() function (in pydantic-core/src/validators/url.rs) parses each host separately, prepending the whole URL prefix (including the scheme) to every one of them. As the scheme can be arbitrarily long, and is parsed and stored once per host, both time and memory grow quadratically with the input size. Allowed schemes (e.g. postgres for PostgresDsn) are only checked after parsing, so they don\u0027t prevent the issue.\n\nThe issue was fixed in commit b4028f9d87e34750e53be0ba011d70f3c0fcc94e.\n\nImpact: denial of service through validation of untrusted input. Affected are applications validating untrusted strings into multi-host URL fields (PostgresDsn, MongoDsn, NatsDsn, or custom types built on MultiHostUrl)."
}
],
"metrics": [
{
"cvssV4_0": {
"baseScore": 6.3,
"baseSeverity": "MEDIUM",
"vectorString": "CVSS:4.0/AV:N/AC:L/AT:P/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N",
"version": "4.0"
}
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T07:32:16.979Z",
"orgId": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"shortName": "Pydantic"
},
"references": [
{
"tags": [
"vendor-advisory"
],
"url": "https://github.com/pydantic/pydantic/security/advisories/GHSA-955g-x97g-8mcp"
},
{
"url": "https://github.com/pydantic/pydantic/blob/v2.13.5/pydantic-core/src/validators/url.rs#L537"
},
{
"url": "https://github.com/pydantic/pydantic/blob/v2.13.5/pydantic-core/src/validators/url.rs#L644-L649"
},
{
"url": "https://github.com/pydantic/pydantic/commit/b4028f9d87e34750e53be0ba011d70f3c0fcc94e"
}
],
"source": {
"advisory": "GHSA-955g-x97g-8mcp",
"discovery": "UNKNOWN"
},
"title": "Quadratic time and memory multi-host URL validation"
}
},
"cveMetadata": {
"assignerOrgId": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"assignerShortName": "Pydantic",
"cveId": "CVE-2026-133428",
"datePublished": "2026-11-20T07:32:16.979Z",
"dateReserved": "2026-11-19T19:47:33.202Z",
"dateUpdated": "2026-11-20T17:19:22.719Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-133422 (GCVE-0-2026-133422)
Vulnerability from cvelistv5 – Published: 2026-11-20 07:33 – Updated: 2026-11-20 17:21- CWE-407 - Inefficient Algorithmic Complexity
{
"containers": {
"adp": [
{
"metrics": [
{
"other": {
"content": {
"id": "CVE-2026-133422",
"options": [
{
"Exploitation": "none"
},
{
"Automatable": "yes"
},
{
"Technical Impact": "partial"
}
],
"role": "CISA Coordinator",
"timestamp": "2026-11-20T17:20:53.119210Z",
"version": "2.0.3"
},
"type": "ssvc"
}
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T17:21:01.909Z",
"orgId": "134c704f-9b21-4f2e-91b3-4a467353bcc0",
"shortName": "CISA-ADP"
},
"title": "CISA ADP Vulnrichment"
}
],
"cna": {
"affected": [
{
"collectionURL": "https://pypi.org",
"defaultStatus": "unaffected",
"packageName": "pydantic",
"product": "pydantic",
"repo": "https://github.com/pydantic/pydantic",
"vendor": "pydantic",
"versions": [
{
"lessThanOrEqual": "1.10.26",
"status": "affected",
"version": "1.9.0",
"versionType": "python"
}
]
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "iamibi"
}
],
"descriptions": [
{
"lang": "en",
"supportingMedia": [
{
"base64": false,
"type": "text/html",
"value": "\u003ch3\u003eSummary\u003c/h3\u003e\n\u003cp\u003eValidating an untrusted list into a field constrained with \u003ccode\u003eunique_items=True\u003c/code\u003e with Pydantic V1 takes quadratic time: an input of a few hundred kilobytes takes seconds to validate.\u003c/p\u003e\n\u003ch3\u003eDetails\u003c/h3\u003e\n\u003cp\u003eThe \u003ca href=\"https://github.com/pydantic/pydantic/blob/v1.10.26/pydantic/types.py#L612-L620\"\u003e\u003ccode\u003eConstrainedList.unique_items_validator\u003c/code\u003e\u003c/a\u003e validator (in \u003ccode\u003epydantic/types.py\u003c/code\u003e) checks each item against all the following ones:\u003c/p\u003e\n\u003cpre\u003e\u003ccode class=\"language-python\"\u003e@classmethod\ndef unique_items_validator(cls, v: \u0027Optional[List[T]]\u0027) -\u0026gt; \u0027Optional[List[T]]\u0027:\n if v is None:\n return None\n\n for i, value in enumerate(v, start=1):\n if value in v[i:]:\n raise errors.ListUniqueItemsError()\n\n return v\n\u003c/code\u003e\u003c/pre\u003e\n\u003cp\u003eFor a list with no duplicates (the common, valid case), this results in a quadratic number of comparisons.\u003c/p\u003e\n\u003cp\u003eThe issue was fixed in commit \u003ca href=\"https://github.com/pydantic/pydantic/commit/6ec75e57f277a820ec583e601167f25fe8dc7c87\"\u003e6ec75e57f277a820ec583e601167f25fe8dc7c87\u003c/a\u003e.\u003c/p\u003e\n\u003cp\u003eIf you are relying on the \u003ccode\u003epydantic.v1\u003c/code\u003e namespace in Pydantic V2, upgrade to \u003ca href=\"https://github.com/pydantic/pydantic/releases/tag/v2.14.2\"\u003eV2.14.2\u003c/a\u003e or later.\u003c/p\u003e\n\u003ch3\u003eImpact\u003c/h3\u003e\n\u003cp\u003eDenial of service through validation of untrusted input. Affected are applications validating untrusted lists into fields constrained with \u003ccode\u003eunique_items=True\u003c/code\u003e (using \u003ccode\u003econlist()\u003c/code\u003e or \u003ccode\u003eField()\u003c/code\u003e).\u003c/p\u003e\n\u003cp\u003eThe fix only applies to lists of builtin scalar types (\u003ccode\u003eint\u003c/code\u003e, \u003ccode\u003efloat\u003c/code\u003e, \u003ccode\u003estr\u003c/code\u003e, \u003ccode\u003ebytes\u003c/code\u003e, \u003ccode\u003ebool\u003c/code\u003e and \u003ccode\u003eNone\u003c/code\u003e), for which duplicates can be detected in linear time. Lists of other types (e.g. models or dictionaries) are still checked in quadratic time, as their items aren\u0027t guaranteed to be hashable: bound their size using the \u003ccode\u003emax_items\u003c/code\u003e constraint.\u003c/p\u003e\n\u003cp\u003ePydantic V2 models are not affected.\u003c/p\u003e"
}
],
"value": "Validating an untrusted list into a field constrained with unique_items=True with Pydantic V1 takes quadratic time: an input of a few hundred kilobytes takes seconds to validate.\n\nThe ConstrainedList.unique_items_validator validator (in pydantic/types.py) checks each item against all the following ones. For a list with no duplicates (the common, valid case), this results in a quadratic number of comparisons.\n\nThe issue was fixed in commit 6ec75e57f277a820ec583e601167f25fe8dc7c87. Users relying on the pydantic.v1 namespace in Pydantic V2 should upgrade to 2.14.2 or later.\n\nImpact: denial of service through validation of untrusted input. Affected are applications validating untrusted lists into fields constrained with unique_items=True (using conlist() or Field()).\n\nThe fix only applies to lists of builtin scalar types (int, float, str, bytes, bool and None), for which duplicates can be detected in linear time. Lists of other types (e.g. models or dictionaries) are still checked in quadratic time, as their items aren\u0027t guaranteed to be hashable: bound their size using the max_items constraint.\n\nPydantic V2 models are not affected."
}
],
"metrics": [
{
"cvssV4_0": {
"baseScore": 6.9,
"baseSeverity": "MEDIUM",
"vectorString": "CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N",
"version": "4.0"
}
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T07:33:35.498Z",
"orgId": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"shortName": "Pydantic"
},
"references": [
{
"tags": [
"vendor-advisory"
],
"url": "https://github.com/pydantic/pydantic/security/advisories/GHSA-49g6-96jj-f7r9"
},
{
"url": "https://github.com/pydantic/pydantic/blob/v1.10.26/pydantic/types.py#L612-L620"
},
{
"url": "https://github.com/pydantic/pydantic/commit/6ec75e57f277a820ec583e601167f25fe8dc7c87"
},
{
"url": "https://github.com/pydantic/pydantic/releases/tag/v2.14.2"
}
],
"source": {
"advisory": "GHSA-49g6-96jj-f7r9",
"discovery": "UNKNOWN"
},
"title": "Quadratic time unique_items list validation in Pydantic V1"
}
},
"cveMetadata": {
"assignerOrgId": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"assignerShortName": "Pydantic",
"cveId": "CVE-2026-133422",
"datePublished": "2026-11-20T07:33:35.498Z",
"dateReserved": "2026-11-19T19:33:36.828Z",
"dateUpdated": "2026-11-20T17:21:01.909Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-132277 (GCVE-0-2026-132277)
Vulnerability from cvelistv5 – Published: 2026-11-20 17:08 – Updated: 2026-11-20 17:08| URL | Tags |
|---|---|
| https://github.com/weblyzard/inscriptis/security/… | x_refsource_CONFIRM |
| https://github.com/weblyzard/inscriptis/commit/dc… | x_refsource_MISC |
| https://github.com/weblyzard/inscriptis/releases/… | x_refsource_MISC |
| Vendor | Product | Version | |
|---|---|---|---|
| weblyzard | inscriptis |
Affected:
>= 2.0.0, < 2.7.6
|
{
"containers": {
"cna": {
"affected": [
{
"product": "inscriptis",
"vendor": "weblyzard",
"versions": [
{
"status": "affected",
"version": "\u003e= 2.0.0, \u003c 2.7.6"
}
]
}
],
"descriptions": [
{
"lang": "en",
"value": "Inscriptis is a Python library for converting HTML to text. From 2.0.0 until 2.7.6, when the parent is block-level, table_end_handler() in model/tag/table_tag.py writes each sibling table through HtmlElement.write_verbatim_text() in model/html_element.py; Canvas.open_block() leaves the parent padding_inline prefix on the stack, Canvas.close_block() does not remove it, and only Canvas.close_tag() calls prefix.remove_last_prefix(). Each following sibling table therefore carries forward accumulated indentation, making get_text() output grow quadratically and allowing small attacker-controlled HTML to exhaust memory in applications converting it without authentication or user interaction. This issue is fixed in 2.7.6."
}
],
"metrics": [
{
"cvssV3_1": {
"attackComplexity": "LOW",
"attackVector": "NETWORK",
"availabilityImpact": "LOW",
"baseScore": 5.3,
"baseSeverity": "MEDIUM",
"confidentialityImpact": "NONE",
"integrityImpact": "NONE",
"privilegesRequired": "NONE",
"scope": "UNCHANGED",
"userInteraction": "NONE",
"vectorString": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:L",
"version": "3.1"
}
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-400",
"description": "CWE-400: Uncontrolled Resource Consumption",
"lang": "en",
"type": "CWE"
}
]
},
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T17:08:11.051Z",
"orgId": "a0819718-46f1-4df5-94e2-005712e83aaa",
"shortName": "GitHub_M"
},
"references": [
{
"name": "https://github.com/weblyzard/inscriptis/security/advisories/GHSA-q87h-c5m7-659j",
"tags": [
"x_refsource_CONFIRM"
],
"url": "https://github.com/weblyzard/inscriptis/security/advisories/GHSA-q87h-c5m7-659j"
},
{
"name": "https://github.com/weblyzard/inscriptis/commit/dc122894cd671a0227f8fdad60464acddaf40fc8",
"tags": [
"x_refsource_MISC"
],
"url": "https://github.com/weblyzard/inscriptis/commit/dc122894cd671a0227f8fdad60464acddaf40fc8"
},
{
"name": "https://github.com/weblyzard/inscriptis/releases/tag/2.7.6",
"tags": [
"x_refsource_MISC"
],
"url": "https://github.com/weblyzard/inscriptis/releases/tag/2.7.6"
}
],
"source": {
"advisory": "GHSA-q87h-c5m7-659j",
"discovery": "UNKNOWN"
},
"title": "Inscriptis: Quadratic memory growth from sibling \u003ctable\u003e elements in get_text()"
}
},
"cveMetadata": {
"assignerOrgId": "a0819718-46f1-4df5-94e2-005712e83aaa",
"assignerShortName": "GitHub_M",
"cveId": "CVE-2026-132277",
"datePublished": "2026-11-20T17:08:11.051Z",
"dateReserved": "2026-11-18T16:45:23.253Z",
"dateUpdated": "2026-11-20T17:08:11.051Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-131877 (GCVE-0-2026-131877)
Vulnerability from cvelistv5 – Published: 2026-11-20 00:31 – Updated: 2026-11-20 19:04- CWE-407 - Inefficient Algorithmic Complexity
| URL | Tags |
|---|---|
| https://github.com/cpan-authors/perl-Convert-ASN1… | patch |
| https://metacpan.org/release/TIMLEGGE/Convert-ASN… | release-notes |
| https://github.com/cpan-authors/perl-Convert-ASN1… | issue-tracking |
{
"containers": {
"adp": [
{
"metrics": [
{
"cvssV3_1": {
"attackComplexity": "LOW",
"attackVector": "NETWORK",
"availabilityImpact": "HIGH",
"baseScore": 7.5,
"baseSeverity": "HIGH",
"confidentialityImpact": "NONE",
"integrityImpact": "NONE",
"privilegesRequired": "NONE",
"scope": "UNCHANGED",
"userInteraction": "NONE",
"vectorString": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H",
"version": "3.1"
}
},
{
"other": {
"content": {
"id": "CVE-2026-131877",
"options": [
{
"Exploitation": "none"
},
{
"Automatable": "yes"
},
{
"Technical Impact": "partial"
}
],
"role": "CISA Coordinator",
"timestamp": "2026-11-20T19:03:46.729148Z",
"version": "2.0.3"
},
"type": "ssvc"
}
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T19:04:28.476Z",
"orgId": "134c704f-9b21-4f2e-91b3-4a467353bcc0",
"shortName": "CISA-ADP"
},
"title": "CISA ADP Vulnrichment"
}
],
"cna": {
"affected": [
{
"collectionURL": "https://cpan.org/modules",
"defaultStatus": "unaffected",
"modules": [
"Convert::ASN1"
],
"packageName": "Convert-ASN1",
"packageURL": "pkg:cpan/Convert-ASN1",
"programFiles": [
"lib/Convert/ASN1/_decode.pm",
"lib/Convert/ASN1/_encode.pm"
],
"programRoutines": [
{
"name": "Convert::ASN1::_dec_object_id"
},
{
"name": "Convert::ASN1::_enc_object_id"
}
],
"repo": "https://github.com/cpan-authors/perl-Convert-ASN1",
"versions": [
{
"lessThan": "0.37",
"status": "affected",
"version": "0",
"versionType": "custom"
}
]
}
],
"descriptions": [
{
"lang": "en",
"value": "Convert::ASN1 versions before 0.37 for Perl allow CPU exhaustion via unbounded arc length in OBJECT IDENTIFIER decoding and encoding.\n\nThe content of an OBJECT IDENTIFIER or RELATIVE-OID element is passed to unpack \"w*\" on decode, and the arcs of an OID string to pack \"w*\" on encode. Perl converts each arc to or from its decimal string in time quadratic in the arc\u0027s length, and nothing limits that length.\n\nAn attacker who controls the decoded data, or an OID string passed to encode, can exhaust CPU with a single oversized arc."
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407 Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T00:31:14.529Z",
"orgId": "9b29abf9-4ab0-4765-b253-1875cd9b441e",
"shortName": "CPANSec"
},
"references": [
{
"tags": [
"patch"
],
"url": "https://github.com/cpan-authors/perl-Convert-ASN1/commit/805a7ee7d6c01a7dd6e0479fabcaadd7f9116e70.patch"
},
{
"tags": [
"release-notes"
],
"url": "https://metacpan.org/release/TIMLEGGE/Convert-ASN1-0.37/changes"
},
{
"tags": [
"issue-tracking"
],
"url": "https://github.com/cpan-authors/perl-Convert-ASN1/issues"
}
],
"solutions": [
{
"lang": "en",
"value": "Upgrade to Convert-ASN1 0.37 or later."
}
],
"source": {
"discovery": "UNKNOWN"
},
"title": "Convert::ASN1 versions before 0.37 for Perl allow CPU exhaustion via unbounded arc length in OBJECT IDENTIFIER decoding and encoding",
"x_generator": {
"engine": "cpansec-cna-tool 0.1"
}
}
},
"cveMetadata": {
"assignerOrgId": "9b29abf9-4ab0-4765-b253-1875cd9b441e",
"assignerShortName": "CPANSec",
"cveId": "CVE-2026-131877",
"datePublished": "2026-11-20T00:31:14.529Z",
"dateReserved": "2026-11-18T03:27:16.514Z",
"dateUpdated": "2026-11-20T19:04:28.476Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-130465 (GCVE-0-2026-130465)
Vulnerability from cvelistv5 – Published: 2026-11-20 08:49 – Updated: 2026-11-20 08:49- CWE-407 - Inefficient Algorithmic Complexity
| Vendor | Product | Version | |
|---|---|---|---|
| Wireshark Foundation | Wireshark |
Affected:
4.6.0 , < 4.6.10
(semver)
Affected: 4.4.0 , < 4.4.20 (semver) |
{
"containers": {
"cna": {
"affected": [
{
"defaultStatus": "unaffected",
"product": "Wireshark",
"repo": "https://gitlab.com/wireshark/wireshark",
"vendor": "Wireshark Foundation",
"versions": [
{
"lessThan": "4.6.10",
"status": "affected",
"version": "4.6.0",
"versionType": "semver"
},
{
"lessThan": "4.4.20",
"status": "affected",
"version": "4.4.0",
"versionType": "semver"
}
]
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "Aisle Research (Dmitrijs Trizna, Luigino Camastra, Ze Sheng (O2Lab \u0026 TAMU), Igor Morgenstern)"
}
],
"descriptions": [
{
"lang": "en",
"value": "Ascend file parser large loop in 4.6.0 to 4.6.9 and 4.4.0 to 4.4.19 allows denial of service"
}
],
"metrics": [
{
"cvssV3_1": {
"attackComplexity": "HIGH",
"attackVector": "LOCAL",
"availabilityImpact": "HIGH",
"baseScore": 4.7,
"baseSeverity": "MEDIUM",
"confidentialityImpact": "NONE",
"integrityImpact": "NONE",
"privilegesRequired": "NONE",
"scope": "UNCHANGED",
"userInteraction": "REQUIRED",
"vectorString": "CVSS:3.1/AV:L/AC:H/PR:N/UI:R/S:U/C:N/I:N/A:H",
"version": "3.1"
},
"format": "CVSS",
"scenarios": [
{
"lang": "en",
"value": "GENERAL"
}
]
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T08:49:18.330Z",
"orgId": "ceab7361-8a18-47b1-92ba-4d7d25f6715a",
"shortName": "GitLab"
},
"references": [
{
"url": "https://www.wireshark.org/security/wnpa-sec-2026-115.html"
}
],
"solutions": [
{
"lang": "en",
"value": "Upgrade to version 4.6.10 or above"
}
],
"title": "Inefficient Algorithmic Complexity in Wireshark"
}
},
"cveMetadata": {
"assignerOrgId": "ceab7361-8a18-47b1-92ba-4d7d25f6715a",
"assignerShortName": "GitLab",
"cveId": "CVE-2026-130465",
"datePublished": "2026-11-20T08:49:18.330Z",
"dateReserved": "2026-11-17T05:36:04.049Z",
"dateUpdated": "2026-11-20T08:49:18.330Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-130462 (GCVE-0-2026-130462)
Vulnerability from cvelistv5 – Published: 2026-11-20 08:49 – Updated: 2026-11-20 08:49- CWE-407 - Inefficient Algorithmic Complexity
| Vendor | Product | Version | |
|---|---|---|---|
| Wireshark Foundation | Wireshark |
Affected:
4.6.0 , < 4.6.10
(semver)
Affected: 4.4.0 , < 4.4.20 (semver) |
{
"containers": {
"cna": {
"affected": [
{
"defaultStatus": "unaffected",
"product": "Wireshark",
"repo": "https://gitlab.com/wireshark/wireshark",
"vendor": "Wireshark Foundation",
"versions": [
{
"lessThan": "4.6.10",
"status": "affected",
"version": "4.6.0",
"versionType": "semver"
},
{
"lessThan": "4.4.20",
"status": "affected",
"version": "4.4.0",
"versionType": "semver"
}
]
}
],
"descriptions": [
{
"lang": "en",
"value": "Multiple protocol dissector and file parser hangs in 4.6.0 to 4.6.9 and 4.4.0 to 4.4.19 allows denial of service"
}
],
"metrics": [
{
"cvssV3_1": {
"attackComplexity": "LOW",
"attackVector": "LOCAL",
"availabilityImpact": "HIGH",
"baseScore": 5.5,
"baseSeverity": "MEDIUM",
"confidentialityImpact": "NONE",
"integrityImpact": "NONE",
"privilegesRequired": "NONE",
"scope": "UNCHANGED",
"userInteraction": "REQUIRED",
"vectorString": "CVSS:3.1/AV:L/AC:L/PR:N/UI:R/S:U/C:N/I:N/A:H",
"version": "3.1"
},
"format": "CVSS",
"scenarios": [
{
"lang": "en",
"value": "GENERAL"
}
]
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T08:49:08.331Z",
"orgId": "ceab7361-8a18-47b1-92ba-4d7d25f6715a",
"shortName": "GitLab"
},
"references": [
{
"url": "https://www.wireshark.org/security/wnpa-sec-2026-118.html"
},
{
"url": "https://gitlab.com/wireshark/wireshark/-/work_items/21747"
}
],
"solutions": [
{
"lang": "en",
"value": "Upgrade to version 4.6.10 or above"
}
],
"title": "Inefficient Algorithmic Complexity in Wireshark"
}
},
"cveMetadata": {
"assignerOrgId": "ceab7361-8a18-47b1-92ba-4d7d25f6715a",
"assignerShortName": "GitLab",
"cveId": "CVE-2026-130462",
"datePublished": "2026-11-20T08:49:08.331Z",
"dateReserved": "2026-11-17T05:35:49.057Z",
"dateUpdated": "2026-11-20T08:49:08.331Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-130459 (GCVE-0-2026-130459)
Vulnerability from cvelistv5 – Published: 2026-11-20 08:47 – Updated: 2026-11-20 08:47- CWE-407 - Inefficient Algorithmic Complexity
| Vendor | Product | Version | |
|---|---|---|---|
| Wireshark Foundation | Wireshark |
Affected:
4.6.0 , < 4.6.10
(semver)
Affected: 4.4.0 , < 4.4.20 (semver) |
{
"containers": {
"cna": {
"affected": [
{
"defaultStatus": "unaffected",
"product": "Wireshark",
"repo": "https://gitlab.com/wireshark/wireshark",
"vendor": "Wireshark Foundation",
"versions": [
{
"lessThan": "4.6.10",
"status": "affected",
"version": "4.6.0",
"versionType": "semver"
},
{
"lessThan": "4.4.20",
"status": "affected",
"version": "4.4.0",
"versionType": "semver"
}
]
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "Aisle Research (Dmitrijs Trizna, Luigino Camastra, Ze Sheng (O2Lab \u0026 TAMU), Igor Morgenstern)"
}
],
"descriptions": [
{
"lang": "en",
"value": "Tektronix K12xx file parser large loop in 4.6.0 to 4.6.9 and 4.4.0 to 4.4.19 allows denial of service"
}
],
"metrics": [
{
"cvssV3_1": {
"attackComplexity": "HIGH",
"attackVector": "LOCAL",
"availabilityImpact": "HIGH",
"baseScore": 4.7,
"baseSeverity": "MEDIUM",
"confidentialityImpact": "NONE",
"integrityImpact": "NONE",
"privilegesRequired": "NONE",
"scope": "UNCHANGED",
"userInteraction": "REQUIRED",
"vectorString": "CVSS:3.1/AV:L/AC:H/PR:N/UI:R/S:U/C:N/I:N/A:H",
"version": "3.1"
},
"format": "CVSS",
"scenarios": [
{
"lang": "en",
"value": "GENERAL"
}
]
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T08:47:23.330Z",
"orgId": "ceab7361-8a18-47b1-92ba-4d7d25f6715a",
"shortName": "GitLab"
},
"references": [
{
"url": "https://www.wireshark.org/security/wnpa-sec-2026-121.html"
}
],
"solutions": [
{
"lang": "en",
"value": "Upgrade to version 4.6.10 or above"
}
],
"title": "Inefficient Algorithmic Complexity in Wireshark"
}
},
"cveMetadata": {
"assignerOrgId": "ceab7361-8a18-47b1-92ba-4d7d25f6715a",
"assignerShortName": "GitLab",
"cveId": "CVE-2026-130459",
"datePublished": "2026-11-20T08:47:23.330Z",
"dateReserved": "2026-11-17T05:35:34.051Z",
"dateUpdated": "2026-11-20T08:47:23.330Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
CVE-2026-129307 (GCVE-0-2026-129307)
Vulnerability from cvelistv5 – Published: 2026-11-16 18:01 – Updated: 2026-11-17 22:27| URL | Tags |
|---|---|
| https://github.com/GOVCERT-LU/eml_parser/security… | x_refsource_CONFIRM |
| https://github.com/GOVCERT-LU/eml_parser/commit/5… | x_refsource_MISC |
| https://github.com/GOVCERT-LU/eml_parser/releases… | x_refsource_MISC |
| Vendor | Product | Version | |
|---|---|---|---|
| GOVCERT-LU | eml_parser |
Affected:
< 3.0.4
|
{
"containers": {
"adp": [
{
"metrics": [
{
"other": {
"content": {
"id": "CVE-2026-129307",
"options": [
{
"Exploitation": "none"
},
{
"Automatable": "yes"
},
{
"Technical Impact": "partial"
}
],
"role": "CISA Coordinator",
"timestamp": "2026-11-17T22:07:06.659930Z",
"version": "2.0.3"
},
"type": "ssvc"
}
}
],
"providerMetadata": {
"dateUpdated": "2026-11-17T22:27:19.927Z",
"orgId": "134c704f-9b21-4f2e-91b3-4a467353bcc0",
"shortName": "CISA-ADP"
},
"title": "CISA ADP Vulnrichment"
}
],
"cna": {
"affected": [
{
"product": "eml_parser",
"vendor": "GOVCERT-LU",
"versions": [
{
"status": "affected",
"version": "\u003c 3.0.4"
}
]
}
],
"descriptions": [
{
"lang": "en",
"value": "eml_parser serves as a python module for parsing eml files and returning various information found in the e-mail as well as computed information. In 3.0.3 and earlier, eml_parser.routing.parserouting() in eml_parser/routing.py builds a regular expression with multiple greedy capture groups and appends the npdate date literal extracted from a normalized copy of an attacker-controlled Received header, then searches that expression against the original unnormalized line. A formatting difference can make the trailing literal impossible to match, causing exhaustive backtracking across the greedy groups at each start position. The unsliced Received-header path is invoked by decode_email, decode_email_bytes, and parse_email, so one small unauthenticated message can pin a parser worker and create sustained queue backlog. This issue is fixed in version 3.0.4."
}
],
"metrics": [
{
"cvssV3_1": {
"attackComplexity": "LOW",
"attackVector": "NETWORK",
"availabilityImpact": "LOW",
"baseScore": 5.3,
"baseSeverity": "MEDIUM",
"confidentialityImpact": "NONE",
"integrityImpact": "NONE",
"privilegesRequired": "NONE",
"scope": "UNCHANGED",
"userInteraction": "NONE",
"vectorString": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:L",
"version": "3.1"
}
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
},
{
"descriptions": [
{
"cweId": "CWE-1333",
"description": "CWE-1333: Inefficient Regular Expression Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-16T18:03:22.018Z",
"orgId": "a0819718-46f1-4df5-94e2-005712e83aaa",
"shortName": "GitHub_M"
},
"references": [
{
"name": "https://github.com/GOVCERT-LU/eml_parser/security/advisories/GHSA-m4g8-47f9-h588",
"tags": [
"x_refsource_CONFIRM"
],
"url": "https://github.com/GOVCERT-LU/eml_parser/security/advisories/GHSA-m4g8-47f9-h588"
},
{
"name": "https://github.com/GOVCERT-LU/eml_parser/commit/54ea6e9f54fecda3059283ccdb6a6fd99e7ce92f",
"tags": [
"x_refsource_MISC"
],
"url": "https://github.com/GOVCERT-LU/eml_parser/commit/54ea6e9f54fecda3059283ccdb6a6fd99e7ce92f"
},
{
"name": "https://github.com/GOVCERT-LU/eml_parser/releases/tag/v3.0.4",
"tags": [
"x_refsource_MISC"
],
"url": "https://github.com/GOVCERT-LU/eml_parser/releases/tag/v3.0.4"
}
],
"source": {
"advisory": "GHSA-m4g8-47f9-h588",
"discovery": "UNKNOWN"
},
"title": "eml_parser: Algorithmic-complexity DoS (O(n^4) regex backtracking) in Received-header parsing"
}
},
"cveMetadata": {
"assignerOrgId": "a0819718-46f1-4df5-94e2-005712e83aaa",
"assignerShortName": "GitHub_M",
"cveId": "CVE-2026-129307",
"datePublished": "2026-11-16T18:01:59.870Z",
"dateReserved": "2026-11-13T22:30:18.285Z",
"dateUpdated": "2026-11-17T22:27:19.927Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
No mitigation information available for this CWE.
No CAPEC attack patterns related to this CWE.