Vulnerability in Wolfssl
CVE-2024-1544
Generating the ECDSA nonce k samples a random number r and then
truncates this randomness with a modular reduction mod n where n is the
order of the elliptic curve. Meaning k = r mod n. The division used
during the reduction estimates a factor q_e by dividing the upper two
digits (a digit having e.g. a size of 8 byte) of r by the upper digit of
n and then decrements q_e in a loop until it has the correct size.
Observing the number of times q_e is decremented through a control-flow
revealing side-channel reveals a bias in the most significant bits of
k. Depending on the curve this is either a negligible bias or a
significant bias large enough to reconstruct k with lattice reduction
methods. For SECP160R1, e.g., we find a bias of 15 bits.
Published · last modified .
CVSS v3 metric
CVSS v3 base score 4.1 (Medium). Vector: CVSS:3.1/AV:L/AC:H/PR:H/UI:N/S:U/C:H/I:N/A:N.
EPSS exploit prediction
EPSS 0.003, 29.0th percentile (scored ); unchanged over 30 days. About EPSS.
Affected products
- Wolfssl — versions 0
Weakness classification (CWE)
Public exploits and proof-of-concept code
Also mentioned in 4 other repositories (deepin-community/wolfssl, mtolley/wolfssl, wolfSSL/Arduino-wolfSSL, …). These reference the CVE in a list, notes or a scanner and are not exploit code for it.