mirror of
https://github.com/clearml/dropbear
synced 2025-02-08 21:54:13 +00:00
8608a8e64c
to branch 'au.asn.ucc.matt.dropbear' (head fff0894a0399405a9410ea1c6d118f342cf2aa64) --HG-- extra : convert_revision : fdf4a7a3b97ae5046139915de7e40399cceb2c01
40 lines
988 B
C
40 lines
988 B
C
#include <tommath.h>
|
|
#ifdef BN_MP_DR_IS_MODULUS_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.
|
|
*
|
|
* The library is free for all purposes without any express
|
|
* guarantee it works.
|
|
*
|
|
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
|
|
*/
|
|
|
|
/* determines if a number is a valid DR modulus */
|
|
int mp_dr_is_modulus(mp_int *a)
|
|
{
|
|
int ix;
|
|
|
|
/* must be at least two digits */
|
|
if (a->used < 2) {
|
|
return 0;
|
|
}
|
|
|
|
/* must be of the form b**k - a [a <= b] so all
|
|
* but the first digit must be equal to -1 (mod b).
|
|
*/
|
|
for (ix = 1; ix < a->used; ix++) {
|
|
if (a->dp[ix] != MP_MASK) {
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
#endif
|