]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* apps/gendsa.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
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 "dsa.h" | |
69 | #include "x509.h" | |
70 | #include "pem.h" | |
71 | ||
72 | #define DEFBITS 512 | |
73 | #undef PROG | |
74 | #define PROG gendsa_main | |
75 | ||
76 | #ifndef NOPROTO | |
77 | static long dsa_load_rand(char *names); | |
78 | #else | |
79 | static long dsa_load_rand(); | |
80 | #endif | |
81 | ||
82 | int MAIN(argc, argv) | |
83 | int argc; | |
84 | char **argv; | |
85 | { | |
86 | char buffer[200]; | |
87 | DSA *dsa=NULL; | |
88 | int ret=1,num=DEFBITS; | |
89 | char *outfile=NULL; | |
90 | char *inrand=NULL,*randfile,*dsaparams=NULL; | |
91 | BIO *out=NULL,*in=NULL; | |
92 | ||
93 | apps_startup(); | |
94 | ||
95 | if (bio_err == NULL) | |
96 | if ((bio_err=BIO_new(BIO_s_file())) != NULL) | |
58964a49 | 97 | BIO_set_fp(bio_err,stderr,BIO_NOCLOSE|BIO_FP_TEXT); |
d02b48c6 RE |
98 | |
99 | argv++; | |
100 | argc--; | |
101 | for (;;) | |
102 | { | |
103 | if (argc <= 0) break; | |
104 | if (strcmp(*argv,"-out") == 0) | |
105 | { | |
106 | if (--argc < 1) goto bad; | |
107 | outfile= *(++argv); | |
108 | } | |
109 | else if (strcmp(*argv,"-rand") == 0) | |
110 | { | |
111 | if (--argc < 1) goto bad; | |
112 | inrand= *(++argv); | |
113 | } | |
114 | else if (strcmp(*argv,"-") == 0) | |
115 | goto bad; | |
116 | else if (dsaparams == NULL) | |
117 | { | |
118 | dsaparams= *argv; | |
119 | } | |
120 | else | |
121 | goto bad; | |
122 | argv++; | |
123 | argc--; | |
124 | } | |
125 | ||
126 | if (dsaparams == NULL) | |
127 | { | |
128 | bad: | |
129 | BIO_printf(bio_err,"usage: gendsa [args] [numbits]\n"); | |
130 | BIO_printf(bio_err," -out file - output the key to 'file\n"); | |
131 | BIO_printf(bio_err," -rand file:file:...\n"); | |
132 | BIO_printf(bio_err," - load the file (or the files in the directory) into\n"); | |
133 | BIO_printf(bio_err," the random number generator\n"); | |
134 | goto end; | |
135 | } | |
136 | ||
137 | in=BIO_new(BIO_s_file()); | |
58964a49 | 138 | if (!(BIO_read_filename(in,"dsaparams"))) |
d02b48c6 RE |
139 | { |
140 | perror(dsaparams); | |
141 | goto end; | |
142 | } | |
143 | ||
144 | if ((dsa=PEM_read_bio_DSAparams(in,NULL,NULL)) == NULL) | |
145 | { | |
146 | BIO_printf(bio_err,"unable to load DSA parameter file\n"); | |
147 | goto end; | |
148 | } | |
149 | BIO_free(in); | |
150 | ||
151 | out=BIO_new(BIO_s_file()); | |
152 | if (out == NULL) goto end; | |
153 | ||
154 | if (outfile == NULL) | |
155 | BIO_set_fp(out,stdout,BIO_NOCLOSE); | |
156 | else | |
157 | { | |
158 | if (BIO_write_filename(out,outfile) <= 0) | |
159 | { | |
160 | perror(outfile); | |
161 | goto end; | |
162 | } | |
163 | } | |
164 | ||
165 | randfile=RAND_file_name(buffer,200); | |
166 | if ((randfile == NULL)|| !RAND_load_file(randfile,1024L*1024L)) | |
167 | BIO_printf(bio_err,"unable to load 'random state'\n"); | |
168 | ||
169 | if (inrand == NULL) | |
170 | BIO_printf(bio_err,"warning, not much extra random data, consider using the -rand option\n"); | |
171 | else | |
172 | { | |
173 | BIO_printf(bio_err,"%ld semi-random bytes loaded\n", | |
174 | dsa_load_rand(inrand)); | |
175 | } | |
176 | ||
177 | BIO_printf(bio_err,"Generating DSA parameters, %d bit long prime\n",num); | |
178 | BIO_printf(bio_err,"This could take some time\n"); | |
179 | if (!DSA_generate_key(dsa)) goto end; | |
180 | ||
181 | if (randfile == NULL) | |
182 | BIO_printf(bio_err,"unable to write 'random state'\n"); | |
183 | else | |
184 | RAND_write_file(randfile); | |
185 | ||
186 | if (!PEM_write_bio_DSAPrivateKey(out,dsa,EVP_des_ede3_cbc(),NULL,0,NULL)) | |
187 | goto end; | |
188 | ret=0; | |
189 | end: | |
190 | if (ret != 0) | |
191 | ERR_print_errors(bio_err); | |
192 | if (out != NULL) BIO_free(out); | |
193 | if (dsa != NULL) DSA_free(dsa); | |
194 | EXIT(ret); | |
195 | } | |
196 | ||
197 | static long dsa_load_rand(name) | |
198 | char *name; | |
199 | { | |
200 | char *p,*n; | |
201 | int last; | |
202 | long tot=0; | |
203 | ||
204 | for (;;) | |
205 | { | |
206 | last=0; | |
207 | for (p=name; ((*p != '\0') && (*p != LIST_SEPARATOR_CHAR)); p++); | |
208 | if (*p == '\0') last=1; | |
209 | *p='\0'; | |
210 | n=name; | |
211 | name=p+1; | |
212 | if (*n == '\0') break; | |
213 | ||
214 | tot+=RAND_load_file(n,1); | |
215 | if (last) break; | |
216 | } | |
217 | return(tot); | |
218 | } | |
219 | ||
220 |