bn_mp_xor.c 1.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051
  1. #include <tommath.h>
  2. #ifdef BN_MP_XOR_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. /* XOR two ints together */
  18. int
  19. mp_xor (mp_int * a, mp_int * b, mp_int * c)
  20. {
  21. int res, ix, px;
  22. mp_int t, *x;
  23. if (a->used > b->used) {
  24. if ((res = mp_init_copy (&t, a)) != MP_OKAY) {
  25. return res;
  26. }
  27. px = b->used;
  28. x = b;
  29. } else {
  30. if ((res = mp_init_copy (&t, b)) != MP_OKAY) {
  31. return res;
  32. }
  33. px = a->used;
  34. x = a;
  35. }
  36. for (ix = 0; ix < px; ix++) {
  37. t.dp[ix] ^= x->dp[ix];
  38. }
  39. mp_clamp (&t);
  40. mp_exch (c, &t);
  41. mp_clear (&t);
  42. return MP_OKAY;
  43. }
  44. #endif
  45. /* $Source: /cvs/libtom/libtommath/bn_mp_xor.c,v $ */
  46. /* $Revision: 1.3 $ */
  47. /* $Date: 2006/03/31 14:18:44 $ */