Lucene search
+L

5 matches found

NVD
NVD
•added 2026/10/02 8:17 a.m.•5 views

CVE-2026-18036

In Bouncy Castle for Java before 1.86, NTRU reduced secret values with the % operator in three helpers whose reference implementations are deliberately division-free, so each reduction was carried out by an integer division whose latency depends on the secret operand. Polynomial.modQ divided by a...

8.2CVSS0.00282EPSS
SaveExploits0References2
EUVD
EUVD
•added 2026/10/02 7:54 a.m.•5 views

EUVD-2026-91317

In Bouncy Castle for Java before 1.86, NTRU reduced secret values with the % operator in three helpers whose reference implementations are deliberately division-free, so each reduction was carried out by an integer division whose latency depends on the secret operand. Polynomial.modQ divided by a...

8.2CVSS5.9AI score0.00282EPSS
SaveExploits0References2
CVE
CVE
•added 2026/10/02 7:54 a.m.•9 views

CVE-2026-18036

Bouncy Castle for Java versions prior to 1.86 are vulnerable to a timing side-channel attack in the NTRU implementation. The root cause is the use of the % operator in three helpers, leading to integer division where latency depends on the secret operand. Specifically, Polynomial.modQ divides by ...

8.2CVSS5.9AI score0.00282EPSS
SaveExploits0References2
Cvelist
Cvelist
•added 2026/10/02 7:54 a.m.•21 views

CVE-2026-18036 NTRU leaks private key information by reducing secret values with a non-constant-time integer division

In Bouncy Castle for Java before 1.86, NTRU reduced secret values with the % operator in three helpers whose reference implementations are deliberately division-free, so each reduction was carried out by an integer division whose latency depends on the secret operand. Polynomial.modQ divided by a...

8.2CVSS0.00282EPSS
SaveExploits0References2
Positive Technologies
Positive Technologies
•added 2026/10/02 12:00 a.m.•3 views

PT-2026-104155

In Bouncy Castle for Java before 1.86, NTRU reduced secret values with the % operator in three helpers whose reference implementations are deliberately division-free, so each reduction was carried out by an integer division whose latency depends on the secret operand. Polynomial.modQ divided by a...

8.2CVSS5.9AI score0.00282EPSS
SaveExploits0References3
Rows per page
Query Builder