bn_s_mp_mul_digs.c 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
  1. #include <tommath.h>
  2. #ifdef BN_S_MP_MUL_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 only computes upto digs digits of result
  18. * HAC pp. 595, Algorithm 14.12 Modified so you can control how
  19. * many digits of output are created.
  20. */
  21. int s_mp_mul_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. if (((digs) < MP_WARRAY) &&
  30. MIN (a->used, b->used) <
  31. (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
  32. return fast_s_mp_mul_digs (a, b, c, digs);
  33. }
  34. if ((res = mp_init_size (&t, digs)) != MP_OKAY) {
  35. return res;
  36. }
  37. t.used = digs;
  38. /* compute the digits of the product directly */
  39. pa = a->used;
  40. for (ix = 0; ix < pa; ix++) {
  41. /* set the carry to zero */
  42. u = 0;
  43. /* limit ourselves to making digs digits of output */
  44. pb = MIN (b->used, digs - ix);
  45. /* setup some aliases */
  46. /* copy of the digit from a used within the nested loop */
  47. tmpx = a->dp[ix];
  48. /* an alias for the destination shifted ix places */
  49. tmpt = t.dp + ix;
  50. /* an alias for the digits of b */
  51. tmpy = b->dp;
  52. /* compute the columns of the output and propagate the carry */
  53. for (iy = 0; iy < pb; iy++) {
  54. /* compute the column as a mp_word */
  55. r = ((mp_word)*tmpt) +
  56. ((mp_word)tmpx) * ((mp_word)*tmpy++) +
  57. ((mp_word) u);
  58. /* the new column is the lower part of the result */
  59. *tmpt++ = (mp_digit) (r & ((mp_word) MP_MASK));
  60. /* get the carry word from the result */
  61. u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
  62. }
  63. /* set carry if it is placed below digs */
  64. if (ix + iy < digs) {
  65. *tmpt = u;
  66. }
  67. }
  68. mp_clamp (&t);
  69. mp_exch (&t, c);
  70. mp_clear (&t);
  71. return MP_OKAY;
  72. }
  73. #endif
  74. /* $Source: /cvs/libtom/libtommath/bn_s_mp_mul_digs.c,v $ */
  75. /* $Revision: 1.3 $ */
  76. /* $Date: 2006/03/31 14:18:44 $ */