Логотип exploitDog
Консоль
Логотип exploitDog

exploitDog

ubuntu логотип

CVE-2026-15534

Опубликовано: 09 авг. 2026
Источник: ubuntu
Приоритет: medium
EPSS Низкий
CVSS3: 5.7

Описание

Perl versions through 5.45.1 have out-of-bounds heap reads and writes during regular expression matching via an undersized superlinear cache in S_regmatch. The regex engine's superlinear cache holds one bit per subject position for each participating WHILEM node, so the bit count is the subject length plus one times the number of nodes. Nothing checks that product for positive overflow of the signed 32-bit count: a 286331153 byte subject matched against a pattern with 15 participating nodes stores the count as 14, leaving a two byte cache. The cache is then indexed from the real match position and node number, so reads go past the end of the allocation, and on failure CACHEsayNO sets a bit past it. A caller that matches an attacker controlled subject of this size against a pattern of this shape can crash the process or corrupt heap memory.

РелизСтатусПримечание
devel

needed

esm-infra-legacy/trusty

released

5.18.2-2ubuntu1.7+esm9
esm-infra-legacy/xenial

released

5.22.1-9ubuntu0.9+esm4
esm-infra/bionic

released

5.26.1-6ubuntu0.7+esm4
esm-infra/focal

released

5.30.0-9ubuntu0.5+esm4
jammy

released

5.34.0-3ubuntu1.9
noble

released

5.38.2-3.2ubuntu0.6
resolute

released

5.40.1-7ubuntu0.2
upstream

released

5.45.2

Показывать по

EPSS

Процентиль: 6%
0.00167
Низкий

5.7 Medium

CVSS3

Связанные уязвимости

CVSS3: 5.7
redhat
около 1 месяца назад

Perl versions through 5.45.1 have out-of-bounds heap reads and writes during regular expression matching via an undersized superlinear cache in S_regmatch. The regex engine's superlinear cache holds one bit per subject position for each participating WHILEM node, so the bit count is the subject length plus one times the number of nodes. Nothing checks that product for positive overflow of the signed 32-bit count: a 286331153 byte subject matched against a pattern with 15 participating nodes stores the count as 14, leaving a two byte cache. The cache is then indexed from the real match position and node number, so reads go past the end of the allocation, and on failure CACHEsayNO sets a bit past it. A caller that matches an attacker controlled subject of this size against a pattern of this shape can crash the process or corrupt heap memory.

CVSS3: 5.7
nvd
около 1 месяца назад

Perl versions through 5.45.1 have out-of-bounds heap reads and writes during regular expression matching via an undersized superlinear cache in S_regmatch. The regex engine's superlinear cache holds one bit per subject position for each participating WHILEM node, so the bit count is the subject length plus one times the number of nodes. Nothing checks that product for positive overflow of the signed 32-bit count: a 286331153 byte subject matched against a pattern with 15 participating nodes stores the count as 14, leaving a two byte cache. The cache is then indexed from the real match position and node number, so reads go past the end of the allocation, and on failure CACHEsayNO sets a bit past it. A caller that matches an attacker controlled subject of this size against a pattern of this shape can crash the process or corrupt heap memory.

CVSS3: 5.7
msrc
около 1 месяца назад

Perl versions through 5.45.1 have out-of-bounds heap reads and writes during regular expression matching via an undersized superlinear cache in S_regmatch

CVSS3: 5.7
debian
около 1 месяца назад

Perl versions through 5.45.1 have out-of-bounds heap reads and writes ...

CVSS3: 5.7
github
около 1 месяца назад

Perl versions through 5.45.1 have out-of-bounds heap reads and writes during regular expression matching via an undersized superlinear cache in S_regmatch. The regex engine's superlinear cache holds one bit per subject position for each participating WHILEM node, so the bit count is the subject length plus one times the number of nodes. Nothing checks that product for positive overflow of the signed 32-bit count: a 286331153 byte subject matched against a pattern with 15 participating nodes stores the count as 14, leaving a two byte cache. The cache is then indexed from the real match position and node number, so reads go past the end of the allocation, and on failure CACHEsayNO sets a bit past it. A caller that matches an attacker controlled subject of this size against a pattern of this shape can crash the process or corrupt heap memory.

EPSS

Процентиль: 6%
0.00167
Низкий

5.7 Medium

CVSS3