mirror of
https://github.com/clearml/dropbear
synced 2025-02-24 21:03:55 +00:00
615ed4e46a
* make key-generation compliant to FIPS 186.4 * fix includes in tommath_class.h * update fuzzcorpus instead of error-out * fixup fuzzing make-targets * update Makefile.in * apply necessary patches to ltm sources * clean-up not required ltm files * update to vanilla ltm 1.1.0 this already only contains the required files * remove set/get double
48 lines
1.2 KiB
C
48 lines
1.2 KiB
C
#include "tommath_private.h"
|
|
#ifdef BN_MP_PRIME_IS_DIVISIBLE_C
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
*
|
|
* LibTomMath is a library that provides multiple-precision
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
*
|
|
* The library was designed directly after the MPI library by
|
|
* Michael Fromberger but has been written from scratch with
|
|
* additional optimizations in place.
|
|
*
|
|
* SPDX-License-Identifier: Unlicense
|
|
*/
|
|
|
|
/* determines if an integers is divisible by one
|
|
* of the first PRIME_SIZE primes or not
|
|
*
|
|
* sets result to 0 if not, 1 if yes
|
|
*/
|
|
int mp_prime_is_divisible(const mp_int *a, int *result)
|
|
{
|
|
int err, ix;
|
|
mp_digit res;
|
|
|
|
/* default to not */
|
|
*result = MP_NO;
|
|
|
|
for (ix = 0; ix < PRIME_SIZE; ix++) {
|
|
/* what is a mod LBL_prime_tab[ix] */
|
|
if ((err = mp_mod_d(a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
|
|
return err;
|
|
}
|
|
|
|
/* is the residue zero? */
|
|
if (res == 0u) {
|
|
*result = MP_YES;
|
|
return MP_OKAY;
|
|
}
|
|
}
|
|
|
|
return MP_OKAY;
|
|
}
|
|
#endif
|
|
|
|
/* ref: HEAD -> master, tag: v1.1.0 */
|
|
/* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
|
|
/* commit time: 2019-01-28 20:32:32 +0100 */
|