]>
Commit | Line | Data |
---|---|---|
d02b48c6 RE |
1 | /* apps/gendh.c */ |
2 | /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) | |
3 | * All rights reserved. | |
4 | * | |
5 | * This package is an SSL implementation written | |
6 | * by Eric Young (eay@cryptsoft.com). | |
7 | * The implementation was written so as to conform with Netscapes SSL. | |
8 | * | |
9 | * This library is free for commercial and non-commercial use as long as | |
10 | * the following conditions are aheared to. The following conditions | |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
13 | * included with this distribution is covered by the same copyright terms | |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
15 | * | |
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
17 | * the code are not to be removed. | |
18 | * If this package is used in a product, Eric Young should be given attribution | |
19 | * as the author of the parts of the library used. | |
20 | * This can be in the form of a textual message at program startup or | |
21 | * in documentation (online or textual) provided with the package. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
26 | * 1. Redistributions of source code must retain the copyright | |
27 | * notice, this list of conditions and the following disclaimer. | |
28 | * 2. Redistributions in binary form must reproduce the above copyright | |
29 | * notice, this list of conditions and the following disclaimer in the | |
30 | * documentation and/or other materials provided with the distribution. | |
31 | * 3. All advertising materials mentioning features or use of this software | |
32 | * must display the following acknowledgement: | |
33 | * "This product includes cryptographic software written by | |
34 | * Eric Young (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
38 | * the apps directory (application code) you must include an acknowledgement: | |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
40 | * | |
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
51 | * SUCH DAMAGE. | |
52 | * | |
53 | * The licence and distribution terms for any publically available version or | |
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
55 | * copied and put under another distribution licence | |
56 | * [including the GNU Public Licence.] | |
57 | */ | |
58 | ||
59 | #include <stdio.h> | |
60 | #include <string.h> | |
61 | #include <sys/types.h> | |
62 | #include <sys/stat.h> | |
63 | #include "apps.h" | |
64 | #include "bio.h" | |
65 | #include "rand.h" | |
66 | #include "err.h" | |
67 | #include "bn.h" | |
68 | #include "dh.h" | |
69 | #include "x509.h" | |
70 | #include "pem.h" | |
71 | ||
72 | #define DEFBITS 512 | |
73 | #undef PROG | |
74 | #define PROG gendh_main | |
75 | ||
76 | #ifndef NOPROTO | |
77 | static void MS_CALLBACK dh_cb(int p, int n); | |
78 | static long dh_load_rand(char *names); | |
79 | #else | |
80 | static void MS_CALLBACK dh_cb(); | |
81 | static long dh_load_rand(); | |
82 | #endif | |
83 | ||
84 | int MAIN(argc, argv) | |
85 | int argc; | |
86 | char **argv; | |
87 | { | |
88 | char buffer[200]; | |
89 | DH *dh=NULL; | |
90 | int ret=1,num=DEFBITS; | |
91 | int g=2; | |
92 | char *outfile=NULL; | |
93 | char *inrand=NULL,*randfile; | |
94 | BIO *out=NULL; | |
95 | ||
96 | apps_startup(); | |
97 | ||
98 | if (bio_err == NULL) | |
99 | if ((bio_err=BIO_new(BIO_s_file())) != NULL) | |
100 | BIO_set_fp(bio_err,stderr,BIO_NOCLOSE); | |
101 | ||
102 | argv++; | |
103 | argc--; | |
104 | for (;;) | |
105 | { | |
106 | if (argc <= 0) break; | |
107 | if (strcmp(*argv,"-out") == 0) | |
108 | { | |
109 | if (--argc < 1) goto bad; | |
110 | outfile= *(++argv); | |
111 | } | |
112 | else if (strcmp(*argv,"-2") == 0) | |
113 | g=2; | |
114 | /* else if (strcmp(*argv,"-3") == 0) | |
115 | g=3; */ | |
116 | else if (strcmp(*argv,"-5") == 0) | |
117 | g=5; | |
118 | else if (strcmp(*argv,"-rand") == 0) | |
119 | { | |
120 | if (--argc < 1) goto bad; | |
121 | inrand= *(++argv); | |
122 | } | |
123 | else | |
124 | break; | |
125 | argv++; | |
126 | argc--; | |
127 | } | |
128 | if ((argc >= 1) && ((sscanf(*argv,"%d",&num) == 0) || (num < 0))) | |
129 | { | |
130 | bad: | |
131 | BIO_printf(bio_err,"usage: gendh [args] [numbits]\n"); | |
132 | BIO_printf(bio_err," -out file - output the key to 'file\n"); | |
133 | BIO_printf(bio_err," -2 use 2 as the generator value\n"); | |
134 | /* BIO_printf(bio_err," -3 use 3 as the generator value\n"); */ | |
135 | BIO_printf(bio_err," -5 use 5 as the generator value\n"); | |
136 | BIO_printf(bio_err," -rand file:file:...\n"); | |
137 | BIO_printf(bio_err," - load the file (or the files in the directory) into\n"); | |
138 | BIO_printf(bio_err," the random number generator\n"); | |
139 | goto end; | |
140 | } | |
141 | ||
142 | out=BIO_new(BIO_s_file()); | |
143 | if (out == NULL) | |
144 | { | |
145 | ERR_print_errors(bio_err); | |
146 | goto end; | |
147 | } | |
148 | ||
149 | if (outfile == NULL) | |
150 | BIO_set_fp(out,stdout,BIO_NOCLOSE); | |
151 | else | |
152 | { | |
153 | if (BIO_write_filename(out,outfile) <= 0) | |
154 | { | |
155 | perror(outfile); | |
156 | goto end; | |
157 | } | |
158 | } | |
159 | ||
160 | randfile=RAND_file_name(buffer,200); | |
161 | if ((randfile == NULL)|| !RAND_load_file(randfile,1024L*1024L)) | |
162 | BIO_printf(bio_err,"unable to load 'random state'\n"); | |
163 | ||
164 | if (inrand == NULL) | |
165 | BIO_printf(bio_err,"warning, not much extra random data, consider using the -rand option\n"); | |
166 | else | |
167 | { | |
168 | BIO_printf(bio_err,"%ld semi-random bytes loaded\n", | |
169 | dh_load_rand(inrand)); | |
170 | } | |
171 | ||
172 | BIO_printf(bio_err,"Generating DH parameters, %d bit long strong prime, generator of %d\n",num,g); | |
173 | BIO_printf(bio_err,"This is going to take a long time\n"); | |
174 | dh=DH_generate_parameters(num,g,dh_cb); | |
175 | ||
176 | if (dh == NULL) goto end; | |
177 | ||
178 | if (randfile == NULL) | |
179 | BIO_printf(bio_err,"unable to write 'random state'\n"); | |
180 | else | |
181 | RAND_write_file(randfile); | |
182 | ||
183 | if (!PEM_write_bio_DHparams(out,dh)) | |
184 | goto end; | |
185 | ret=0; | |
186 | end: | |
187 | if (ret != 0) | |
188 | ERR_print_errors(bio_err); | |
189 | if (out != NULL) BIO_free(out); | |
190 | if (dh != NULL) DH_free(dh); | |
191 | EXIT(ret); | |
192 | } | |
193 | ||
194 | static void MS_CALLBACK dh_cb(p, n) | |
195 | int p; | |
196 | int n; | |
197 | { | |
198 | char c='*'; | |
199 | ||
200 | if (p == 0) c='.'; | |
201 | if (p == 1) c='+'; | |
202 | if (p == 2) c='*'; | |
203 | if (p == 3) c='\n'; | |
204 | BIO_write(bio_err,&c,1); | |
205 | BIO_flush(bio_err); | |
206 | #ifdef LINT | |
207 | p=n; | |
208 | #endif | |
209 | } | |
210 | ||
211 | static long dh_load_rand(name) | |
212 | char *name; | |
213 | { | |
214 | char *p,*n; | |
215 | int last; | |
216 | long tot=0; | |
217 | ||
218 | for (;;) | |
219 | { | |
220 | last=0; | |
221 | for (p=name; ((*p != '\0') && (*p != LIST_SEPARATOR_CHAR)); p++); | |
222 | if (*p == '\0') last=1; | |
223 | *p='\0'; | |
224 | n=name; | |
225 | name=p+1; | |
226 | if (*n == '\0') break; | |
227 | ||
228 | tot+=RAND_load_file(n,1); | |
229 | if (last) break; | |
230 | } | |
231 | return(tot); | |
232 | } | |
233 | ||
234 |