blob: 589c88f21ff42588d6b069aa0c9f793ebc294be7 [file] [log] [blame]
module: std
package: math/big
- introduced: go1.5
fixed: go1.5.3
description: |
Int.Exp Montgomery mishandled carry propagation and produced an incorrect
output, which makes it easier for attackers to obtain private RSA keys via
unspecified vectors.
This issue can affect RSA computations in crypto/rsa, which is used by
crypto/tls. TLS servers on 32-bit systems could plausibly leak their RSA
private key due to this issue. Other protocol implementations that create
many RSA signatures could also be impacted in the same way.
Specifically, incorrect results in one part of the RSA Chinese Remainder
computation can cause the result to be incorrect in such a way that it leaks
one of the primes. While RSA blinding should prevent an attacker from crafting
specific inputs that trigger the bug, on 32-bit systems the bug can be expected
to occur at random around one in 2^26 times. Thus collecting around 64 million
signatures (of known data) from an affected server should be enough to extract
the private key used.
Note that on 64-bit systems, the frequency of the bug is so low
(less than one in 2^50) that it would be very difficult to exploit.
published: 2022-01-05T15:31:16Z
- CVE-2015-8618
credit: Nick Craig-Wood
- nat.expNNMontgomery
- nat.montgomery