summaryrefslogtreecommitdiffhomepage
path: root/libtomcrypt/src/misc/mpi/rand_prime.c
diff options
context:
space:
mode:
authorMatt Johnston <matt@ucc.asn.au>2008-11-06 13:16:55 +0000
committerMatt Johnston <matt@ucc.asn.au>2008-11-06 13:16:55 +0000
commit800810a1816a0ac29ba2f5c77f8eed11a97566af (patch)
treedf044012cc8a0c94635a4469c3078d0e14497c3d /libtomcrypt/src/misc/mpi/rand_prime.c
parent3301bad391f5792e9aa35a01d4e0aa0566fef303 (diff)
parente80f8e8c09dab7cece30660a33e2a2bfd5d5f571 (diff)
propagate from branch 'au.asn.ucc.matt.dropbear' (head cdcc3c729e29544e8b98a408e2dc60e4483dfd2a)
to branch 'au.asn.ucc.matt.dropbear.insecure-nocrypto' (head 0ca38a1cf349f7426ac9de34ebe4c3e3735effab) --HG-- branch : insecure-nocrypto extra : convert_revision : dbb093e087a68abf2e54ab0b711af70771ddb29d
Diffstat (limited to 'libtomcrypt/src/misc/mpi/rand_prime.c')
-rw-r--r--libtomcrypt/src/misc/mpi/rand_prime.c70
1 files changed, 0 insertions, 70 deletions
diff --git a/libtomcrypt/src/misc/mpi/rand_prime.c b/libtomcrypt/src/misc/mpi/rand_prime.c
deleted file mode 100644
index 9c5921a..0000000
--- a/libtomcrypt/src/misc/mpi/rand_prime.c
+++ /dev/null
@@ -1,70 +0,0 @@
-/* LibTomCrypt, modular cryptographic library -- Tom St Denis
- *
- * LibTomCrypt is a library that provides various cryptographic
- * algorithms in a highly modular and flexible manner.
- *
- * The library is free for all purposes without any express
- * guarantee it works.
- *
- * Tom St Denis, tomstdenis@gmail.com, http://libtomcrypt.org
- */
-#include "tomcrypt.h"
-
-/**
- @file rand_prime.c
- Generate a random prime, Tom St Denis
-*/
-#ifdef MPI
-
-struct rng_data {
- prng_state *prng;
- int wprng;
-};
-
-static int rand_prime_helper(unsigned char *dst, int len, void *dat)
-{
- return (int)prng_descriptor[((struct rng_data *)dat)->wprng].read(dst, len, ((struct rng_data *)dat)->prng);
-}
-
-int rand_prime(mp_int *N, long len, prng_state *prng, int wprng)
-{
- struct rng_data rng;
- int type, err;
-
- LTC_ARGCHK(N != NULL);
-
- /* allow sizes between 2 and 256 bytes for a prime size */
- if (len < 16 || len > 4096) {
- return CRYPT_INVALID_PRIME_SIZE;
- }
-
- /* valid PRNG? Better be! */
- if ((err = prng_is_valid(wprng)) != CRYPT_OK) {
- return err;
- }
-
- /* setup our callback data, then world domination! */
- rng.prng = prng;
- rng.wprng = wprng;
-
- /* get type */
- if (len < 0) {
- type = LTM_PRIME_BBS;
- len = -len;
- } else {
- type = 0;
- }
- type |= LTM_PRIME_2MSB_ON;
-
- /* New prime generation makes the code even more cryptoish-insane. Do you know what this means!!!
- -- Gir: Yeah, oh wait, er, no.
- */
- return mpi_to_ltc_error(mp_prime_random_ex(N, mp_prime_rabin_miller_trials(len), len, type, rand_prime_helper, &rng));
-}
-
-#endif
-
-
-/* $Source: /cvs/libtom/libtomcrypt/src/misc/mpi/rand_prime.c,v $ */
-/* $Revision: 1.3 $ */
-/* $Date: 2005/05/05 14:35:59 $ */