Coverage Report

Created: 2023-06-07 06:44

/src/dropbear/libtommath/bn_s_mp_sqr.c
Line
Count
Source (jump to first uncovered line)
1
#include "tommath_private.h"
2
#ifdef BN_S_MP_SQR_C
3
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
4
/* SPDX-License-Identifier: Unlicense */
5
6
/* low level squaring, b = a*a, HAC pp.596-597, Algorithm 14.16 */
7
mp_err s_mp_sqr(const mp_int *a, mp_int *b)
8
188
{
9
188
   mp_int   t;
10
188
   int      ix, iy, pa;
11
188
   mp_err   err;
12
188
   mp_word  r;
13
188
   mp_digit u, tmpx, *tmpt;
14
15
188
   pa = a->used;
16
188
   if ((err = mp_init_size(&t, (2 * pa) + 1)) != MP_OKAY) {
17
0
      return err;
18
0
   }
19
20
   /* default used is maximum possible size */
21
188
   t.used = (2 * pa) + 1;
22
23
25.2k
   for (ix = 0; ix < pa; ix++) {
24
      /* first calculate the digit at 2*ix */
25
      /* calculate double precision result */
26
25.0k
      r = (mp_word)t.dp[2*ix] +
27
25.0k
          ((mp_word)a->dp[ix] * (mp_word)a->dp[ix]);
28
29
      /* store lower part in result */
30
25.0k
      t.dp[ix+ix] = (mp_digit)(r & (mp_word)MP_MASK);
31
32
      /* get the carry */
33
25.0k
      u           = (mp_digit)(r >> (mp_word)MP_DIGIT_BIT);
34
35
      /* left hand side of A[ix] * A[iy] */
36
25.0k
      tmpx        = a->dp[ix];
37
38
      /* alias for where to store the results */
39
25.0k
      tmpt        = t.dp + ((2 * ix) + 1);
40
41
1.67M
      for (iy = ix + 1; iy < pa; iy++) {
42
         /* first calculate the product */
43
1.65M
         r       = (mp_word)tmpx * (mp_word)a->dp[iy];
44
45
         /* now calculate the double precision result, note we use
46
          * addition instead of *2 since it's easier to optimize
47
          */
48
1.65M
         r       = (mp_word)*tmpt + r + r + (mp_word)u;
49
50
         /* store lower part */
51
1.65M
         *tmpt++ = (mp_digit)(r & (mp_word)MP_MASK);
52
53
         /* get carry */
54
1.65M
         u       = (mp_digit)(r >> (mp_word)MP_DIGIT_BIT);
55
1.65M
      }
56
      /* propagate upwards */
57
46.3k
      while (u != 0uL) {
58
21.3k
         r       = (mp_word)*tmpt + (mp_word)u;
59
21.3k
         *tmpt++ = (mp_digit)(r & (mp_word)MP_MASK);
60
21.3k
         u       = (mp_digit)(r >> (mp_word)MP_DIGIT_BIT);
61
21.3k
      }
62
25.0k
   }
63
64
188
   mp_clamp(&t);
65
188
   mp_exch(&t, b);
66
188
   mp_clear(&t);
67
188
   return MP_OKAY;
68
188
}
69
#endif