[openssh.git] / dh.h

/* $OpenBSD: dh.h,v 1.10 2008/06/26 09:19:40 djm Exp $ */

/*
 * Copyright (c) 2000 Niels Provos.  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.
 *
 * 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.
 */
#ifndef DH_H
#define DH_H

struct dhgroup {
	int size;
	BIGNUM *g;
	BIGNUM *p;
};

DH	*choose_dh(int, int, int);
DH	*dh_new_group_asc(const char *, const char *);
DH	*dh_new_group(BIGNUM *, BIGNUM *);
DH	*dh_new_group1(void);
DH	*dh_new_group14(void);

void	 dh_gen_key(DH *, int);
int	 dh_pub_is_valid(DH *, BIGNUM *);

int	 dh_estimate(int);

#define DH_GRP_MIN	1024
#define DH_GRP_MAX	8192

/*
 * Values for "type" field of moduli(5)
 * Specifies the internal structure of the prime modulus.
 */
#define MODULI_TYPE_UNKNOWN		(0)
#define MODULI_TYPE_UNSTRUCTURED	(1)
#define MODULI_TYPE_SAFE		(2)
#define MODULI_TYPE_SCHNORR		(3)
#define MODULI_TYPE_SOPHIE_GERMAIN	(4)
#define MODULI_TYPE_STRONG		(5)

/*
 * Values for "tests" field of moduli(5)
 * Specifies the methods used in checking for primality.
 * Usually, more than one test is used.
 */
#define MODULI_TESTS_UNTESTED		(0x00)
#define MODULI_TESTS_COMPOSITE		(0x01)
#define MODULI_TESTS_SIEVE		(0x02)
#define MODULI_TESTS_MILLER_RABIN	(0x04)
#define MODULI_TESTS_JACOBI		(0x08)
#define MODULI_TESTS_ELLIPTIC		(0x10)


#endif
Commit	Line	Data
b080d398	1	/* $OpenBSD: dh.h,v 1.10 2008/06/26 09:19:40 djm Exp $ */
23c2a7a5	2
94ec8c6b	3	/*
	4	* Copyright (c) 2000 Niels Provos. All rights reserved.
	5	*
	6	* Redistribution and use in source and binary forms, with or without
	7	* modification, are permitted provided that the following conditions
	8	* are met:
	9	* 1. Redistributions of source code must retain the above copyright
	10	* notice, this list of conditions and the following disclaimer.
	11	* 2. Redistributions in binary form must reproduce the above copyright
	12	* notice, this list of conditions and the following disclaimer in the
	13	* documentation and/or other materials provided with the distribution.
	14	*
	15	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
	16	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
	17	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
	18	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
	19	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
	20	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
	21	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
	22	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	23	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
	24	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	25	*/
	26	#ifndef DH_H
	27	#define DH_H
	28
	29	struct dhgroup {
	30	int size;
	31	BIGNUM *g;
	32	BIGNUM *p;
	33	};
	34
2a1e4639	35	DH *choose_dh(int, int, int);
03b8f8be	36	DH dh_new_group_asc(const char , const char *);
	37	DH dh_new_group(BIGNUM , BIGNUM *);
	38	DH *dh_new_group1(void);
41e5bd9a	39	DH *dh_new_group14(void);
03b8f8be	40
255cabd9	41	void dh_gen_key(DH *, int);
255cabd9	42	int dh_pub_is_valid(DH , BIGNUM );
db1cd2f3	43
255cabd9	44	int dh_estimate(int);
a5c9ffdb	45
db1cd2f3	46	#define DH_GRP_MIN 1024
db1cd2f3	47	#define DH_GRP_MAX 8192
94ec8c6b	48
b080d398	49	/*
	50	* Values for "type" field of moduli(5)
	51	* Specifies the internal structure of the prime modulus.
	52	*/
	53	#define MODULI_TYPE_UNKNOWN (0)
	54	#define MODULI_TYPE_UNSTRUCTURED (1)
	55	#define MODULI_TYPE_SAFE (2)
	56	#define MODULI_TYPE_SCHNORR (3)
	57	#define MODULI_TYPE_SOPHIE_GERMAIN (4)
	58	#define MODULI_TYPE_STRONG (5)
	59
	60	/*
	61	* Values for "tests" field of moduli(5)
	62	* Specifies the methods used in checking for primality.
	63	* Usually, more than one test is used.
	64	*/
	65	#define MODULI_TESTS_UNTESTED (0x00)
	66	#define MODULI_TESTS_COMPOSITE (0x01)
	67	#define MODULI_TESTS_SIEVE (0x02)
	68	#define MODULI_TESTS_MILLER_RABIN (0x04)
	69	#define MODULI_TESTS_JACOBI (0x08)
	70	#define MODULI_TESTS_ELLIPTIC (0x10)
	71
	72
94ec8c6b	73	#endif