Mercurial > dropbear
comparison libtomcrypt/src/misc/mpi/is_prime.c @ 285:1b9e69c058d2
propagate from branch 'au.asn.ucc.matt.ltc.dropbear' (head 20dccfc09627970a312d77fb41dc2970b62689c3)
to branch 'au.asn.ucc.matt.dropbear' (head fdf4a7a3b97ae5046139915de7e40399cceb2c01)
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Wed, 08 Mar 2006 13:23:58 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
281:997e6f7dc01e | 285:1b9e69c058d2 |
---|---|
1 /* LibTomCrypt, modular cryptographic library -- Tom St Denis | |
2 * | |
3 * LibTomCrypt is a library that provides various cryptographic | |
4 * algorithms in a highly modular and flexible manner. | |
5 * | |
6 * The library is free for all purposes without any express | |
7 * guarantee it works. | |
8 * | |
9 * Tom St Denis, [email protected], http://libtomcrypt.org | |
10 */ | |
11 #include "tomcrypt.h" | |
12 | |
13 /** | |
14 @file is_prime.c | |
15 Determines if integer is prime for LTC, Tom St Denis | |
16 */ | |
17 | |
18 #ifdef MPI | |
19 | |
20 /* figures out if a number is prime (MR test) */ | |
21 int is_prime(mp_int *N, int *result) | |
22 { | |
23 int err; | |
24 LTC_ARGCHK(N != NULL); | |
25 LTC_ARGCHK(result != NULL); | |
26 if ((err = mp_prime_is_prime(N, mp_prime_rabin_miller_trials(mp_count_bits(N)), result)) != MP_OKAY) { | |
27 return mpi_to_ltc_error(err); | |
28 } | |
29 return CRYPT_OK; | |
30 } | |
31 | |
32 #endif | |
33 | |
34 /* $Source: /cvs/libtom/libtomcrypt/src/misc/mpi/is_prime.c,v $ */ | |
35 /* $Revision: 1.3 $ */ | |
36 /* $Date: 2005/05/05 14:35:59 $ */ |