Fix heap overflow in ECC point multiplication

If affine coordinates larger than the prime modulus were given,
a later multiplication could overflow the size of an allocated
output buffer, which was sized based on the size of the prime.

This will cause an overflow into either the system heap or if the
mlock/mmap pool allocator is in use, then into the adjacent key
material stored in the pool.

Reported by Alex Gaynor who found it with AFL

Also fix a one word overwrite in P-521 reduction. Found with AFL

1 files changed, 34 insertions, 1 deletions

diff --git a/doc/security.rst b/doc/security.rst
index a4aaa5e0d..2552d6751 100644
--- a/doc/security.rst
+++ b/doc/security.rst
@@ -18,6 +18,39 @@ Advisories
 
 2016
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+
+* 2016-06-01 (CVE-2016-2196): Overwrite in P-521 reduction
+
+  The P-521 reduction function would overwrite zero to one word
+  following the allocated block. This could potentially result
+  in remote code execution or a crash. Found with AFL
+
+* 2016-02-01 (CVE-2016-2195): Heap overflow on invalid ECC point
+
+  The PointGFp constructor did not check that the affine coordinate
+  arguments were less than the prime, but then in curve multiplication
+  assumed that both arguments if multiplied would fit into an integer
+  twice the size of the prime.
+
+  The bigint_mul and bigint_sqr functions received the size of the
+  output buffer, but only used it to dispatch to a faster algorithm in
+  cases where there was sufficient output space to call an unrolled
+  multiplication function.
+
+  The result is a heap overflow accessible via ECC point decoding,
+  which accepted untrusted inputs. This is likely exploitable for
+  remote code execution.
+
+  On systems which use the mlock pool allocator, it would allow an
+  attacker to overwrite memory held in secure_vector objects. After
+  this point the write will hit the guard page at the end of the
+  mmap'ed region so it probably could not be used for code execution
+  directly, but would allow overwriting adjacent key material.
+
+  Found by Alex Gaynor fuzzing with AFL
+
+  Versions affected: all before 1.11.27 and 1.10.11
+
 * 2016-02-01 (CVE-2016-2194): Infinite loop in modulur square root algorithm
 
   The ressol function implements the Tonelli-Shanks algorithm for
@@ -27,7 +60,7 @@ Advisories
   This function is exposed to attacker controlled input via the OS2ECP
   function during ECC point decompression. Found by AFL
 
-  Introduced in 1.7.15, fixed in 1.11.27
+  Versions affected: all before 1.11.27 and 1.10.11
 
 2015
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^