2 * Portions Copyright (C) 2004-2009 Internet Systems Consortium, Inc. ("ISC")
3 * Portions Copyright (C) 1999-2002 Internet Software Consortium.
5 * Permission to use, copy, modify, and/or distribute this software for any
6 * purpose with or without fee is hereby granted, provided that the above
7 * copyright notice and this permission notice appear in all copies.
9 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC AND NETWORK ASSOCIATES DISCLAIMS
10 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
11 * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE
12 * FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
15 * IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 * Portions Copyright (C) 1995-2000 by Network Associates, Inc.
19 * Permission to use, copy, modify, and/or distribute this software for any
20 * purpose with or without fee is hereby granted, provided that the above
21 * copyright notice and this permission notice appear in all copies.
23 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC AND NETWORK ASSOCIATES DISCLAIMS
24 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
25 * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE
26 * FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
27 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
28 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
29 * IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
33 * Principal Author: Brian Wellington
34 * $Id: dst_parse.c,v 1.10.92.4 2009/03/02 23:46:31 tbox Exp $
39 #include <isc/base64.h>
41 #include <isc/fsaccess.h>
44 #include <isc/string.h>
47 #include "dst_internal.h"
48 #include "dst_parse.h"
49 #include "dst/result.h"
51 #define DST_AS_STR(t) ((t).value.as_textregion.base)
53 #define PRIVATE_KEY_STR "Private-key-format:"
54 #define ALGORITHM_STR "Algorithm:"
61 static struct parse_map map[] = {
62 {TAG_RSA_MODULUS, "Modulus:"},
63 {TAG_RSA_PUBLICEXPONENT, "PublicExponent:"},
64 {TAG_RSA_PRIVATEEXPONENT, "PrivateExponent:"},
65 {TAG_RSA_PRIME1, "Prime1:"},
66 {TAG_RSA_PRIME2, "Prime2:"},
67 {TAG_RSA_EXPONENT1, "Exponent1:"},
68 {TAG_RSA_EXPONENT2, "Exponent2:"},
69 {TAG_RSA_COEFFICIENT, "Coefficient:"},
71 {TAG_DH_PRIME, "Prime(p):"},
72 {TAG_DH_GENERATOR, "Generator(g):"},
73 {TAG_DH_PRIVATE, "Private_value(x):"},
74 {TAG_DH_PUBLIC, "Public_value(y):"},
76 {TAG_DSA_PRIME, "Prime(p):"},
77 {TAG_DSA_SUBPRIME, "Subprime(q):"},
78 {TAG_DSA_BASE, "Base(g):"},
79 {TAG_DSA_PRIVATE, "Private_value(x):"},
80 {TAG_DSA_PUBLIC, "Public_value(y):"},
82 {TAG_HMACMD5_KEY, "Key:"},
83 {TAG_HMACMD5_BITS, "Bits:"},
85 {TAG_HMACSHA1_KEY, "Key:"},
86 {TAG_HMACSHA1_BITS, "Bits:"},
88 {TAG_HMACSHA224_KEY, "Key:"},
89 {TAG_HMACSHA224_BITS, "Bits:"},
91 {TAG_HMACSHA256_KEY, "Key:"},
92 {TAG_HMACSHA256_BITS, "Bits:"},
94 {TAG_HMACSHA384_KEY, "Key:"},
95 {TAG_HMACSHA384_BITS, "Bits:"},
97 {TAG_HMACSHA512_KEY, "Key:"},
98 {TAG_HMACSHA512_BITS, "Bits:"},
104 find_value(const char *s, const unsigned int alg) {
108 if (map[i].tag == NULL)
110 else if (strcasecmp(s, map[i].tag) == 0 &&
111 TAG_ALG(map[i].value) == alg)
112 return (map[i].value);
117 find_tag(const int value) {
121 if (map[i].tag == NULL)
123 else if (value == map[i].value)
129 check_rsa(const dst_private_t *priv) {
131 if (priv->nelements != RSA_NTAGS)
133 for (i = 0; i < RSA_NTAGS; i++) {
134 for (j = 0; j < priv->nelements; j++)
135 if (priv->elements[j].tag == TAG(DST_ALG_RSAMD5, i))
137 if (j == priv->nelements)
144 check_dh(const dst_private_t *priv) {
146 if (priv->nelements != DH_NTAGS)
148 for (i = 0; i < DH_NTAGS; i++) {
149 for (j = 0; j < priv->nelements; j++)
150 if (priv->elements[j].tag == TAG(DST_ALG_DH, i))
152 if (j == priv->nelements)
159 check_dsa(const dst_private_t *priv) {
161 if (priv->nelements != DSA_NTAGS)
163 for (i = 0; i < DSA_NTAGS; i++) {
164 for (j = 0; j < priv->nelements; j++)
165 if (priv->elements[j].tag == TAG(DST_ALG_DSA, i))
167 if (j == priv->nelements)
174 check_hmac_md5(const dst_private_t *priv, isc_boolean_t old) {
177 if (priv->nelements != HMACMD5_NTAGS) {
179 * If this is a good old format and we are accepting
180 * the old format return success.
182 if (old && priv->nelements == OLD_HMACMD5_NTAGS &&
183 priv->elements[0].tag == TAG_HMACMD5_KEY)
188 * We must be new format at this point.
190 for (i = 0; i < HMACMD5_NTAGS; i++) {
191 for (j = 0; j < priv->nelements; j++)
192 if (priv->elements[j].tag == TAG(DST_ALG_HMACMD5, i))
194 if (j == priv->nelements)
201 check_hmac_sha(const dst_private_t *priv, unsigned int ntags,
205 if (priv->nelements != ntags)
207 for (i = 0; i < ntags; i++) {
208 for (j = 0; j < priv->nelements; j++)
209 if (priv->elements[j].tag == TAG(alg, i))
211 if (j == priv->nelements)
218 check_data(const dst_private_t *priv, const unsigned int alg,
221 /* XXXVIX this switch statement is too sparse to gen a jump table. */
224 case DST_ALG_RSASHA1:
225 return (check_rsa(priv));
227 return (check_dh(priv));
229 return (check_dsa(priv));
230 case DST_ALG_HMACMD5:
231 return (check_hmac_md5(priv, old));
232 case DST_ALG_HMACSHA1:
233 return (check_hmac_sha(priv, HMACSHA1_NTAGS, alg));
234 case DST_ALG_HMACSHA224:
235 return (check_hmac_sha(priv, HMACSHA224_NTAGS, alg));
236 case DST_ALG_HMACSHA256:
237 return (check_hmac_sha(priv, HMACSHA256_NTAGS, alg));
238 case DST_ALG_HMACSHA384:
239 return (check_hmac_sha(priv, HMACSHA384_NTAGS, alg));
240 case DST_ALG_HMACSHA512:
241 return (check_hmac_sha(priv, HMACSHA512_NTAGS, alg));
243 return (DST_R_UNSUPPORTEDALG);
248 dst__privstruct_free(dst_private_t *priv, isc_mem_t *mctx) {
253 for (i = 0; i < priv->nelements; i++) {
254 if (priv->elements[i].data == NULL)
256 memset(priv->elements[i].data, 0, MAXFIELDSIZE);
257 isc_mem_put(mctx, priv->elements[i].data, MAXFIELDSIZE);
263 dst__privstruct_parse(dst_key_t *key, unsigned int alg, isc_lex_t *lex,
264 isc_mem_t *mctx, dst_private_t *priv)
266 int n = 0, major, minor;
269 unsigned char *data = NULL;
270 unsigned int opt = ISC_LEXOPT_EOL;
273 REQUIRE(priv != NULL);
276 memset(priv->elements, 0, sizeof(priv->elements));
278 #define NEXTTOKEN(lex, opt, token) \
280 ret = isc_lex_gettoken(lex, opt, token); \
281 if (ret != ISC_R_SUCCESS) \
285 #define READLINE(lex, opt, token) \
287 ret = isc_lex_gettoken(lex, opt, token); \
288 if (ret == ISC_R_EOF) \
290 else if (ret != ISC_R_SUCCESS) \
292 } while ((*token).type != isc_tokentype_eol)
295 * Read the description line.
297 NEXTTOKEN(lex, opt, &token);
298 if (token.type != isc_tokentype_string ||
299 strcmp(DST_AS_STR(token), PRIVATE_KEY_STR) != 0)
301 ret = DST_R_INVALIDPRIVATEKEY;
305 NEXTTOKEN(lex, opt, &token);
306 if (token.type != isc_tokentype_string ||
307 (DST_AS_STR(token))[0] != 'v')
309 ret = DST_R_INVALIDPRIVATEKEY;
312 if (sscanf(DST_AS_STR(token), "v%d.%d", &major, &minor) != 2)
314 ret = DST_R_INVALIDPRIVATEKEY;
318 if (major > MAJOR_VERSION ||
319 (major == MAJOR_VERSION && minor > MINOR_VERSION))
321 ret = DST_R_INVALIDPRIVATEKEY;
325 READLINE(lex, opt, &token);
328 * Read the algorithm line.
330 NEXTTOKEN(lex, opt, &token);
331 if (token.type != isc_tokentype_string ||
332 strcmp(DST_AS_STR(token), ALGORITHM_STR) != 0)
334 ret = DST_R_INVALIDPRIVATEKEY;
338 NEXTTOKEN(lex, opt | ISC_LEXOPT_NUMBER, &token);
339 if (token.type != isc_tokentype_number ||
340 token.value.as_ulong != (unsigned long) dst_key_alg(key))
342 ret = DST_R_INVALIDPRIVATEKEY;
346 READLINE(lex, opt, &token);
351 for (n = 0; n < MAXFIELDS; n++) {
356 ret = isc_lex_gettoken(lex, opt, &token);
357 if (ret == ISC_R_EOF)
359 if (ret != ISC_R_SUCCESS)
361 } while (token.type == isc_tokentype_eol);
363 if (token.type != isc_tokentype_string) {
364 ret = DST_R_INVALIDPRIVATEKEY;
368 tag = find_value(DST_AS_STR(token), alg);
369 if (tag < 0 || TAG_ALG(tag) != alg) {
370 ret = DST_R_INVALIDPRIVATEKEY;
373 priv->elements[n].tag = tag;
375 data = (unsigned char *) isc_mem_get(mctx, MAXFIELDSIZE);
379 isc_buffer_init(&b, data, MAXFIELDSIZE);
380 ret = isc_base64_tobuffer(lex, &b, -1);
381 if (ret != ISC_R_SUCCESS)
383 isc_buffer_usedregion(&b, &r);
384 priv->elements[n].length = r.length;
385 priv->elements[n].data = r.base;
387 READLINE(lex, opt, &token);
393 if (check_data(priv, alg, ISC_TRUE) < 0)
396 return (ISC_R_SUCCESS);
400 dst__privstruct_free(priv, mctx);
402 isc_mem_put(mctx, data, MAXFIELDSIZE);
408 dst__privstruct_writefile(const dst_key_t *key, const dst_private_t *priv,
409 const char *directory)
414 char filename[ISC_DIR_NAMEMAX];
415 char buffer[MAXFIELDSIZE * 2];
417 isc_fsaccess_t access;
419 REQUIRE(priv != NULL);
421 if (check_data(priv, dst_key_alg(key), ISC_FALSE) < 0)
422 return (DST_R_INVALIDPRIVATEKEY);
424 isc_buffer_init(&b, filename, sizeof(filename));
425 ret = dst_key_buildfilename(key, DST_TYPE_PRIVATE, directory, &b);
426 if (ret != ISC_R_SUCCESS)
429 if ((fp = fopen(filename, "w")) == NULL)
430 return (DST_R_WRITEERROR);
433 isc_fsaccess_add(ISC_FSACCESS_OWNER,
434 ISC_FSACCESS_READ | ISC_FSACCESS_WRITE,
436 (void)isc_fsaccess_set(filename, access);
438 /* XXXDCL return value should be checked for full filesystem */
439 fprintf(fp, "%s v%d.%d\n", PRIVATE_KEY_STR, MAJOR_VERSION,
442 fprintf(fp, "%s %d ", ALGORITHM_STR, dst_key_alg(key));
443 /* XXXVIX this switch statement is too sparse to gen a jump table. */
444 switch (dst_key_alg(key)) {
446 fprintf(fp, "(RSA)\n");
449 fprintf(fp, "(DH)\n");
452 fprintf(fp, "(DSA)\n");
454 case DST_ALG_RSASHA1:
455 fprintf(fp, "(RSASHA1)\n");
457 case DST_ALG_HMACMD5:
458 fprintf(fp, "(HMAC_MD5)\n");
460 case DST_ALG_HMACSHA1:
461 fprintf(fp, "(HMAC_SHA1)\n");
463 case DST_ALG_HMACSHA224:
464 fprintf(fp, "(HMAC_SHA224)\n");
466 case DST_ALG_HMACSHA256:
467 fprintf(fp, "(HMAC_SHA256)\n");
469 case DST_ALG_HMACSHA384:
470 fprintf(fp, "(HMAC_SHA384)\n");
472 case DST_ALG_HMACSHA512:
473 fprintf(fp, "(HMAC_SHA512)\n");
476 fprintf(fp, "(?)\n");
480 for (i = 0; i < priv->nelements; i++) {
485 s = find_tag(priv->elements[i].tag);
487 r.base = priv->elements[i].data;
488 r.length = priv->elements[i].length;
489 isc_buffer_init(&b, buffer, sizeof(buffer));
490 iret = isc_base64_totext(&r, sizeof(buffer), "", &b);
491 if (iret != ISC_R_SUCCESS) {
493 return (DST_R_INVALIDPRIVATEKEY);
495 isc_buffer_usedregion(&b, &r);
497 fprintf(fp, "%s ", s);
498 fwrite(r.base, 1, r.length, fp);
503 iret = ferror(fp) ? DST_R_WRITEERROR : ISC_R_SUCCESS;