<?xml version='1.0' encoding='UTF-8'?>
<?xml-stylesheet href="/static/style.xsl" type="text/xsl"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
  <id>https://cve.radiocsirt.org/rss/recent/all/10</id>
  <title>Most recent entries from all</title>
  <updated>2026-10-07T15:28:03.558768+00:00</updated>
  <author>
    <name>Vulnerability-Lookup</name>
    <email>csirt@opendfir.org</email>
  </author>
  <link href="https://cve.radiocsirt.org" rel="alternate"/>
  <generator uri="https://lkiesow.github.io/python-feedgen" version="1.0.0">python-feedgen</generator>
  <subtitle>Contains only the most 10 recent entries.</subtitle>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/euvd-2026-319061</id>
    <title>EUVD-2026-319061</title>
    <updated>2026-10-07T15:28:03.628267+00:00</updated>
    <content>EUVD-2026-319061</content>
    <link href="https://cve.radiocsirt.org/vuln/euvd-2026-319061"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/fkie_cve-2026-44368</id>
    <title>fkie_cve-2026-44368</title>
    <updated>2026-10-07T15:28:03.628313+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml">
        <p>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.</p>
      </div>
    </content>
    <link href="https://cve.radiocsirt.org/vuln/fkie_cve-2026-44368"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/ghsa-7r92-3jgr-r65q</id>
    <title>GHSA-7r92-3jgr-r65q — pyquorum: Timing side‑channel in mul_mod</title>
    <updated>2026-10-07T15:28:03.628355+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml"><p><strong>Affected:</strong> PyPI: pyquorum</p>
<p>### 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.</p>
<p>### Patches
https://github.com/svvqt/pyquorum/releases/tag/v0.2.1</p></div>
    </content>
    <link href="https://cve.radiocsirt.org/vuln/ghsa-7r92-3jgr-r65q"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/pysec-2026-3028</id>
    <title>PYSEC-2026-3028 — pyquorum: Timing side‑channel in mul_mod</title>
    <updated>2026-10-07T15:28:03.628385+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml"><p><strong>Affected:</strong> PyPI: pyquorum</p>
<p>### 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.</p>
<p>### Patches
https://github.com/svvqt/pyquorum/releases/tag/v0.2.1</p></div>
    </content>
    <link href="https://cve.radiocsirt.org/vuln/pysec-2026-3028"/>
  </entry>
</feed>
