{"id":"CVE-2015-7744","published":"2016-01-22T15:00:00Z","modified":"2024-08-06T07:58:59Z","title":"wolfSSL (formerly CyaSSL) before 3.6.8 does not properly handle faults associated with the Chinese Remainder Theorem…","vendor":null,"product":null,"tier":"tail","description":{"text":"wolfSSL (formerly CyaSSL) before 3.6.8 does not properly handle faults associated with the Chinese Remainder Theorem (CRT) process when allowing ephemeral key exchange without low memory optimizations on a server, which makes it easier for remote attackers to obtain private RSA keys by capturing TLS handshakes, aka a Lenstra attack.","provenance":"source","from":"CVE.org"},"cvss":null,"epss":{"score":0.05073,"percentile":0.92528,"provenance":"source"},"cwes":[],"references":[{"url":"http://lists.opensuse.org/opensuse-security-announce/2016-02/msg00015.html","tags":["vendor-advisory","x_refsource_SUSE"]},{"url":"http://www.securitytracker.com/id/1034708","tags":["vdb-entry","x_refsource_SECTRACK"]},{"url":"http://wolfssl.com/wolfSSL/Docs-wolfssl-changelog.html","tags":["x_refsource_CONFIRM"]},{"url":"https://people.redhat.com/~fweimer/rsa-crt-leaks.pdf","tags":["x_refsource_MISC"]},{"url":"http://www.oracle.com/technetwork/topics/security/cpujan2016-2367955.html","tags":["x_refsource_CONFIRM"]},{"url":"http://www.oracle.com/technetwork/topics/security/bulletinapr2016-2952098.html","tags":["x_refsource_CONFIRM"]},{"url":"https://wolfssl.com/wolfSSL/Blog/Entries/2015/9/17_Two_Vulnerabilities_Recently_Found%2C_An_Attack_on_RSA_using_CRT_and_DoS_Vulnerability_With_DTLS.html","tags":["x_refsource_CONFIRM"]},{"url":"https://securityblog.redhat.com/2015/09/02/factoring-rsa-keys-with-tls-perfect-forward-secrecy/","tags":["x_refsource_MISC"]},{"url":"http://lists.opensuse.org/opensuse-security-announce/2016-02/msg00016.html","tags":["vendor-advisory","x_refsource_SUSE"]}],"priority":{"score":18.5,"factors":[{"name":"EPSS percentile","points":18.51}]},"summary":{"text":"wolfSSL (formerly CyaSSL) before 3.6.8 mishandles faults in the Chinese Remainder Theorem process used for RSA operations during ephemeral key exchange, when low memory optimizations are not enabled on a server. An remote attacker who can capture TLS handshakes from such a server can exploit this to recover the server's private RSA key (a Lenstra-style attack), with no authentication or user interaction described as required.","provenance":"ai","model":"claude-haiku-5-5","generatedAt":"2026-11-20T21:08:48Z"},"euvd":{"id":"EUVD-2015-7644","exploited":false,"provenance":"source"}}