2018-05-02 19:43:17 +00:00
|
|
|
#include "tommath_private.h"
|
2004-10-29 22:07:18 +00:00
|
|
|
#ifdef BN_MP_EXPT_D_C
|
2019-04-07 13:29:11 +00:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
|
|
|
|
/* SPDX-License-Identifier: Unlicense */
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2019-05-25 04:42:01 +00:00
|
|
|
/* calculate c = a**b using a square-multiply algorithm */
|
2019-05-12 22:22:18 +00:00
|
|
|
mp_err mp_expt_d(const mp_int *a, mp_digit b, mp_int *c)
|
2003-02-28 16:08:34 +00:00
|
|
|
{
|
2019-05-25 04:42:01 +00:00
|
|
|
mp_err err;
|
|
|
|
|
|
|
|
mp_int g;
|
|
|
|
|
|
|
|
if ((err = mp_init_copy(&g, a)) != MP_OKAY) {
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* set initial result */
|
|
|
|
mp_set(c, 1uL);
|
|
|
|
|
|
|
|
while (b > 0u) {
|
|
|
|
/* if the bit is set multiply */
|
|
|
|
if ((b & 1u) != 0u) {
|
|
|
|
if ((err = mp_mul(c, &g, c)) != MP_OKAY) {
|
|
|
|
mp_clear(&g);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* square */
|
|
|
|
if (b > 1u) {
|
|
|
|
if ((err = mp_sqr(&g, &g)) != MP_OKAY) {
|
|
|
|
mp_clear(&g);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* shift to next bit */
|
|
|
|
b >>= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
mp_clear(&g);
|
|
|
|
return MP_OKAY;
|
2003-02-28 16:08:34 +00:00
|
|
|
}
|
2014-02-13 19:21:18 +00:00
|
|
|
|
2004-10-29 22:07:18 +00:00
|
|
|
#endif
|