https://cve.radiocsirt.org Contains only the most 10 recent entries. http://www.rssboard.org/rss-specification python-feedgen en Thu, 08 Oct 2026 14:31:13 +0000 https://cve.radiocsirt.org/vuln/bdu:2024-07281 bdu:2024-07281 https://cve.radiocsirt.org/vuln/bdu:2024-07281 https://cve.radiocsirt.org/vuln/cnvd-2024-37449 cnvd-2024-37449 https://cve.radiocsirt.org/vuln/cnvd-2024-37449 https://cve.radiocsirt.org/vuln/euvd-2026-266769 EUVD-2026-266769 https://cve.radiocsirt.org/vuln/euvd-2026-266769 https://cve.radiocsirt.org/vuln/fkie_cve-2024-1544 <p>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.</p> <p>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.</p> https://cve.radiocsirt.org/vuln/fkie_cve-2024-1544 https://cve.radiocsirt.org/vuln/ghsa-grjj-54gm-q5vf <p>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.</p> <p>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.</p> https://cve.radiocsirt.org/vuln/ghsa-grjj-54gm-q5vf https://cve.radiocsirt.org/vuln/gsd-2024-1544 gsd-2024-1544 https://cve.radiocsirt.org/vuln/gsd-2024-1544 https://cve.radiocsirt.org/vuln/msrc_cve-2024-1544 msrc_CVE-2024-1544 https://cve.radiocsirt.org/vuln/msrc_cve-2024-1544 https://cve.radiocsirt.org/vuln/ubuntu-cve-2024-1544 <p><strong>Affected:</strong> Ubuntu:16.04:LTS: wolfssl, Ubuntu:18.04:LTS: wolfssl, Ubuntu:20.04:LTS: wolfssl, Ubuntu:22.04:LTS: wolfssl, Ubuntu:24.04:LTS: wolfssl, Ubuntu:25.10: wolfssl, Ubuntu:26.04:LTS: wolfssl</p> <p>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.</p> <p><strong>Affected:</strong> Ubuntu:16.04:LTS: wolfssl, Ubuntu:18.04:LTS: wolfssl, Ubuntu:20.04:LTS: wolfssl, Ubuntu:22.04:LTS: wolfssl, Ubuntu:24.04:LTS: wolfssl, Ubuntu:25.10: wolfssl, Ubuntu:26.04:LTS: wolfssl</p> <p>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.</p> https://cve.radiocsirt.org/vuln/ubuntu-cve-2024-1544