Page 5 of 24 results (0.008 seconds)

CVSS: 10.0EPSS: 3%CPEs: 1EXPL: 0

Heap-based buffer overflow in MatrixSSL before 3.8.6 allows remote attackers to execute arbitrary code via a crafted Subject Alt Name in an X.509 certificate. Desbordamiento de búfer basado en memoria dinámica en MatrixSSL en versiones anteriores a 3.8.6 permite a atacantes remotos ejecutar código arbitrario a través de un Subject Alt Name manipulado en un certificado X.509. • http://www.securityfocus.com/bid/93498 http://www.tripwire.com/state-of-security/security-data-protection/cyber-security/flawed-matrixssl-code-highlights-need-for-better-iot-update-practices https://github.com/matrixssl/matrixssl/blob/3-8-6-open/CHANGES.md https://www.kb.cert.org/vuls/id/396440 • CWE-119: Improper Restriction of Operations within the Bounds of a Memory Buffer •

CVSS: 7.5EPSS: 0%CPEs: 1EXPL: 0

The x509FreeExtensions function in MatrixSSL before 3.8.6 allows remote attackers to cause a denial of service (free of unallocated memory) via a crafted X.509 certificate. La función x509FreeExtensions en MatrixSSL en versiones anteriores a 3.8.6 permite a atacantes remotos provocar una denegación de servicio (libre de memoria no asignada) a través de un certificado X.509 manipulado. • http://www.securityfocus.com/bid/93498 http://www.tripwire.com/state-of-security/security-data-protection/cyber-security/flawed-matrixssl-code-highlights-need-for-better-iot-update-practices https://github.com/matrixssl/matrixssl/blob/3-8-6-open/CHANGES.md https://www.kb.cert.org/vuls/id/396440 • CWE-416: Use After Free •

CVSS: 7.5EPSS: 0%CPEs: 1EXPL: 0

PeerSec MatrixSSL before 1.1 caches session keys for an indefinitely long time, which might make it easier for remote attackers to hijack a session. • http://www.matrixssl.org/archives/000076.html https://exchange.xforce.ibmcloud.com/vulnerabilities/40483 •

CVSS: 5.8EPSS: 0%CPEs: 1EXPL: 0

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. • http://www.matrixssl.org/archives/000075.html •