bn_mp_mod.c 1.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748
  1. #include <tommath.h>
  2. #ifdef BN_MP_MOD_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. /* c = a mod b, 0 <= c < b */
  18. int
  19. mp_mod (mp_int * a, mp_int * b, mp_int * c)
  20. {
  21. mp_int t;
  22. int res;
  23. if ((res = mp_init_size (&t, b->used)) != MP_OKAY) {
  24. return res;
  25. }
  26. if ((res = mp_div (a, b, NULL, &t)) != MP_OKAY) {
  27. mp_clear (&t);
  28. return res;
  29. }
  30. if (t.sign != b->sign) {
  31. res = mp_add (b, &t, c);
  32. } else {
  33. res = MP_OKAY;
  34. mp_exch (&t, c);
  35. }
  36. mp_clear (&t);
  37. return res;
  38. }
  39. #endif
  40. /* $Source: /cvs/libtom/libtommath/bn_mp_mod.c,v $ */
  41. /* $Revision: 1.3 $ */
  42. /* $Date: 2006/03/31 14:18:44 $ */