• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /* $OpenBSD: dh.h,v 1.10 2008/06/26 09:19:40 djm Exp $ */
2 
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 
35 DH	*choose_dh(int, int, int);
36 DH	*dh_new_group_asc(const char *, const char *);
37 DH	*dh_new_group(BIGNUM *, BIGNUM *);
38 DH	*dh_new_group1(void);
39 DH	*dh_new_group14(void);
40 
41 void	 dh_gen_key(DH *, int);
42 int	 dh_pub_is_valid(DH *, BIGNUM *);
43 
44 int	 dh_estimate(int);
45 
46 #define DH_GRP_MIN	1024
47 #define DH_GRP_MAX	8192
48 
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 
73 #endif
74