bn_mp_expt_d.c 1.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
  1. #include <tommath.h>
  2. #ifdef BN_MP_EXPT_D_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. /* calculate c = a**b using a square-multiply algorithm */
  18. int mp_expt_d (mp_int * a, mp_digit b, mp_int * c)
  19. {
  20. int res, x;
  21. mp_int g;
  22. if ((res = mp_init_copy (&g, a)) != MP_OKAY) {
  23. return res;
  24. }
  25. /* set initial result */
  26. mp_set (c, 1);
  27. for (x = 0; x < (int) DIGIT_BIT; x++) {
  28. /* square */
  29. if ((res = mp_sqr (c, c)) != MP_OKAY) {
  30. mp_clear (&g);
  31. return res;
  32. }
  33. /* if the bit is set multiply */
  34. if ((b & (mp_digit) (((mp_digit)1) << (DIGIT_BIT - 1))) != 0) {
  35. if ((res = mp_mul (c, &g, c)) != MP_OKAY) {
  36. mp_clear (&g);
  37. return res;
  38. }
  39. }
  40. /* shift to next bit */
  41. b <<= 1;
  42. }
  43. mp_clear (&g);
  44. return MP_OKAY;
  45. }
  46. #endif
  47. /* $Source: /cvs/libtom/libtommath/bn_mp_expt_d.c,v $ */
  48. /* $Revision: 1.3 $ */
  49. /* $Date: 2006/03/31 14:18:44 $ */