diff options
author | Theo de Raadt <deraadt@cvs.openbsd.org> | 1998-11-14 23:37:31 +0000 |
---|---|---|
committer | Theo de Raadt <deraadt@cvs.openbsd.org> | 1998-11-14 23:37:31 +0000 |
commit | 1264df3a5da0b4ba93aa3f250a20101bcc19e1ca (patch) | |
tree | ec96c7e83c6ea2756e246d730c9ceddb9ea8a1d6 /sbin/photurisd/modulus.h | |
parent | bf316445157edd81f8d5e3f6e30d26fe295990bb (diff) |
move ipsec tools into .
Diffstat (limited to 'sbin/photurisd/modulus.h')
-rw-r--r-- | sbin/photurisd/modulus.h | 95 |
1 files changed, 95 insertions, 0 deletions
diff --git a/sbin/photurisd/modulus.h b/sbin/photurisd/modulus.h new file mode 100644 index 00000000000..bf76b4cae49 --- /dev/null +++ b/sbin/photurisd/modulus.h @@ -0,0 +1,95 @@ +/* + * Copyright 1997 Niels Provos <provos@physnet.uni-hamburg.de> + * All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in the + * documentation and/or other materials provided with the distribution. + * 3. All advertising materials mentioning features or use of this software + * must display the following acknowledgement: + * This product includes software developed by Niels Provos. + * 4. The name of the author may not be used to endorse or promote products + * derived from this software without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR + * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES + * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. + * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, + * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT + * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, + * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY + * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT + * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF + * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + */ +/* $Id: modulus.h,v 1.1 1998/11/14 23:37:25 deraadt Exp $ */ +/* + * modulus.h: + * modulus handling functions + */ + +#ifndef _MODULUS_H_ +#define _MODULUS_H_ + +#undef EXTERN + +#ifdef _MODULUS_C_ +#define EXTERN +#else +#define EXTERN extern +#endif + +#include "gmp.h" + +/* Possible values for the status field */ + +#define MOD_UNUSED 0 +#define MOD_COMPUTING 1 +#define MOD_PRIME 2 +#define MOD_NOTPRIME 3 + +#define MOD_PRIME_ITER 5 /* Do each cycle */ +#define MOD_PRIME_MAX 20 /* > => Is prime */ +#define MOD_PRIME_TIME 4 /* max time in mod_check_prime */ + +#define MOD_TIMEOUT 120 + +struct moduli_cache { + struct moduli_cache *next; /* Link to next member */ + mpz_t modulus; /* Modulus for computation */ + mpz_t generator; /* Used generator */ + mpz_t private_value; /* Our own private value */ + u_int8_t *exchangevalue; /* Our own exchange value */ + u_int16_t exchangesize; + int iterations; /* primality check iterations */ + int status; /* Status of the modulus */ + time_t lifetime; /* For modulus + exchange value */ +}; + +/* Prototypes */ +int mod_insert(struct moduli_cache *ob); +int mod_unlink(struct moduli_cache *ob); + +struct moduli_cache *mod_new_modgen(mpz_t m, mpz_t g); +struct moduli_cache *mod_new_modulus(mpz_t m); + +int mod_value_reset(struct moduli_cache *ob); + +struct moduli_cache *mod_find_modgen(mpz_t modulus, mpz_t generator); +struct moduli_cache *mod_find_modgen_next(struct moduli_cache *ob, mpz_t modulus, mpz_t generator); +struct moduli_cache *mod_find_modulus(mpz_t modulus); +struct moduli_cache *mod_find_generator(mpz_t generator); +struct moduli_cache *mod_find_modulus_next(struct moduli_cache *ob, mpz_t modulus); +struct moduli_cache *mod_find_generator_next(struct moduli_cache *ob, mpz_t generator); + +void mod_check_prime(int iter, int tm); + +void mod_cleanup(void); + + +#endif |