<?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>Tue, 06 Oct 2026 20:56:02 +0000</lastBuildDate>
    <item>
      <title>Withdrawn: BELL-CVE-2026-74751 — CVE-2026-74751 does not affect BellSoft software</title>
      <link>https://cve.radiocsirt.org/vuln/bell-cve-2026-74751</link>
      <description>&lt;p&gt;&lt;strong&gt;Withdrawn by the publisher.&lt;/strong&gt;&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Withdrawn by the publisher.&lt;/strong&gt;&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/bell-cve-2026-74751</guid>
    </item>
    <item>
      <title>EUVD-2026-359776</title>
      <link>https://cve.radiocsirt.org/vuln/euvd-2026-359776</link>
      <description>EUVD-2026-359776</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/euvd-2026-359776</guid>
    </item>
    <item>
      <title>fkie_cve-2026-74751</title>
      <link>https://cve.radiocsirt.org/vuln/fkie_cve-2026-74751</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;riscv: lib: Fix ZBB strnlen reading past count boundary&lt;/p&gt;
&lt;p&gt;The ZBB-optimized strnlen loop loads one word ahead before checking the
aligned boundary:&lt;/p&gt;
&lt;p&gt;REG_L   t1, SZREG(t0)       // load next word
    addi    t0, t0, SZREG       // advance
    orc.b   t1, t1
    bgeu    t0, t4, 4f          // boundary check AFTER load&lt;/p&gt;
&lt;p&gt;where t4 = (s + count) &amp;amp; -SZREG.  When s is aligned and count is a
multiple of SZREG, t4 equals s + count and the loop loads a full word
starting at exactly s + count.  If s + count falls on a page boundary
with the next page unmapped, this faults.&lt;/p&gt;
&lt;p&gt;Fix by computing the aligned boundary from the last valid byte
(s + count - 1) instead of s + count.  This makes the loop stop at the
word containing the last valid byte rather than potentially loading the
word after it.  The count == 0 case is already handled by the beqz
early exit.&lt;/p&gt;
&lt;p&gt;Also add a pre-loop guard (bgeu t0, t4) for the case where all valid
bytes fit within the first word.  With the adjusted boundary, t4 can
equal t0, and entering the loop with stale register state from the
first-word processing would produce incorrect results.&lt;/p&gt;
&lt;p&gt;The final minu clamp ensures the result is still correct when the last
loaded word extends past s + count - 1 within the same aligned word.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;riscv: lib: Fix ZBB strnlen reading past count boundary&lt;/p&gt;
&lt;p&gt;The ZBB-optimized strnlen loop loads one word ahead before checking the
aligned boundary:&lt;/p&gt;
&lt;p&gt;REG_L   t1, SZREG(t0)       // load next word
    addi    t0, t0, SZREG       // advance
    orc.b   t1, t1
    bgeu    t0, t4, 4f          // boundary check AFTER load&lt;/p&gt;
&lt;p&gt;where t4 = (s + count) &amp;amp; -SZREG.  When s is aligned and count is a
multiple of SZREG, t4 equals s + count and the loop loads a full word
starting at exactly s + count.  If s + count falls on a page boundary
with the next page unmapped, this faults.&lt;/p&gt;
&lt;p&gt;Fix by computing the aligned boundary from the last valid byte
(s + count - 1) instead of s + count.  This makes the loop stop at the
word containing the last valid byte rather than potentially loading the
word after it.  The count == 0 case is already handled by the beqz
early exit.&lt;/p&gt;
&lt;p&gt;Also add a pre-loop guard (bgeu t0, t4) for the case where all valid
bytes fit within the first word.  With the adjusted boundary, t4 can
equal t0, and entering the loop with stale register state from the
first-word processing would produce incorrect results.&lt;/p&gt;
&lt;p&gt;The final minu clamp ensures the result is still correct when the last
loaded word extends past s + count - 1 within the same aligned word.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/fkie_cve-2026-74751</guid>
    </item>
    <item>
      <title>GHSA-ghc8-jmvh-q86v</title>
      <link>https://cve.radiocsirt.org/vuln/ghsa-ghc8-jmvh-q86v</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;riscv: lib: Fix ZBB strnlen reading past count boundary&lt;/p&gt;
&lt;p&gt;The ZBB-optimized strnlen loop loads one word ahead before checking the
aligned boundary:&lt;/p&gt;
&lt;p&gt;REG_L   t1, SZREG(t0)       // load next word
    addi    t0, t0, SZREG       // advance
    orc.b   t1, t1
    bgeu    t0, t4, 4f          // boundary check AFTER load&lt;/p&gt;
&lt;p&gt;where t4 = (s + count) &amp;amp; -SZREG.  When s is aligned and count is a
multiple of SZREG, t4 equals s + count and the loop loads a full word
starting at exactly s + count.  If s + count falls on a page boundary
with the next page unmapped, this faults.&lt;/p&gt;
&lt;p&gt;Fix by computing the aligned boundary from the last valid byte
(s + count - 1) instead of s + count.  This makes the loop stop at the
word containing the last valid byte rather than potentially loading the
word after it.  The count == 0 case is already handled by the beqz
early exit.&lt;/p&gt;
&lt;p&gt;Also add a pre-loop guard (bgeu t0, t4) for the case where all valid
bytes fit within the first word.  With the adjusted boundary, t4 can
equal t0, and entering the loop with stale register state from the
first-word processing would produce incorrect results.&lt;/p&gt;
&lt;p&gt;The final minu clamp ensures the result is still correct when the last
loaded word extends past s + count - 1 within the same aligned word.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;riscv: lib: Fix ZBB strnlen reading past count boundary&lt;/p&gt;
&lt;p&gt;The ZBB-optimized strnlen loop loads one word ahead before checking the
aligned boundary:&lt;/p&gt;
&lt;p&gt;REG_L   t1, SZREG(t0)       // load next word
    addi    t0, t0, SZREG       // advance
    orc.b   t1, t1
    bgeu    t0, t4, 4f          // boundary check AFTER load&lt;/p&gt;
&lt;p&gt;where t4 = (s + count) &amp;amp; -SZREG.  When s is aligned and count is a
multiple of SZREG, t4 equals s + count and the loop loads a full word
starting at exactly s + count.  If s + count falls on a page boundary
with the next page unmapped, this faults.&lt;/p&gt;
&lt;p&gt;Fix by computing the aligned boundary from the last valid byte
(s + count - 1) instead of s + count.  This makes the loop stop at the
word containing the last valid byte rather than potentially loading the
word after it.  The count == 0 case is already handled by the beqz
early exit.&lt;/p&gt;
&lt;p&gt;Also add a pre-loop guard (bgeu t0, t4) for the case where all valid
bytes fit within the first word.  With the adjusted boundary, t4 can
equal t0, and entering the loop with stale register state from the
first-word processing would produce incorrect results.&lt;/p&gt;
&lt;p&gt;The final minu clamp ensures the result is still correct when the last
loaded word extends past s + count - 1 within the same aligned word.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ghsa-ghc8-jmvh-q86v</guid>
    </item>
    <item>
      <title>UBUNTU-CVE-2026-74751</title>
      <link>https://cve.radiocsirt.org/vuln/ubuntu-cve-2026-74751</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:16.04:LTS: linux-hwe-edge, Ubuntu:18.04:LTS: linux-aws-5.0, Ubuntu:18.04:LTS: linux-aws-5.3, Ubuntu:18.04:LTS: linux-azure, Ubuntu:18.04:LTS: linux-azure-5.3, Ubuntu:18.04:LTS: linux-azure-edge, Ubuntu:18.04:LTS: linux-gcp, Ubuntu:18.04:LTS: linux-gcp-5.3, Ubuntu:18.04:LTS: linux-gke-4.15, Ubuntu:18.04:LTS: linux-gke-5.4 and 95 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: riscv: lib: Fix ZBB strnlen reading past count boundary The ZBB-optimized strnlen loop loads one word ahead before checking the aligned boundary:     REG_L   t1, SZREG(t0)       // load next word     addi    t0, t0, SZREG       // advance     orc.b   t1, t1     bgeu    t0, t4, 4f          // boundary check AFTER load where t4 = (s + count) &amp;amp; -SZREG.  When s is aligned and count is a multiple of SZREG, t4 equals s + count and the loop loads a full word starting at exactly s + count.  If s + count falls on a page boundary with the next page unmapped, this faults. Fix by computing the aligned boundary from the last valid byte (s + count - 1) instead of s + count.  This makes the loop stop at the word containing the last valid byte rather than potentially loading the word after it.  The count == 0 case is already handled by the beqz early exit. Also add a pre-loop guard (bgeu t0, t4) for the case where all valid bytes fit within the first word.  With the adjusted boundary, t4 can equal t0, and entering the loop with stale register state from the first-word processing would produce incorrect results. The final minu clamp ensures the result is still correct when the last loaded word extends past s + count - 1 within the same aligned word.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:16.04:LTS: linux-hwe-edge, Ubuntu:18.04:LTS: linux-aws-5.0, Ubuntu:18.04:LTS: linux-aws-5.3, Ubuntu:18.04:LTS: linux-azure, Ubuntu:18.04:LTS: linux-azure-5.3, Ubuntu:18.04:LTS: linux-azure-edge, Ubuntu:18.04:LTS: linux-gcp, Ubuntu:18.04:LTS: linux-gcp-5.3, Ubuntu:18.04:LTS: linux-gke-4.15, Ubuntu:18.04:LTS: linux-gke-5.4 and 95 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: riscv: lib: Fix ZBB strnlen reading past count boundary The ZBB-optimized strnlen loop loads one word ahead before checking the aligned boundary:     REG_L   t1, SZREG(t0)       // load next word     addi    t0, t0, SZREG       // advance     orc.b   t1, t1     bgeu    t0, t4, 4f          // boundary check AFTER load where t4 = (s + count) &amp;amp; -SZREG.  When s is aligned and count is a multiple of SZREG, t4 equals s + count and the loop loads a full word starting at exactly s + count.  If s + count falls on a page boundary with the next page unmapped, this faults. Fix by computing the aligned boundary from the last valid byte (s + count - 1) instead of s + count.  This makes the loop stop at the word containing the last valid byte rather than potentially loading the word after it.  The count == 0 case is already handled by the beqz early exit. Also add a pre-loop guard (bgeu t0, t4) for the case where all valid bytes fit within the first word.  With the adjusted boundary, t4 can equal t0, and entering the loop with stale register state from the first-word processing would produce incorrect results. The final minu clamp ensures the result is still correct when the last loaded word extends past s + count - 1 within the same aligned word.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ubuntu-cve-2026-74751</guid>
    </item>
    <item>
      <title>WID-SEC-W-2026-3042 — Linux Kernel: Mehrere Schwachstellen</title>
      <link>https://cve.radiocsirt.org/vuln/wid-sec-w-2026-3042</link>
      <description>&lt;p&gt;Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um einen nicht näher spezifizierten Angriff durchzuführen, darunter möglicherweise die Ausführung von beliebigem Code, die Ausweitung von Berechtigungen, die Offenlegung von Informationen, die Manipulation von Daten oder Denial-of-Service-Zustände.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um einen nicht näher spezifizierten Angriff durchzuführen, darunter möglicherweise die Ausführung von beliebigem Code, die Ausweitung von Berechtigungen, die Offenlegung von Informationen, die Manipulation von Daten oder Denial-of-Service-Zustände.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/wid-sec-w-2026-3042</guid>
    </item>
  </channel>
</rss>
