CyberSecBulletin
CVE-2022-40023NVD status: Modified

Mako: Inefficient Regular Expression Complexity

CVE-2022-40023 is a high-severity inefficient regular expression complexity vulnerability in Mako from Sqlalchemy, with a CVSS 3.1 base score of 7.5 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.2.2 as the first without the flaw, so updating Mako to that release or later removes the exposure. There is no confirmed exploitation so far. EPSS estimates a 2.32% chance of exploitation within 30 days, higher than 84% of scored CVEs.

Next patch cycle

High severity with no evidence of exploitation so far.

What to do

  1. Update Mako to 1.2.2 or a later version.
  2. 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
SqlalchemyMakobefore 1.2.21.2.2
DebianDebian Linux10.0Not stated

Version data comes from NVD's product matching. 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
NoneNo data is disclosed.
Integrity
NoneNothing can be modified.
Availability
HighThe component can be taken down completely.

Vector: CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H. Scored by NVD.

Official description

Sqlalchemy mako before 1.2.2 is vulnerable to Regular expression Denial of Service when using the Lexer class to parse. This also affects babelplugin and linguaplugin.

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

The underlying weakness: Inefficient Regular Expression Complexity

The product uses a regular expression with a worst-case computational complexity that is inefficient and possibly exponential.

How developers prevent this class of flaw

  • Use regular expressions that do not support backtracking, e.g. by removing nested quantifiers.
  • Set backtracking limits in the configuration of the regular expression implementation, such as PHP's pcre.backtrack_limit. Also consider limits on execution time for the process.
  • Do not use regular expressions with untrusted input. If regular expressions must be used, avoid using backtracking in the expression.

More Inefficient Regular Expression Complexity vulnerabilities (CWE-1333)

Timeline

  1. CVE record published.
  2. Record last changed materially (score, affected products, status or references).

References

Third-party and government advisories

Other vulnerabilities in Mako

All Mako vulnerabilities

Recent Inefficient Regular Expression Complexity vulnerabilities

Spotted an error? Tell us.