1af0de1f91
* same behavior for positive numbers * generalisation for negative numbers, treating them as two complement * improve algorithm, iterate once over the digits, manually perform two complement * simplify mp_add_d, mp_sub_d * functions are safe in case of a==c or b==c * renamed mp_tc_div_2d to mp_signed_rsh (signed right shift)
150 lines
3.4 KiB
C
150 lines
3.4 KiB
C
#include "tommath_private.h"
|
|
#ifdef BN_DEPRECATED_C
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
|
|
/* SPDX-License-Identifier: Unlicense */
|
|
|
|
#ifdef BN_MP_GET_BIT_C
|
|
int mp_get_bit(const mp_int *a, int b)
|
|
{
|
|
if (b < 0) {
|
|
return MP_VAL;
|
|
}
|
|
return s_mp_get_bit(a, (unsigned int)b) == MP_YES ? MP_YES : MP_NO;
|
|
}
|
|
#endif
|
|
#ifdef BN_S_MP_JACOBI_C
|
|
mp_err s_mp_jacobi(const mp_int *a, const mp_int *n, int *c)
|
|
{
|
|
if (a->sign == MP_NEG) {
|
|
return MP_VAL;
|
|
}
|
|
if (mp_cmp_d(n, 0uL) != MP_GT) {
|
|
return MP_VAL;
|
|
}
|
|
return mp_kronecker(a, n, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_JACOBI_C
|
|
mp_err mp_jacobi(const mp_int *a, const mp_int *n, int *c)
|
|
{
|
|
return s_mp_jacobi(a, n, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_PRIME_RANDOM_EX_C
|
|
mp_err mp_prime_random_ex(mp_int *a, int t, int size, int flags, private_mp_prime_callback cb, void *dat)
|
|
{
|
|
return s_mp_prime_random_ex(a, t, size, flags, cb, dat);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_RAND_DIGIT_C
|
|
mp_err mp_rand_digit(mp_digit *r)
|
|
{
|
|
mp_err err = s_mp_rand_source(r, sizeof(mp_digit));
|
|
*r &= MP_MASK;
|
|
return err;
|
|
}
|
|
#endif
|
|
#ifdef BN_FAST_MP_INVMOD_C
|
|
mp_err fast_mp_invmod(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
return s_mp_invmod_fast(a, b, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_FAST_MP_MONTGOMERY_REDUCE_C
|
|
mp_err fast_mp_montgomery_reduce(mp_int *x, const mp_int *n, mp_digit rho)
|
|
{
|
|
return s_mp_montgomery_reduce_fast(x, n, rho);
|
|
}
|
|
#endif
|
|
#ifdef BN_FAST_S_MP_MUL_DIGS_C
|
|
mp_err fast_s_mp_mul_digs(const mp_int *a, const mp_int *b, mp_int *c, int digs)
|
|
{
|
|
return s_mp_mul_digs_fast(a, b, c, digs);
|
|
}
|
|
#endif
|
|
#ifdef BN_FAST_S_MP_MUL_HIGH_DIGS_C
|
|
mp_err fast_s_mp_mul_high_digs(const mp_int *a, const mp_int *b, mp_int *c, int digs)
|
|
{
|
|
return s_mp_mul_high_digs_fast(a, b, c, digs);
|
|
}
|
|
#endif
|
|
#ifdef BN_FAST_S_MP_SQR_C
|
|
mp_err fast_s_mp_sqr(const mp_int *a, mp_int *b)
|
|
{
|
|
return s_mp_sqr_fast(a, b);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_BALANCE_MUL_C
|
|
mp_err mp_balance_mul(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
return s_mp_balance_mul(a, b, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_EXPTMOD_FAST_C
|
|
mp_err mp_exptmod_fast(const mp_int *G, const mp_int *X, const mp_int *P, mp_int *Y, int redmode)
|
|
{
|
|
return s_mp_exptmod_fast(G, X, P, Y, redmode);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_INVMOD_SLOW_C
|
|
mp_err mp_invmod_slow(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
return s_mp_invmod_slow(a, b, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_KARATSUBA_MUL_C
|
|
mp_err mp_karatsuba_mul(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
return s_mp_karatsuba_mul(a, b, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_KARATSUBA_SQR_C
|
|
mp_err mp_karatsuba_sqr(const mp_int *a, mp_int *b)
|
|
{
|
|
return s_mp_karatsuba_sqr(a, b);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_TOOM_MUL_C
|
|
mp_err mp_toom_mul(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
return s_mp_toom_mul(a, b, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_TOOM_SQR_C
|
|
mp_err mp_toom_sqr(const mp_int *a, mp_int *b)
|
|
{
|
|
return s_mp_toom_sqr(a, b);
|
|
}
|
|
#endif
|
|
#ifdef S_MP_REVERSE_C
|
|
void bn_reverse(unsigned char *s, int len)
|
|
{
|
|
s_mp_reverse(s, len);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_TC_AND_C
|
|
mp_err mp_tc_and(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
return mp_and(a, b, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_TC_OR_C
|
|
mp_err mp_tc_or(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
return mp_or(a, b, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_TC_XOR_C
|
|
mp_err mp_tc_xor(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
return mp_xor(a, b, c);
|
|
}
|
|
#endif
|
|
#ifdef BN_MP_TC_DIV_2D_C
|
|
mp_err mp_tc_div_2d(const mp_int *a, int b, mp_int *c)
|
|
{
|
|
return mp_signed_rsh(a, b, c);
|
|
}
|
|
#endif
|
|
#endif
|