<?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>Sat, 10 Oct 2026 17:22:19 +0000</lastBuildDate>
    <item>
      <title>EUVD-2026-362201</title>
      <link>https://cve.radiocsirt.org/vuln/euvd-2026-362201</link>
      <description>EUVD-2026-362201</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/euvd-2026-362201</guid>
    </item>
    <item>
      <title>fkie_cve-2026-19873</title>
      <link>https://cve.radiocsirt.org/vuln/fkie_cve-2026-19873</link>
      <description>&lt;p&gt;HTML::FormFu versions through 2.08 for Perl allow resource exhaustion via an unbounded repeat count from the query string in Repeatable elements.&lt;/p&gt;
&lt;p&gt;When a Repeatable element has counter_name set, its process method reads the repeat count from the named query string parameter, checks only that it is a positive integer, and passes it to repeat, which deep-clones the element&amp;#39;s child subtree once per iteration. Nothing caps the value, and no attribute lets an application impose a limit.&lt;/p&gt;
&lt;p&gt;The count is read on every request, before the form decides whether it was submitted, so a plain GET reaches the clone loop with no credentials, no session and no request body. Nesting multiplies: a Repeatable inside a Repeatable takes a counter at each level, so an outer and an inner value of 100 build 10,000 clones.&lt;/p&gt;
&lt;p&gt;Once the form is submitted, each cloned field&amp;#39;s constraints scan the whole element tree in _find_field_value, so cost grows faster than linearly with the count. A single request exhausts memory and CPU.&lt;/p&gt;
&lt;p&gt;The latest release on CPAN is 2.07, from 2018. Version 2.08 exists only in the git repository.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;HTML::FormFu versions through 2.08 for Perl allow resource exhaustion via an unbounded repeat count from the query string in Repeatable elements.&lt;/p&gt;
&lt;p&gt;When a Repeatable element has counter_name set, its process method reads the repeat count from the named query string parameter, checks only that it is a positive integer, and passes it to repeat, which deep-clones the element&amp;#39;s child subtree once per iteration. Nothing caps the value, and no attribute lets an application impose a limit.&lt;/p&gt;
&lt;p&gt;The count is read on every request, before the form decides whether it was submitted, so a plain GET reaches the clone loop with no credentials, no session and no request body. Nesting multiplies: a Repeatable inside a Repeatable takes a counter at each level, so an outer and an inner value of 100 build 10,000 clones.&lt;/p&gt;
&lt;p&gt;Once the form is submitted, each cloned field&amp;#39;s constraints scan the whole element tree in _find_field_value, so cost grows faster than linearly with the count. A single request exhausts memory and CPU.&lt;/p&gt;
&lt;p&gt;The latest release on CPAN is 2.07, from 2018. Version 2.08 exists only in the git repository.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/fkie_cve-2026-19873</guid>
    </item>
    <item>
      <title>GHSA-8cjx-f34x-86x3</title>
      <link>https://cve.radiocsirt.org/vuln/ghsa-8cjx-f34x-86x3</link>
      <description>&lt;p&gt;HTML::FormFu versions through 2.08 for Perl allow resource exhaustion via an unbounded repeat count from the query string in Repeatable elements.&lt;/p&gt;
&lt;p&gt;When a Repeatable element has counter_name set, its process method reads the repeat count from the named query string parameter, checks only that it is a positive integer, and passes it to repeat, which deep-clones the element&amp;#39;s child subtree once per iteration. Nothing caps the value, and no attribute lets an application impose a limit.&lt;/p&gt;
&lt;p&gt;The count is read on every request, before the form decides whether it was submitted, so a plain GET reaches the clone loop with no credentials, no session and no request body. Nesting multiplies: a Repeatable inside a Repeatable takes a counter at each level, so an outer and an inner value of 100 build 10,000 clones.&lt;/p&gt;
&lt;p&gt;Once the form is submitted, each cloned field&amp;#39;s constraints scan the whole element tree in _find_field_value, so cost grows faster than linearly with the count. A single request exhausts memory and CPU.&lt;/p&gt;
&lt;p&gt;The latest release on CPAN is 2.07, from 2018. Version 2.08 exists only in the git repository.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;HTML::FormFu versions through 2.08 for Perl allow resource exhaustion via an unbounded repeat count from the query string in Repeatable elements.&lt;/p&gt;
&lt;p&gt;When a Repeatable element has counter_name set, its process method reads the repeat count from the named query string parameter, checks only that it is a positive integer, and passes it to repeat, which deep-clones the element&amp;#39;s child subtree once per iteration. Nothing caps the value, and no attribute lets an application impose a limit.&lt;/p&gt;
&lt;p&gt;The count is read on every request, before the form decides whether it was submitted, so a plain GET reaches the clone loop with no credentials, no session and no request body. Nesting multiplies: a Repeatable inside a Repeatable takes a counter at each level, so an outer and an inner value of 100 build 10,000 clones.&lt;/p&gt;
&lt;p&gt;Once the form is submitted, each cloned field&amp;#39;s constraints scan the whole element tree in _find_field_value, so cost grows faster than linearly with the count. A single request exhausts memory and CPU.&lt;/p&gt;
&lt;p&gt;The latest release on CPAN is 2.07, from 2018. Version 2.08 exists only in the git repository.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ghsa-8cjx-f34x-86x3</guid>
    </item>
    <item>
      <title>UBUNTU-CVE-2026-19873</title>
      <link>https://cve.radiocsirt.org/vuln/ubuntu-cve-2026-19873</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:16.04:LTS: libhtml-formfu-perl, Ubuntu:18.04:LTS: libhtml-formfu-perl, Ubuntu:20.04:LTS: libhtml-formfu-perl, Ubuntu:22.04:LTS: libhtml-formfu-perl, Ubuntu:24.04:LTS: libhtml-formfu-perl, Ubuntu:26.04:LTS: libhtml-formfu-perl&lt;/p&gt;
&lt;p&gt;HTML::FormFu versions through 2.08 for Perl allow resource exhaustion via an unbounded repeat count from the query string in Repeatable elements. When a Repeatable element has counter_name set, its process method reads the repeat count from the named query string parameter, checks only that it is a positive integer, and passes it to repeat, which deep-clones the element&amp;#39;s child subtree once per iteration. Nothing caps the value, and no attribute lets an application impose a limit. The count is read on every request, before the form decides whether it was submitted, so a plain GET reaches the clone loop with no credentials, no session and no request body. Nesting multiplies: a Repeatable inside a Repeatable takes a counter at each level, so an outer and an inner value of 100 build 10,000 clones. Once the form is submitted, each cloned field&amp;#39;s constraints scan the whole element tree in _find_field_value, so cost grows faster than linearly with the count. A single request exhausts memory and CPU. The latest release on CPAN is 2.07, from 2018. Version 2.08 exists only in the git repository.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:16.04:LTS: libhtml-formfu-perl, Ubuntu:18.04:LTS: libhtml-formfu-perl, Ubuntu:20.04:LTS: libhtml-formfu-perl, Ubuntu:22.04:LTS: libhtml-formfu-perl, Ubuntu:24.04:LTS: libhtml-formfu-perl, Ubuntu:26.04:LTS: libhtml-formfu-perl&lt;/p&gt;
&lt;p&gt;HTML::FormFu versions through 2.08 for Perl allow resource exhaustion via an unbounded repeat count from the query string in Repeatable elements. When a Repeatable element has counter_name set, its process method reads the repeat count from the named query string parameter, checks only that it is a positive integer, and passes it to repeat, which deep-clones the element&amp;#39;s child subtree once per iteration. Nothing caps the value, and no attribute lets an application impose a limit. The count is read on every request, before the form decides whether it was submitted, so a plain GET reaches the clone loop with no credentials, no session and no request body. Nesting multiplies: a Repeatable inside a Repeatable takes a counter at each level, so an outer and an inner value of 100 build 10,000 clones. Once the form is submitted, each cloned field&amp;#39;s constraints scan the whole element tree in _find_field_value, so cost grows faster than linearly with the count. A single request exhausts memory and CPU. The latest release on CPAN is 2.07, from 2018. Version 2.08 exists only in the git repository.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ubuntu-cve-2026-19873</guid>
    </item>
  </channel>
</rss>
