FlawAtlas
Search the atlas
UBUNTU-CVE-2022-41715 High

UBUNTU-CVE-2022-41715

Programs which compile regular expressions from untrusted sources may be vulnerable to memory exhaustion or denial of service. The parsed regexp representation is linear in the size of the input, but in some cases the constant factor can be as high as 40,000, making relatively small regexps consume much larger amounts of memory. After fix, each regexp being parsed is limited to a 256 MB memory footprint. Regular expressions whose representation would use more space than that are rejected. Normal use of regular expressions is unaffected.

Exploit probability Not scored
Published October 14, 2022
Required by Not available
Last source change February 4, 2026

02 / AFFECTED SOFTWARE

Affected packages

Ubuntu:14.04:LTS golang-1.10

1 explicit affected versions

Ubuntu:16.04:LTS golang-1.10

2 explicit affected versions

Ubuntu:16.04:LTS golang-1.6

10 explicit affected versions

Ubuntu:18.04:LTS golang-1.10

8 explicit affected versions

Ubuntu:18.04:LTS golang-1.18

1 explicit affected versions

Ubuntu:18.04:LTS golang-1.8

2 explicit affected versions

Ubuntu:18.04:LTS golang-1.9

5 explicit affected versions

Ubuntu:20.04:LTS golang-1.13

10 explicit affected versions

Ubuntu:20.04:LTS golang-1.14

9 explicit affected versions

Ubuntu:20.04:LTS golang-1.18

1 explicit affected versions

Ubuntu:22.04:LTS golang-1.18

6 explicit affected versions

Ubuntu:Pro:16.04:LTS golang-1.13

4 explicit affected versions

Ubuntu:Pro:18.04:LTS golang-1.13

4 explicit affected versions

Ubuntu:Pro:18.04:LTS golang-1.16

2 explicit affected versions

Ubuntu:Pro:20.04:LTS golang-1.16

3 explicit affected versions

Ubuntu:Pro:22.04:LTS golang-1.13

4 explicit affected versions

03 / CONNECTIONS

Connected vulnerabilities

04 / EVIDENCE

Source records

Open Source Vulnerabilities UBUNTU-CVE-2022-41715

Programs which compile regular expressions from untrusted sources may be vulnerable to memory exhaustion or denial of service. The parsed regexp representation is linear in the size of the input, but in some cases the constant factor can be as high as 40,000, making relatively small regexps consume much larger amounts of memory. After fix, each regexp being parsed is limited to a 256 MB memory footprint. Regular expressions whose representation would use more space than that are rejected. Normal use of regular expressions is unaffected.

View original source

05 / REFERENCES

Further evidence