Consider this an item for the watch-list, rather than a reason to hit the panic button: a math error in the Go language could potentially affect cryptographic libraries.
Security researcher Guido Vranken (who earlier this year fuzzed up some bugs in OpenVPN) found an exponentiation error in the Go
Big numbers - particularly big primes - are the foundation of cryptography.
Vranken posted to the oss-sec mailing list that he found the potential issue during testing of a fuzzer he wrote that "compares the results of mathematical operations (addition, subtraction, multiplication, ...) across multiple bignum libraries”.
Vranken and Go developer Russ Cox agreed that the bug needs specific conditions to be manifest: “it only affects the case e = 1 with m != nil and a pre-allocated non-zero receiver.”
That's expanded in the post, by way of explanation: “For an exponent of 1,
big.Int.Exp returns the correct value only for a 0 recipient, and an off-by-one result for all pre-allocated recipients.”
Readers can see the proof-of-concept in operation at the Go Playground here.
In Vranken's GitHub post, Cox commented:
“Most crypto code uses new(big.Int).Exp(x, y, m) instead of reusing receivers. Most crypto code is also written so that a modular exponentiation with an exponent of 1 is either completely impossible or exceedingly unlikely. We examined all the uses in the standard library and believe they are unaffected, for either the first or the second reason.”
He added that
x/crypto, openpgp, and
ssh are fine because they only use
new(big.Int).Exp, but other packages like
x/crypt/otr (an implementation in Go of the Off-The-Record messaging protocol) may need closer examination.
Vranken's big number fuzzer is here. ®