CyberSecBulletin
CVE-2025-3200NVD status: Deferred

Com-Server++: Use of a Broken or Risky Cryptographic Algorithm

CVE-2025-3200 is a critical-severity use of a broken or risky cryptographic algorithm vulnerability in Com-Server++ from Wiesemann & Theis, with a CVSS 3.1 base score of 9.1 out of 10. It can be exploited remotely over the network by an unauthenticated attacker, without any action from a user. The record lists version 1.60 as the first without the flaw, so updating Com-Server++ to that release or later removes the exposure. There is no confirmed exploitation so far. EPSS estimates a 0.36% chance of exploitation within 30 days, which is low compared with other CVEs.

Patch this week

Critical severity: a successful attack would have severe impact.

What to do

  1. Update Com-Server++ to 1.60 or a later version.
  2. Update Com-Server PoE 3x Isolated to 1.60 or a later version.
  3. Update Com-Server 20mA to 1.60 or a later version.
  4. Until you can update, restrict network access to the affected service so it is not reachable from untrusted networks.

Affected products and versions

VendorProductAffected versionsFixed in
Wiesemann & TheisCom-Server++before 1.601.60
Wiesemann & TheisCom-Server PoE 3x Isolatedbefore 1.601.60
Wiesemann & TheisCom-Server 20mAbefore 1.601.60
Wiesemann & TheisCom-Server OEMbefore 1.601.60
Wiesemann & TheisCom-Server ULbefore 1.601.60

Version data comes from the organisation that assigned the CVE. Confirm against the vendor advisory before deciding you are unaffected.

How the severity score breaks down

Attack vector
NetworkCan be exploited remotely over a network, including the internet.
Attack complexity
LowNo special conditions are needed; the attack works reliably.
Privileges required
NoneNo account or login is needed.
User interaction
NoneNo action by a victim is required.
Scope
UnchangedImpact stays within the vulnerable component.
Confidentiality
HighAll data handled by the component can be read.
Integrity
HighData or code can be modified at will.
Availability
NoneAvailability is not affected.

Vector: CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:N. Scored by CNA (cert.vde.com).

Official description

An unauthenticated remote attacker could exploit the used, insecure TLS 1.0 and TLS 1.1 protocols to intercept and manipulate encrypted communications between the Com-Server and connected systems.

Source: the CVE record as published by its numbering authority, via NVD and CVE.org.

The underlying weakness: Use of a Broken or Risky Cryptographic Algorithm

The product uses a broken or risky cryptographic algorithm or protocol.

How developers prevent this class of flaw

  • Ensure that the design allows one cryptographic algorithm to be replaced with another in the next generation or version. Where possible, use wrappers to make the interfaces uniform. This will make it easier to upgrade to stronger algorithms. With hardware, design the product at the Intellectual Property (IP) level so that one cryptographic algorithm can be replaced with another in the next generation of the hardware product.
  • Carefully manage and protect cryptographic keys (see CWE-320). If the keys can be guessed or stolen, then the strength of the cryptography itself is irrelevant.
  • Use a vetted library or framework that does not allow this weakness to occur or provides constructs that make this weakness easier to avoid. Industry-standard implementations will save development time and may be more likely to avoid errors that can occur during implementation of cryptographic algorithms. Consider the ESAPI Encryption feature.

More Use of a Broken or Risky Cryptographic Algorithm vulnerabilities (CWE-327)

Timeline

  1. CVE record published.
  2. CISA published its SSVC assessment (exploitation: none, automatable: yes, technical impact: total).
  3. Record last changed materially (score, affected products, status or references).

References

Other vulnerabilities in Com-Server++

All Com-Server++ vulnerabilities

Recent Use of a Broken or Risky Cryptographic Algorithm vulnerabilities

Spotted an error? Tell us.