Логотип exploitDog
bind:CVE-2004-2682
Консоль
Логотип exploitDog

exploitDog

bind:CVE-2004-2682

Количество 3

Количество 3

nvd логотип

CVE-2004-2682

больше 20 лет назад

PeerSec MatrixSSL before 1.1 does not implement RSA blinding, which allows context-dependent attackers to obtain the server's private key by determining factors using timing differences on (1) the number of extra reductions during Montgomery reduction, and (2) the use of different integer multiplication algorithms ("Karatsuba" and normal), a related issue to CVE-2003-0147.

CVSS2: 5.8
EPSS: Низкий
debian логотип

CVE-2004-2682

больше 20 лет назад

PeerSec MatrixSSL before 1.1 does not implement RSA blinding, which al ...

CVSS2: 5.8
EPSS: Низкий
github логотип

GHSA-6vgj-39gw-mxw3

больше 3 лет назад

PeerSec MatrixSSL before 1.1 does not implement RSA blinding, which allows context-dependent attackers to obtain the server's private key by determining factors using timing differences on (1) the number of extra reductions during Montgomery reduction, and (2) the use of different integer multiplication algorithms ("Karatsuba" and normal), a related issue to CVE-2003-0147.

EPSS: Низкий

Уязвимостей на страницу

Уязвимость
CVSS
EPSS
Опубликовано
nvd логотип
CVE-2004-2682

PeerSec MatrixSSL before 1.1 does not implement RSA blinding, which allows context-dependent attackers to obtain the server's private key by determining factors using timing differences on (1) the number of extra reductions during Montgomery reduction, and (2) the use of different integer multiplication algorithms ("Karatsuba" and normal), a related issue to CVE-2003-0147.

CVSS2: 5.8
0%
Низкий
больше 20 лет назад
debian логотип
CVE-2004-2682

PeerSec MatrixSSL before 1.1 does not implement RSA blinding, which al ...

CVSS2: 5.8
0%
Низкий
больше 20 лет назад
github логотип
GHSA-6vgj-39gw-mxw3

PeerSec MatrixSSL before 1.1 does not implement RSA blinding, which allows context-dependent attackers to obtain the server's private key by determining factors using timing differences on (1) the number of extra reductions during Montgomery reduction, and (2) the use of different integer multiplication algorithms ("Karatsuba" and normal), a related issue to CVE-2003-0147.

0%
Низкий
больше 3 лет назад

Уязвимостей на страницу