2 * Portions Copyright (C) 2004-2006, 2008 Internet Systems Consortium, Inc. ("ISC")
3 * Portions Copyright (C) 1999-2002 Internet Software Consortium.
4 * Portions Copyright (C) 1995-2000 by Network Associates, Inc.
6 * Permission to use, copy, modify, and/or distribute this software for any
7 * purpose with or without fee is hereby granted, provided that the above
8 * copyright notice and this permission notice appear in all copies.
10 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC AND NETWORK ASSOCIATES DISCLAIMS
11 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
12 * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE
13 * FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
16 * IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
20 * Principal Author: Brian Wellington
21 * $Id: dst_parse.c,v 1.1.6.9 2008/01/22 23:27:05 tbox Exp $
26 #include <isc/base64.h>
28 #include <isc/fsaccess.h>
31 #include <isc/string.h>
34 #include "dst_internal.h"
35 #include "dst_parse.h"
36 #include "dst/result.h"
38 #define DST_AS_STR(t) ((t).value.as_textregion.base)
40 #define PRIVATE_KEY_STR "Private-key-format:"
41 #define ALGORITHM_STR "Algorithm:"
48 static struct parse_map map[] = {
49 {TAG_RSA_MODULUS, "Modulus:"},
50 {TAG_RSA_PUBLICEXPONENT, "PublicExponent:"},
51 {TAG_RSA_PRIVATEEXPONENT, "PrivateExponent:"},
52 {TAG_RSA_PRIME1, "Prime1:"},
53 {TAG_RSA_PRIME2, "Prime2:"},
54 {TAG_RSA_EXPONENT1, "Exponent1:"},
55 {TAG_RSA_EXPONENT2, "Exponent2:"},
56 {TAG_RSA_COEFFICIENT, "Coefficient:"},
58 {TAG_DH_PRIME, "Prime(p):"},
59 {TAG_DH_GENERATOR, "Generator(g):"},
60 {TAG_DH_PRIVATE, "Private_value(x):"},
61 {TAG_DH_PUBLIC, "Public_value(y):"},
63 {TAG_DSA_PRIME, "Prime(p):"},
64 {TAG_DSA_SUBPRIME, "Subprime(q):"},
65 {TAG_DSA_BASE, "Base(g):"},
66 {TAG_DSA_PRIVATE, "Private_value(x):"},
67 {TAG_DSA_PUBLIC, "Public_value(y):"},
69 {TAG_HMACMD5_KEY, "Key:"},
70 {TAG_HMACMD5_BITS, "Bits:"},
72 {TAG_HMACSHA1_KEY, "Key:"},
73 {TAG_HMACSHA1_BITS, "Bits:"},
75 {TAG_HMACSHA224_KEY, "Key:"},
76 {TAG_HMACSHA224_BITS, "Bits:"},
78 {TAG_HMACSHA256_KEY, "Key:"},
79 {TAG_HMACSHA256_BITS, "Bits:"},
81 {TAG_HMACSHA384_KEY, "Key:"},
82 {TAG_HMACSHA384_BITS, "Bits:"},
84 {TAG_HMACSHA512_KEY, "Key:"},
85 {TAG_HMACSHA512_BITS, "Bits:"},
91 find_value(const char *s, const unsigned int alg) {
95 if (map[i].tag == NULL)
97 else if (strcasecmp(s, map[i].tag) == 0 &&
98 TAG_ALG(map[i].value) == alg)
99 return (map[i].value);
104 find_tag(const int value) {
108 if (map[i].tag == NULL)
110 else if (value == map[i].value)
116 check_rsa(const dst_private_t *priv) {
118 if (priv->nelements != RSA_NTAGS)
120 for (i = 0; i < RSA_NTAGS; i++) {
121 for (j = 0; j < priv->nelements; j++)
122 if (priv->elements[j].tag == TAG(DST_ALG_RSAMD5, i))
124 if (j == priv->nelements)
131 check_dh(const dst_private_t *priv) {
133 if (priv->nelements != DH_NTAGS)
135 for (i = 0; i < DH_NTAGS; i++) {
136 for (j = 0; j < priv->nelements; j++)
137 if (priv->elements[j].tag == TAG(DST_ALG_DH, i))
139 if (j == priv->nelements)
146 check_dsa(const dst_private_t *priv) {
148 if (priv->nelements != DSA_NTAGS)
150 for (i = 0; i < DSA_NTAGS; i++) {
151 for (j = 0; j < priv->nelements; j++)
152 if (priv->elements[j].tag == TAG(DST_ALG_DSA, i))
154 if (j == priv->nelements)
161 check_hmac_md5(const dst_private_t *priv, isc_boolean_t old) {
164 if (priv->nelements != HMACMD5_NTAGS) {
166 * If this is a good old format and we are accepting
167 * the old format return success.
169 if (old && priv->nelements == OLD_HMACMD5_NTAGS &&
170 priv->elements[0].tag == TAG_HMACMD5_KEY)
175 * We must be new format at this point.
177 for (i = 0; i < HMACMD5_NTAGS; i++) {
178 for (j = 0; j < priv->nelements; j++)
179 if (priv->elements[j].tag == TAG(DST_ALG_HMACMD5, i))
181 if (j == priv->nelements)
188 check_hmac_sha(const dst_private_t *priv, unsigned int ntags,
192 if (priv->nelements != ntags)
194 for (i = 0; i < ntags; i++) {
195 for (j = 0; j < priv->nelements; j++)
196 if (priv->elements[j].tag == TAG(alg, i))
198 if (j == priv->nelements)
205 check_data(const dst_private_t *priv, const unsigned int alg,
208 /* XXXVIX this switch statement is too sparse to gen a jump table. */
211 case DST_ALG_RSASHA1:
212 return (check_rsa(priv));
214 return (check_dh(priv));
216 return (check_dsa(priv));
217 case DST_ALG_HMACMD5:
218 return (check_hmac_md5(priv, old));
219 case DST_ALG_HMACSHA1:
220 return (check_hmac_sha(priv, HMACSHA1_NTAGS, alg));
221 case DST_ALG_HMACSHA224:
222 return (check_hmac_sha(priv, HMACSHA224_NTAGS, alg));
223 case DST_ALG_HMACSHA256:
224 return (check_hmac_sha(priv, HMACSHA256_NTAGS, alg));
225 case DST_ALG_HMACSHA384:
226 return (check_hmac_sha(priv, HMACSHA384_NTAGS, alg));
227 case DST_ALG_HMACSHA512:
228 return (check_hmac_sha(priv, HMACSHA512_NTAGS, alg));
230 return (DST_R_UNSUPPORTEDALG);
235 dst__privstruct_free(dst_private_t *priv, isc_mem_t *mctx) {
240 for (i = 0; i < priv->nelements; i++) {
241 if (priv->elements[i].data == NULL)
243 memset(priv->elements[i].data, 0, MAXFIELDSIZE);
244 isc_mem_put(mctx, priv->elements[i].data, MAXFIELDSIZE);
250 dst__privstruct_parse(dst_key_t *key, unsigned int alg, isc_lex_t *lex,
251 isc_mem_t *mctx, dst_private_t *priv)
253 int n = 0, major, minor;
256 unsigned char *data = NULL;
257 unsigned int opt = ISC_LEXOPT_EOL;
260 REQUIRE(priv != NULL);
263 memset(priv->elements, 0, sizeof(priv->elements));
265 #define NEXTTOKEN(lex, opt, token) \
267 ret = isc_lex_gettoken(lex, opt, token); \
268 if (ret != ISC_R_SUCCESS) \
272 #define READLINE(lex, opt, token) \
274 ret = isc_lex_gettoken(lex, opt, token); \
275 if (ret == ISC_R_EOF) \
277 else if (ret != ISC_R_SUCCESS) \
279 } while ((*token).type != isc_tokentype_eol)
282 * Read the description line.
284 NEXTTOKEN(lex, opt, &token);
285 if (token.type != isc_tokentype_string ||
286 strcmp(DST_AS_STR(token), PRIVATE_KEY_STR) != 0)
288 ret = DST_R_INVALIDPRIVATEKEY;
292 NEXTTOKEN(lex, opt, &token);
293 if (token.type != isc_tokentype_string ||
294 (DST_AS_STR(token))[0] != 'v')
296 ret = DST_R_INVALIDPRIVATEKEY;
299 if (sscanf(DST_AS_STR(token), "v%d.%d", &major, &minor) != 2)
301 ret = DST_R_INVALIDPRIVATEKEY;
305 if (major > MAJOR_VERSION ||
306 (major == MAJOR_VERSION && minor > MINOR_VERSION))
308 ret = DST_R_INVALIDPRIVATEKEY;
312 READLINE(lex, opt, &token);
315 * Read the algorithm line.
317 NEXTTOKEN(lex, opt, &token);
318 if (token.type != isc_tokentype_string ||
319 strcmp(DST_AS_STR(token), ALGORITHM_STR) != 0)
321 ret = DST_R_INVALIDPRIVATEKEY;
325 NEXTTOKEN(lex, opt | ISC_LEXOPT_NUMBER, &token);
326 if (token.type != isc_tokentype_number ||
327 token.value.as_ulong != (unsigned long) dst_key_alg(key))
329 ret = DST_R_INVALIDPRIVATEKEY;
333 READLINE(lex, opt, &token);
338 for (n = 0; n < MAXFIELDS; n++) {
343 ret = isc_lex_gettoken(lex, opt, &token);
344 if (ret == ISC_R_EOF)
346 if (ret != ISC_R_SUCCESS)
348 } while (token.type == isc_tokentype_eol);
350 if (token.type != isc_tokentype_string) {
351 ret = DST_R_INVALIDPRIVATEKEY;
355 tag = find_value(DST_AS_STR(token), alg);
356 if (tag < 0 || TAG_ALG(tag) != alg) {
357 ret = DST_R_INVALIDPRIVATEKEY;
360 priv->elements[n].tag = tag;
362 data = (unsigned char *) isc_mem_get(mctx, MAXFIELDSIZE);
366 isc_buffer_init(&b, data, MAXFIELDSIZE);
367 ret = isc_base64_tobuffer(lex, &b, -1);
368 if (ret != ISC_R_SUCCESS)
370 isc_buffer_usedregion(&b, &r);
371 priv->elements[n].length = r.length;
372 priv->elements[n].data = r.base;
374 READLINE(lex, opt, &token);
380 if (check_data(priv, alg, ISC_TRUE) < 0)
383 return (ISC_R_SUCCESS);
387 dst__privstruct_free(priv, mctx);
389 isc_mem_put(mctx, data, MAXFIELDSIZE);
395 dst__privstruct_writefile(const dst_key_t *key, const dst_private_t *priv,
396 const char *directory)
401 char filename[ISC_DIR_NAMEMAX];
402 char buffer[MAXFIELDSIZE * 2];
404 isc_fsaccess_t access;
406 REQUIRE(priv != NULL);
408 if (check_data(priv, dst_key_alg(key), ISC_FALSE) < 0)
409 return (DST_R_INVALIDPRIVATEKEY);
411 isc_buffer_init(&b, filename, sizeof(filename));
412 ret = dst_key_buildfilename(key, DST_TYPE_PRIVATE, directory, &b);
413 if (ret != ISC_R_SUCCESS)
416 if ((fp = fopen(filename, "w")) == NULL)
417 return (DST_R_WRITEERROR);
420 isc_fsaccess_add(ISC_FSACCESS_OWNER,
421 ISC_FSACCESS_READ | ISC_FSACCESS_WRITE,
423 (void)isc_fsaccess_set(filename, access);
425 /* XXXDCL return value should be checked for full filesystem */
426 fprintf(fp, "%s v%d.%d\n", PRIVATE_KEY_STR, MAJOR_VERSION,
429 fprintf(fp, "%s %d ", ALGORITHM_STR, dst_key_alg(key));
430 /* XXXVIX this switch statement is too sparse to gen a jump table. */
431 switch (dst_key_alg(key)) {
433 fprintf(fp, "(RSA)\n");
436 fprintf(fp, "(DH)\n");
439 fprintf(fp, "(DSA)\n");
441 case DST_ALG_RSASHA1:
442 fprintf(fp, "(RSASHA1)\n");
444 case DST_ALG_HMACMD5:
445 fprintf(fp, "(HMAC_MD5)\n");
447 case DST_ALG_HMACSHA1:
448 fprintf(fp, "(HMAC_SHA1)\n");
450 case DST_ALG_HMACSHA224:
451 fprintf(fp, "(HMAC_SHA224)\n");
453 case DST_ALG_HMACSHA256:
454 fprintf(fp, "(HMAC_SHA256)\n");
456 case DST_ALG_HMACSHA384:
457 fprintf(fp, "(HMAC_SHA384)\n");
459 case DST_ALG_HMACSHA512:
460 fprintf(fp, "(HMAC_SHA512)\n");
463 fprintf(fp, "(?)\n");
467 for (i = 0; i < priv->nelements; i++) {
472 s = find_tag(priv->elements[i].tag);
474 r.base = priv->elements[i].data;
475 r.length = priv->elements[i].length;
476 isc_buffer_init(&b, buffer, sizeof(buffer));
477 iret = isc_base64_totext(&r, sizeof(buffer), "", &b);
478 if (iret != ISC_R_SUCCESS) {
480 return (DST_R_INVALIDPRIVATEKEY);
482 isc_buffer_usedregion(&b, &r);
484 fprintf(fp, "%s ", s);
485 fwrite(r.base, 1, r.length, fp);
490 return (ISC_R_SUCCESS);