<?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://vulnerability.circl.lu</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>Sun, 04 Oct 2026 23:11:46 +0000</lastBuildDate>
    <item>
      <title>CVE-2023-6237 — Excessive time spent checking invalid RSA public keys</title>
      <link>https://vulnerability.circl.lu/vuln/cve-2023-6237</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; OpenSSL, Siemens SIMATIC S7-1500 TM MFP - GNU/Linux subsystem, Siemens SINEC NMS&lt;/p&gt;
&lt;p&gt;Issue summary: Checking excessively long invalid RSA public keys may take
a long time.&lt;/p&gt;
&lt;p&gt;Impact summary: Applications that use the function EVP_PKEY_public_check()
to check RSA public keys may experience long delays. Where the key that
is being checked has been obtained from an untrusted source this may lead
to a Denial of Service.&lt;/p&gt;
&lt;p&gt;When function EVP_PKEY_public_check() is called on RSA public keys,
a computation is done to confirm that the RSA modulus, n, is composite.
For valid RSA keys, n is a product of two or more large primes and this
computation completes quickly. However, if n is an overly large prime,
then this computation would take a long time.&lt;/p&gt;
&lt;p&gt;An application that calls EVP_PKEY_public_check() and supplies an RSA key
obtained from an untrusted source could be vulnerable to a Denial of Service
attack.&lt;/p&gt;
&lt;p&gt;The function EVP_PKEY_public_check() is not called from other OpenSSL
functions however it is called from the OpenSSL pkey command line
application. For that reason that application is also vulnerable if used
with the &amp;#39;-pubin&amp;#39; and &amp;#39;-check&amp;#39; options on untrusted data.&lt;/p&gt;
&lt;p&gt;The OpenSSL SSL/TLS implementation is not affected by this issue.&lt;/p&gt;
&lt;p&gt;The OpenSSL 3.0 and 3.1 FIPS providers are affected by this issue.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; OpenSSL, Siemens SIMATIC S7-1500 TM MFP - GNU/Linux subsystem, Siemens SINEC NMS&lt;/p&gt;
&lt;p&gt;Issue summary: Checking excessively long invalid RSA public keys may take
a long time.&lt;/p&gt;
&lt;p&gt;Impact summary: Applications that use the function EVP_PKEY_public_check()
to check RSA public keys may experience long delays. Where the key that
is being checked has been obtained from an untrusted source this may lead
to a Denial of Service.&lt;/p&gt;
&lt;p&gt;When function EVP_PKEY_public_check() is called on RSA public keys,
a computation is done to confirm that the RSA modulus, n, is composite.
For valid RSA keys, n is a product of two or more large primes and this
computation completes quickly. However, if n is an overly large prime,
then this computation would take a long time.&lt;/p&gt;
&lt;p&gt;An application that calls EVP_PKEY_public_check() and supplies an RSA key
obtained from an untrusted source could be vulnerable to a Denial of Service
attack.&lt;/p&gt;
&lt;p&gt;The function EVP_PKEY_public_check() is not called from other OpenSSL
functions however it is called from the OpenSSL pkey command line
application. For that reason that application is also vulnerable if used
with the &amp;#39;-pubin&amp;#39; and &amp;#39;-check&amp;#39; options on untrusted data.&lt;/p&gt;
&lt;p&gt;The OpenSSL SSL/TLS implementation is not affected by this issue.&lt;/p&gt;
&lt;p&gt;The OpenSSL 3.0 and 3.1 FIPS providers are affected by this issue.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/cve-2023-6237</guid>
    </item>
  </channel>
</rss>
