<?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 13:36:25 +0000</lastBuildDate>
    <item>
      <title>EUVD-2026-319061</title>
      <link>https://cve.radiocsirt.org/vuln/euvd-2026-319061</link>
      <description>EUVD-2026-319061</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/euvd-2026-319061</guid>
    </item>
    <item>
      <title>fkie_cve-2026-44368</title>
      <link>https://cve.radiocsirt.org/vuln/fkie_cve-2026-44368</link>
      <description>&lt;p&gt;PyQuorum is a cryptographic library for secret sharing and key management. Prior to 0.2.1, the mul_mod function implements multiplication via a binary expansion loop whose execution time depends on the Hamming weight of the second operand (the exponent). An attacker who can measure the time of secret‑sharing operations (e.g., via a remote service) could progressively recover the values of shares, ultimately leading to secret reconstruction. This vulnerability is fixed in 0.2.1.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;PyQuorum is a cryptographic library for secret sharing and key management. Prior to 0.2.1, the mul_mod function implements multiplication via a binary expansion loop whose execution time depends on the Hamming weight of the second operand (the exponent). An attacker who can measure the time of secret‑sharing operations (e.g., via a remote service) could progressively recover the values of shares, ultimately leading to secret reconstruction. This vulnerability is fixed in 0.2.1.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/fkie_cve-2026-44368</guid>
    </item>
    <item>
      <title>GHSA-7r92-3jgr-r65q — pyquorum: Timing side‑channel in mul_mod</title>
      <link>https://cve.radiocsirt.org/vuln/ghsa-7r92-3jgr-r65q</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; PyPI: pyquorum&lt;/p&gt;
&lt;p&gt;### Impact
The `mul_mod` function implements multiplication via a binary expansion loop whose execution time depends on the Hamming weight of the second operand (the exponent). An attacker who can measure the time of secret‑sharing operations (e.g., via a remote service) could progressively recover the values of shares, ultimately leading to secret reconstruction.&lt;/p&gt;
&lt;p&gt;### Patches
https://github.com/svvqt/pyquorum/releases/tag/v0.2.1&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; PyPI: pyquorum&lt;/p&gt;
&lt;p&gt;### Impact
The `mul_mod` function implements multiplication via a binary expansion loop whose execution time depends on the Hamming weight of the second operand (the exponent). An attacker who can measure the time of secret‑sharing operations (e.g., via a remote service) could progressively recover the values of shares, ultimately leading to secret reconstruction.&lt;/p&gt;
&lt;p&gt;### Patches
https://github.com/svvqt/pyquorum/releases/tag/v0.2.1&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ghsa-7r92-3jgr-r65q</guid>
    </item>
    <item>
      <title>PYSEC-2026-3028 — pyquorum: Timing side‑channel in mul_mod</title>
      <link>https://cve.radiocsirt.org/vuln/pysec-2026-3028</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; PyPI: pyquorum&lt;/p&gt;
&lt;p&gt;### Impact
The `mul_mod` function implements multiplication via a binary expansion loop whose execution time depends on the Hamming weight of the second operand (the exponent). An attacker who can measure the time of secret‑sharing operations (e.g., via a remote service) could progressively recover the values of shares, ultimately leading to secret reconstruction.&lt;/p&gt;
&lt;p&gt;### Patches
https://github.com/svvqt/pyquorum/releases/tag/v0.2.1&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; PyPI: pyquorum&lt;/p&gt;
&lt;p&gt;### Impact
The `mul_mod` function implements multiplication via a binary expansion loop whose execution time depends on the Hamming weight of the second operand (the exponent). An attacker who can measure the time of secret‑sharing operations (e.g., via a remote service) could progressively recover the values of shares, ultimately leading to secret reconstruction.&lt;/p&gt;
&lt;p&gt;### Patches
https://github.com/svvqt/pyquorum/releases/tag/v0.2.1&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/pysec-2026-3028</guid>
    </item>
  </channel>
</rss>
