Goal Reached Thanks to every supporter — we hit 100%!

Goal: 1000 CNY · Raised: 1359 CNY

100%

CVE-2025-62492— Heap out-of-bounds read in js_typed_array_indexOf in QuickJS

Quick assessment

Affected
QuickJS QuickJS
Exploitation
No confirmed in-the-wild exploitation; assess based on exposure
Recommended action
Check the vendor advisory and references for a fixed version. If immediate upgrade is impossible, restrict exposure and increase monitoring.

QuickJS是QuickJS开源的一个小型且可嵌入的 Javascript 引擎。 QuickJS存在安全漏洞,该漏洞源于TypedArray.prototype.indexOf函数在处理负fromIndex参数时存在浮点运算精度错误,可能导致越界读取和信息泄露。

AI Predicted 6.5 Difficulty: Moderate EPSS 0.39% · P31

Possible ATT&CK Techniques 1 AI

T1530 · Data from Cloud Storage
Get alerts for future matching vulnerabilities Log in to subscribe

I. Basic Information for CVE-2025-62492

Vulnerability Information

Have questions about the vulnerability? See if Shenlong's analysis helps!
View Shenlong Deep Dive ↗

Although we use advanced large model technology, its output may still contain inaccurate or outdated information.Shenlong tries to ensure data accuracy, but please verify and judge based on the actual situation.

Vulnerability Title
Heap out-of-bounds read in js_typed_array_indexOf in QuickJS
Source: CVE Program / CVE List V5
Vulnerability Description
A vulnerability stemming from floating-point arithmetic precision errors exists in the QuickJS engine's implementation of TypedArray.prototype.indexOf() when a negative fromIndex argument is supplied. * The fromIndex argument (read as a double variable, $d$) is used to calculate the starting position for the search. * If d is negative, the index is calculated relative to the end of the array by adding the array's length (len) to d: $$d_{new} = d + \text{len}$$ * Due to the inherent limitations of floating-point arithmetic, if the negative value $d$ is extremely small (e.g., $-1 \times 10^{-20}$), the addition $d + \text{len}$ can result in a loss of precision, yielding an outcome that is exactly equal to $\text{len}$. * The result is then converted to an integer index $k$: $k = \text{len}$. * The search function proceeds to read array elements starting from index $k$. Since valid indices are $0$ to $\text{len}-1$, starting the read at index $\text{len}$ is one element past the end of the array. This allows an attacker to cause an Out-of-Bounds Read of one element immediately following the buffer. While the scope of this read is small (one element), it can potentially lead to Information Disclosure of adjacent memory contents, depending on the execution environment.
Source: CVE Program / CVE List V5
CVSS Information
CVSS:4.0/AV:A/AC:H/AT:P/PR:L/UI:P/VC:H/VI:L/VA:L/SC:H/SI:L/SA:L
Source: CVE Program / CVE List V5
Vulnerability Type
跨界内存读
Source: CVE Program / CVE List V5
Vulnerability Title
QuickJS 安全漏洞
Source: CNNVD (China National Vulnerability Database)
Vulnerability Description
QuickJS是QuickJS开源的一个小型且可嵌入的 Javascript 引擎。 QuickJS存在安全漏洞,该漏洞源于TypedArray.prototype.indexOf函数在处理负fromIndex参数时存在浮点运算精度错误,可能导致越界读取和信息泄露。
Source: CNNVD (China National Vulnerability Database)
CVSS Information
N/A
Source: CNNVD (China National Vulnerability Database)
Vulnerability Type
N/A
Source: CNNVD (China National Vulnerability Database)

Affected Products

Vendor Product Affected Versions CPE Subscribe
QuickJS QuickJS 2025-04-26 ~ 2025-09-13 -

II. Public POCs for CVE-2025-62492

# POC Description Source Link Shenlong Link
AI-Generated POC Premium

No public POC found.

Login to generate AI POC

III. Intelligence Information for CVE-2025-62492

请登录查看更多情报信息。

Same Patch Batch · QuickJS · 2025-10-16 · 7 CVEs total

CVE-2025-62493 Heap out-of-bounds read in js_bigint_to_string1 in QuickJS
CVE-2025-62494 Type confusion in string addition in QuickJS
CVE-2025-62495 Type confusion in string addition in QuickJS
CVE-2025-62491 Use-after-free in js_std_promise_rejection_check in QuickJS
CVE-2025-62490 Use-after-free in js_print_object in QuickJS
CVE-2025-62496 Integer overflow in js_bigint_from_string in QuickJS

IV. Related Vulnerabilities

V. Comments for CVE-2025-62492

No comments yet


Leave a comment