kc3-lang/libtommath/bn_mp_mod_2d.c

• Show log

  Commit

• Hash : 61d9e528
  Author :
  Date : 2019-05-11T10:22:20
  

  hardening: add MP_ZERO_BUFFER, MP_ZERO_DIGITS * (!) Always zero buffer before freeing if MP_NO_ZERO_ON_FREE is not defined * Add MP_NO_ZERO_ON_FREE to disable hardening * Add MP_ZERO_BUFFER, MP_ZERO_DIGITS, MP_FREE_BUFFFER, MP_FREE_DIGITS * Never use MP_FREE directly, use MP_FREE_DIGITS or MP_FREE_BUFFER * Add MP_USE_MEMSET to use memset instead of loop * Disable astyle backups which are annonying in the times of git

Download

• bn_mp_mod_2d.c

• #include "tommath_private.h"
  #ifdef BN_MP_MOD_2D_C
  /* LibTomMath, multiple-precision integer library -- Tom St Denis */
  /* SPDX-License-Identifier: Unlicense */
  
  /* calc a value mod 2**b */
  int mp_mod_2d(const mp_int *a, int b, mp_int *c)
  {
     int     x, res;
  
     /* if b is <= 0 then zero the int */
     if (b <= 0) {
        mp_zero(c);
        return MP_OKAY;
     }
  
     /* if the modulus is larger than the value than return */
     if (b >= (a->used * MP_DIGIT_BIT)) {
        return mp_copy(a, c);
     }
  
     /* copy */
     if ((res = mp_copy(a, c)) != MP_OKAY) {
        return res;
     }
  
     /* zero digits above the last digit of the modulus */
     x = (b / MP_DIGIT_BIT) + (((b % MP_DIGIT_BIT) == 0) ? 0 : 1);
     MP_ZERO_DIGITS(c->dp + x, c->used - x);
  
     /* clear the digit that is not completely outside/inside the modulus */
     c->dp[b / MP_DIGIT_BIT] &=
        ((mp_digit)1 << (mp_digit)(b % MP_DIGIT_BIT)) - (mp_digit)1;
     mp_clamp(c);
     return MP_OKAY;
  }
  #endif
  

Download