update ltm to 1.1.0 and enable FIPS 186.4 compliant key-generation (#79)

* make key-generation compliant to FIPS 186.4

* fix includes in tommath_class.h

* update fuzzcorpus instead of error-out

* fixup fuzzing make-targets

* update Makefile.in

* apply necessary patches to ltm sources

* clean-up not required ltm files

* update to vanilla ltm 1.1.0

this already only contains the required files

* remove set/get double

1 files changed, 43 insertions, 46 deletions

diff --git a/libtommath/bn_mp_rshd.c b/libtommath/bn_mp_rshd.c
index 4b598de..53fb424 100644
--- a/libtommath/bn_mp_rshd.c
+++ b/libtommath/bn_mp_rshd.c
@@ -1,4 +1,4 @@
-#include <tommath_private.h>
+#include "tommath_private.h"
 #ifdef BN_MP_RSHD_C
 /* LibTomMath, multiple-precision integer library -- Tom St Denis
  *
@@ -9,64 +9,61 @@
  * Michael Fromberger but has been written from scratch with
  * additional optimizations in place.
  *
- * The library is free for all purposes without any express
- * guarantee it works.
- *
- * Tom St Denis, tstdenis82@gmail.com, http://libtom.org
+ * SPDX-License-Identifier: Unlicense
  */
 
 /* shift right a certain amount of digits */
-void mp_rshd (mp_int * a, int b)
+void mp_rshd(mp_int *a, int b)
 {
-  int     x;
+   int     x;
+
+   /* if b <= 0 then ignore it */
+   if (b <= 0) {
+      return;
+   }
 
-  /* if b <= 0 then ignore it */
-  if (b <= 0) {
-    return;
-  }
+   /* if b > used then simply zero it and return */
+   if (a->used <= b) {
+      mp_zero(a);
+      return;
+   }
 
-  /* if b > used then simply zero it and return */
-  if (a->used <= b) {
-    mp_zero (a);
-    return;
-  }
+   {
+      mp_digit *bottom, *top;
 
-  {
-    mp_digit *bottom, *top;
+      /* shift the digits down */
 
-    /* shift the digits down */
+      /* bottom */
+      bottom = a->dp;
 
-    /* bottom */
-    bottom = a->dp;
+      /* top [offset into digits] */
+      top = a->dp + b;
 
-    /* top [offset into digits] */
-    top = a->dp + b;
+      /* this is implemented as a sliding window where
+       * the window is b-digits long and digits from
+       * the top of the window are copied to the bottom
+       *
+       * e.g.
 
-    /* this is implemented as a sliding window where 
-     * the window is b-digits long and digits from 
-     * the top of the window are copied to the bottom
-     *
-     * e.g.
+       b-2 | b-1 | b0 | b1 | b2 | ... | bb |   ---->
+                   /\                   |      ---->
+                    \-------------------/      ---->
+       */
+      for (x = 0; x < (a->used - b); x++) {
+         *bottom++ = *top++;
+      }
 
-     b-2 | b-1 | b0 | b1 | b2 | ... | bb |   ---->
-                 /\                   |      ---->
-                  \-------------------/      ---->
-     */
-    for (x = 0; x < (a->used - b); x++) {
-      *bottom++ = *top++;
-    }
+      /* zero the top digits */
+      for (; x < a->used; x++) {
+         *bottom++ = 0;
+      }
+   }
 
-    /* zero the top digits */
-    for (; x < a->used; x++) {
-      *bottom++ = 0;
-    }
-  }
-  
-  /* remove excess digits */
-  a->used -= b;
+   /* remove excess digits */
+   a->used -= b;
 }
 #endif
 
-/* ref:         $Format:%D$ */
-/* git commit:  $Format:%H$ */
-/* commit time: $Format:%ai$ */
+/* ref:         HEAD -> master, tag: v1.1.0 */
+/* git commit:  08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
+/* commit time: 2019-01-28 20:32:32 +0100 */