2018-05-02 19:43:17 +00:00
|
|
|
#include "tommath_private.h"
|
2004-10-29 22:07:18 +00:00
|
|
|
#ifdef BN_S_MP_MUL_DIGS_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
|
|
|
|
|
|
|
/* multiplies |a| * |b| and only computes upto digs digits of result
|
2017-08-30 03:51:11 +00:00
|
|
|
* HAC pp. 595, Algorithm 14.12 Modified so you can control how
|
2003-05-17 12:33:54 +00:00
|
|
|
* many digits of output are created.
|
2003-02-28 16:08:34 +00:00
|
|
|
*/
|
2019-05-12 22:22:18 +00:00
|
|
|
mp_err s_mp_mul_digs(const mp_int *a, const mp_int *b, mp_int *c, int digs)
|
2003-02-28 16:08:34 +00:00
|
|
|
{
|
2017-08-30 17:15:27 +00:00
|
|
|
mp_int t;
|
2019-05-12 22:22:18 +00:00
|
|
|
mp_err res;
|
|
|
|
int pa, pb, ix, iy;
|
2017-08-30 17:15:27 +00:00
|
|
|
mp_digit u;
|
|
|
|
mp_word r;
|
|
|
|
mp_digit tmpx, *tmpt, *tmpy;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* can we use the fast multiplier? */
|
2017-10-15 17:58:35 +00:00
|
|
|
if ((digs < (int)MP_WARRAY) &&
|
2019-05-08 17:43:21 +00:00
|
|
|
(MP_MIN(a->used, b->used) < MP_MAXFAST)) {
|
2019-04-12 12:56:29 +00:00
|
|
|
return s_mp_mul_digs_fast(a, b, c, digs);
|
2017-08-30 17:15:27 +00:00
|
|
|
}
|
2003-05-17 12:33:54 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
if ((res = mp_init_size(&t, digs)) != MP_OKAY) {
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
t.used = digs;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* compute the digits of the product directly */
|
|
|
|
pa = a->used;
|
|
|
|
for (ix = 0; ix < pa; ix++) {
|
|
|
|
/* set the carry to zero */
|
|
|
|
u = 0;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* limit ourselves to making digs digits of output */
|
2019-04-09 09:08:26 +00:00
|
|
|
pb = MP_MIN(b->used, digs - ix);
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* setup some aliases */
|
|
|
|
/* copy of the digit from a used within the nested loop */
|
|
|
|
tmpx = a->dp[ix];
|
2017-08-30 03:51:11 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* an alias for the destination shifted ix places */
|
|
|
|
tmpt = t.dp + ix;
|
2017-08-30 03:51:11 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* an alias for the digits of b */
|
|
|
|
tmpy = b->dp;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* compute the columns of the output and propagate the carry */
|
|
|
|
for (iy = 0; iy < pb; iy++) {
|
|
|
|
/* compute the column as a mp_word */
|
|
|
|
r = (mp_word)*tmpt +
|
|
|
|
((mp_word)tmpx * (mp_word)*tmpy++) +
|
|
|
|
(mp_word)u;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* the new column is the lower part of the result */
|
2017-10-15 17:58:35 +00:00
|
|
|
*tmpt++ = (mp_digit)(r & (mp_word)MP_MASK);
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
/* get the carry word from the result */
|
2019-04-13 06:46:57 +00:00
|
|
|
u = (mp_digit)(r >> (mp_word)MP_DIGIT_BIT);
|
2017-08-30 17:15:27 +00:00
|
|
|
}
|
|
|
|
/* set carry if it is placed below digs */
|
|
|
|
if ((ix + iy) < digs) {
|
|
|
|
*tmpt = u;
|
|
|
|
}
|
|
|
|
}
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
mp_clamp(&t);
|
|
|
|
mp_exch(&t, c);
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:15:27 +00:00
|
|
|
mp_clear(&t);
|
|
|
|
return MP_OKAY;
|
2003-02-28 16:08:34 +00:00
|
|
|
}
|
2004-10-29 22:07:18 +00:00
|
|
|
#endif
|