Mercurial > dropbear
comparison libtomcrypt/src/misc/mpi/is_prime.c @ 330:5488db2e9e4e
merge of 332f709a4cb39cde4cedab7c3be89e05f3023067
and ca4ca78b82c5d430c69ce01bf794e8886ce81431
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Sat, 10 Jun 2006 16:39:40 +0000 |
parents | 1b9e69c058d2 |
children |
comparison
equal
deleted
inserted
replaced
329:8ed0dce45126 | 330:5488db2e9e4e |
---|---|
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 $ */ |