diff libtommath/bn_mp_sqr.c @ 1655:f52919ffd3b1

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
author Steffen Jaeckel <s_jaeckel@gmx.de>
date Mon, 16 Sep 2019 15:50:38 +0200
parents 8bba51a55704
children 1051e4eea25a
line wrap: on
line diff
--- a/libtommath/bn_mp_sqr.c	Wed May 15 21:59:45 2019 +0800
+++ b/libtommath/bn_mp_sqr.c	Mon Sep 16 15:50:38 2019 +0200
@@ -1,4 +1,4 @@
-#include <tommath_private.h>
+#include "tommath_private.h"
 #ifdef BN_MP_SQR_C
 /* LibTomMath, multiple-precision integer library -- Tom St Denis
  *
@@ -9,52 +9,48 @@
  * 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, [email protected], http://libtom.org
+ * SPDX-License-Identifier: Unlicense
  */
 
 /* computes b = a*a */
-int
-mp_sqr (mp_int * a, mp_int * b)
+int mp_sqr(const mp_int *a, mp_int *b)
 {
-  int     res;
+   int     res;
 
 #ifdef BN_MP_TOOM_SQR_C
-  /* use Toom-Cook? */
-  if (a->used >= TOOM_SQR_CUTOFF) {
-    res = mp_toom_sqr(a, b);
-  /* Karatsuba? */
-  } else 
+   /* use Toom-Cook? */
+   if (a->used >= TOOM_SQR_CUTOFF) {
+      res = mp_toom_sqr(a, b);
+      /* Karatsuba? */
+   } else
 #endif
 #ifdef BN_MP_KARATSUBA_SQR_C
-  if (a->used >= KARATSUBA_SQR_CUTOFF) {
-    res = mp_karatsuba_sqr (a, b);
-  } else 
+      if (a->used >= KARATSUBA_SQR_CUTOFF) {
+         res = mp_karatsuba_sqr(a, b);
+      } else
 #endif
-  {
+      {
 #ifdef BN_FAST_S_MP_SQR_C
-    /* can we use the fast comba multiplier? */
-    if ((((a->used * 2) + 1) < MP_WARRAY) &&
-         (a->used <
-         (1 << (((sizeof(mp_word) * CHAR_BIT) - (2 * DIGIT_BIT)) - 1)))) {
-      res = fast_s_mp_sqr (a, b);
-    } else
+         /* can we use the fast comba multiplier? */
+         if ((((a->used * 2) + 1) < (int)MP_WARRAY) &&
+             (a->used <
+              (int)(1u << (((sizeof(mp_word) * (size_t)CHAR_BIT) - (2u * (size_t)DIGIT_BIT)) - 1u)))) {
+            res = fast_s_mp_sqr(a, b);
+         } else
 #endif
-    {
+         {
 #ifdef BN_S_MP_SQR_C
-      res = s_mp_sqr (a, b);
+            res = s_mp_sqr(a, b);
 #else
-      res = MP_VAL;
+            res = MP_VAL;
 #endif
-    }
-  }
-  b->sign = MP_ZPOS;
-  return res;
+         }
+      }
+   b->sign = MP_ZPOS;
+   return res;
 }
 #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 */