<?xml version='1.0' encoding='UTF-8'?>
<?xml-stylesheet href="/static/style.xsl" type="text/xsl"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/" version="2.0">
  <channel>
    <title>Most recent entries from all</title>
    <link>https://cve.radiocsirt.org</link>
    <description>Contains only the most 10 recent entries.</description>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <generator>python-feedgen</generator>
    <language>en</language>
    <lastBuildDate>Wed, 07 Oct 2026 12:50:51 +0000</lastBuildDate>
    <item>
      <title>CVE-2025-62496 — Integer overflow in js_bigint_from_string in QuickJS</title>
      <link>https://cve.radiocsirt.org/vuln/cve-2025-62496</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; QuickJS&lt;/p&gt;
&lt;p&gt;A vulnerability exists in the QuickJS engine&amp;#39;s BigInt string parsing logic (js_bigint_from_string) when attempting to create a BigInt from a string with an excessively large number of digits.&lt;/p&gt;
&lt;p&gt;The function calculates the necessary number of bits (n_bits) required to store the BigInt using the formula:&lt;/p&gt;
&lt;p&gt;$$\text{n\_bits} = (\text{n\_digits} \times 27 + 7) / 8 \quad (\text{for radix 10})$$&lt;/p&gt;
&lt;p&gt;*  For large input strings (e.g., $79,536,432$ digits or more for base 10), the intermediate calculation $(\text{n\_digits} \times 27 + 7)$ exceeds the maximum value of a standard signed 32-bit integer, resulting in an Integer Overflow.&lt;/p&gt;
&lt;p&gt;*  The resulting n_bits value becomes unexpectedly small or even negative due to this wrap-around.&lt;/p&gt;
&lt;p&gt;*  This flawed n_bits is then used to compute n_limbs, the number of memory &amp;#34;limbs&amp;#34; needed for the BigInt object. Since n_bits is too small, the calculated n_limbs is also significantly underestimated.&lt;/p&gt;
&lt;p&gt;*  The function proceeds to allocate a JSBigInt object using this underestimated n_limbs.&lt;/p&gt;
&lt;p&gt;*  When the function later attempts to write the actual BigInt data into the allocated object, the small buffer size is quickly exceeded, leading to a Heap Out-of-Bounds Write as data is written past the end of the allocated r-&amp;gt;tab array.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; QuickJS&lt;/p&gt;
&lt;p&gt;A vulnerability exists in the QuickJS engine&amp;#39;s BigInt string parsing logic (js_bigint_from_string) when attempting to create a BigInt from a string with an excessively large number of digits.&lt;/p&gt;
&lt;p&gt;The function calculates the necessary number of bits (n_bits) required to store the BigInt using the formula:&lt;/p&gt;
&lt;p&gt;$$\text{n\_bits} = (\text{n\_digits} \times 27 + 7) / 8 \quad (\text{for radix 10})$$&lt;/p&gt;
&lt;p&gt;*  For large input strings (e.g., $79,536,432$ digits or more for base 10), the intermediate calculation $(\text{n\_digits} \times 27 + 7)$ exceeds the maximum value of a standard signed 32-bit integer, resulting in an Integer Overflow.&lt;/p&gt;
&lt;p&gt;*  The resulting n_bits value becomes unexpectedly small or even negative due to this wrap-around.&lt;/p&gt;
&lt;p&gt;*  This flawed n_bits is then used to compute n_limbs, the number of memory &amp;#34;limbs&amp;#34; needed for the BigInt object. Since n_bits is too small, the calculated n_limbs is also significantly underestimated.&lt;/p&gt;
&lt;p&gt;*  The function proceeds to allocate a JSBigInt object using this underestimated n_limbs.&lt;/p&gt;
&lt;p&gt;*  When the function later attempts to write the actual BigInt data into the allocated object, the small buffer size is quickly exceeded, leading to a Heap Out-of-Bounds Write as data is written past the end of the allocated r-&amp;gt;tab array.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/cve-2025-62496</guid>
    </item>
  </channel>
</rss>
