tommath/bn_s_mp_mul_high_digs.c

81 lines
2.2 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_S_MP_MUL_HIGH_DIGS_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* 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
2003-02-28 11:08:34 -05:00
*/
2003-05-17 08:33:54 -04:00
/* multiplies |a| * |b| and does not compute the lower digs digits
2003-02-28 11:08:34 -05:00
* [meant to get the higher part of the product]
*/
2017-09-20 10:59:43 -04:00
int s_mp_mul_high_digs(const mp_int *a, const mp_int *b, mp_int *c, int digs)
2003-02-28 11:08:34 -05:00
{
2017-08-30 13:15:27 -04:00
mp_int t;
int res, pa, pb, ix, iy;
mp_digit u;
mp_word r;
mp_digit tmpx, *tmpt, *tmpy;
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
/* can we use the fast multiplier? */
2004-10-29 18:07:18 -04:00
#ifdef BN_FAST_S_MP_MUL_HIGH_DIGS_C
2017-10-15 13:58:35 -04:00
if (((a->used + b->used + 1) < (int)MP_WARRAY)
2017-10-15 13:57:12 -04:00
&& (MIN(a->used, b->used) < (int)(1u << (((size_t)CHAR_BIT * sizeof(mp_word)) - (2u * (size_t)DIGIT_BIT))))) {
2017-08-30 13:15:27 -04:00
return fast_s_mp_mul_high_digs(a, b, c, digs);
}
2004-10-29 18:07:18 -04:00
#endif
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
if ((res = mp_init_size(&t, a->used + b->used + 1)) != MP_OKAY) {
return res;
}
t.used = a->used + b->used + 1;
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
pa = a->used;
pb = b->used;
for (ix = 0; ix < pa; ix++) {
/* clear the carry */
u = 0;
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
/* left hand side of A[ix] * B[iy] */
tmpx = a->dp[ix];
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
/* alias to the address of where the digits will be stored */
tmpt = &(t.dp[digs]);
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
/* alias for where to read the right hand side from */
tmpy = b->dp + (digs - ix);
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
for (iy = digs - ix; iy < pb; iy++) {
/* calculate the double precision result */
r = (mp_word)*tmpt +
((mp_word)tmpx * (mp_word)*tmpy++) +
(mp_word)u;
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
/* get the lower part */
2017-10-15 13:58:35 -04:00
*tmpt++ = (mp_digit)(r & (mp_word)MP_MASK);
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
/* carry the carry */
2017-10-15 13:58:35 -04:00
u = (mp_digit)(r >> (mp_word)DIGIT_BIT);
2017-08-30 13:15:27 -04:00
}
*tmpt = u;
}
mp_clamp(&t);
mp_exch(&t, c);
mp_clear(&t);
return MP_OKAY;
2003-02-28 11:08:34 -05:00
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
2017-08-28 10:27:26 -04:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */