CVE-2025-46560

vLLM phi4mm: Quadratic Time Complexity in Input Token Processing​ leads to denial of service

State
Published
Severity
6.5 Medium
Published
Apr 30, 2025
Updated
Apr 30, 2025
Reserved
Apr 24, 2025

Read the record on cve.org

Description

vLLM is a high-throughput and memory-efficient inference and serving engine for LLMs. Versions starting from 0.8.0 and prior to 0.8.5 are affected by a critical performance vulnerability in the input preprocessing logic of the multimodal tokenizer. The code dynamically replaces placeholder tokens (e.g., <|audio_|>, <|image_|>) with repeated tokens based on precomputed lengths. Due to ​​inefficient list concatenation operations​​, the algorithm exhibits ​​quadratic time complexity (O(n²))​​, allowing malicious actors to trigger resource exhaustion via specially crafted inputs. This issue has been patched in version 0.8.5.

Scores

CVSSScoreVectorSource
3.16.5 MediumCVSS:3.1/AV:N/AC:L/PR:L/UI:N/S:U/C:N/I:N/A:HGitHub_M

Weaknesses

  • CWE-1333 Inefficient Regular Expression Complexity

Affected Products

ProductVersions
vllmvllm-project
  • >= 0.8.0, < 0.8.5Affected

References

Every record here comes from the CVE Program’s CVE List. © 1999–2026 The MITRE Corporation. CVE is a registered trademark of The MITRE Corporation. The records are reproduced under the CVE Program terms of use.