bn_s_mp_mul_high_digs.c 2.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
  1. #include <tommath.h>
  2. #ifdef BN_S_MP_MUL_HIGH_DIGS_C
  3. /* LibTomMath, multiple-precision integer library -- Tom St Denis
  4. *
  5. * LibTomMath is a library that provides multiple-precision
  6. * integer arithmetic as well as number theoretic functionality.
  7. *
  8. * The library was designed directly after the MPI library by
  9. * Michael Fromberger but has been written from scratch with
  10. * additional optimizations in place.
  11. *
  12. * The library is free for all purposes without any express
  13. * guarantee it works.
  14. *
  15. * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
  16. */
  17. /* multiplies |a| * |b| and does not compute the lower digs digits
  18. * [meant to get the higher part of the product]
  19. */
  20. int
  21. s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
  22. {
  23. mp_int t;
  24. int res, pa, pb, ix, iy;
  25. mp_digit u;
  26. mp_word r;
  27. mp_digit tmpx, *tmpt, *tmpy;
  28. /* can we use the fast multiplier? */
  29. #ifdef BN_FAST_S_MP_MUL_HIGH_DIGS_C
  30. if (((a->used + b->used + 1) < MP_WARRAY)
  31. && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
  32. return fast_s_mp_mul_high_digs (a, b, c, digs);
  33. }
  34. #endif
  35. if ((res = mp_init_size (&t, a->used + b->used + 1)) != MP_OKAY) {
  36. return res;
  37. }
  38. t.used = a->used + b->used + 1;
  39. pa = a->used;
  40. pb = b->used;
  41. for (ix = 0; ix < pa; ix++) {
  42. /* clear the carry */
  43. u = 0;
  44. /* left hand side of A[ix] * B[iy] */
  45. tmpx = a->dp[ix];
  46. /* alias to the address of where the digits will be stored */
  47. tmpt = &(t.dp[digs]);
  48. /* alias for where to read the right hand side from */
  49. tmpy = b->dp + (digs - ix);
  50. for (iy = digs - ix; iy < pb; iy++) {
  51. /* calculate the double precision result */
  52. r = ((mp_word)*tmpt) +
  53. ((mp_word)tmpx) * ((mp_word)*tmpy++) +
  54. ((mp_word) u);
  55. /* get the lower part */
  56. *tmpt++ = (mp_digit) (r & ((mp_word) MP_MASK));
  57. /* carry the carry */
  58. u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
  59. }
  60. *tmpt = u;
  61. }
  62. mp_clamp (&t);
  63. mp_exch (&t, c);
  64. mp_clear (&t);
  65. return MP_OKAY;
  66. }
  67. #endif
  68. /* $Source: /cvs/libtom/libtommath/bn_s_mp_mul_high_digs.c,v $ */
  69. /* $Revision: 1.3 $ */
  70. /* $Date: 2006/03/31 14:18:44 $ */