mirror of
http://galexander.org/git/simplesshd.git
synced 2024-11-27 09:48:08 +00:00
53 lines
1.3 KiB
C
53 lines
1.3 KiB
C
|
#include <tommath.h>
|
||
|
|
#ifdef BN_MP_PRIME_RABIN_MILLER_TRIALS_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@gmail.com, http://math.libtomcrypt.com
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
static const struct {
|
||
|
|
int k, t;
|
||
|
|
} sizes[] = {
|
||
|
|
{ 128, 28 },
|
||
|
|
{ 256, 16 },
|
||
|
|
{ 384, 10 },
|
||
|
|
{ 512, 7 },
|
||
|
|
{ 640, 6 },
|
||
|
|
{ 768, 5 },
|
||
|
|
{ 896, 4 },
|
||
|
|
{ 1024, 4 }
|
||
|
|
};
|
||
|
|
|
||
|
|
/* returns # of RM trials required for a given bit size */
|
||
|
|
int mp_prime_rabin_miller_trials(int size)
|
||
|
|
{
|
||
|
|
int x;
|
||
|
|
|
||
|
|
for (x = 0; x < (int)(sizeof(sizes)/(sizeof(sizes[0]))); x++) {
|
||
|
|
if (sizes[x].k == size) {
|
||
|
|
return sizes[x].t;
|
||
|
|
} else if (sizes[x].k > size) {
|
||
|
|
return (x == 0) ? sizes[0].t : sizes[x - 1].t;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return sizes[x-1].t + 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|
||
|
|
/* $Source: /cvs/libtom/libtommath/bn_mp_prime_rabin_miller_trials.c,v $ */
|
||
|
|
/* $Revision: 1.3 $ */
|
||
|
|
/* $Date: 2006/03/31 14:18:44 $ */
|