2 * Portions Copyright (C) 2004-2012 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
39 #include <isc/base64.h>
41 #include <isc/fsaccess.h>
44 #include <isc/stdtime.h>
45 #include <isc/string.h>
52 #include "dst_internal.h"
53 #include "dst_parse.h"
54 #include "dst/result.h"
56 #define DST_AS_STR(t) ((t).value.as_textregion.base)
58 #define PRIVATE_KEY_STR "Private-key-format:"
59 #define ALGORITHM_STR "Algorithm:"
61 #define TIMING_NTAGS (DST_MAX_TIMES + 1)
62 static const char *timetags[TIMING_NTAGS] = {
72 #define NUMERIC_NTAGS (DST_MAX_NUMERIC + 1)
73 static const char *numerictags[NUMERIC_NTAGS] = {
85 static struct parse_map map[] = {
86 {TAG_RSA_MODULUS, "Modulus:"},
87 {TAG_RSA_PUBLICEXPONENT, "PublicExponent:"},
88 {TAG_RSA_PRIVATEEXPONENT, "PrivateExponent:"},
89 {TAG_RSA_PRIME1, "Prime1:"},
90 {TAG_RSA_PRIME2, "Prime2:"},
91 {TAG_RSA_EXPONENT1, "Exponent1:"},
92 {TAG_RSA_EXPONENT2, "Exponent2:"},
93 {TAG_RSA_COEFFICIENT, "Coefficient:"},
94 {TAG_RSA_ENGINE, "Engine:" },
95 {TAG_RSA_LABEL, "Label:" },
96 {TAG_RSA_PIN, "PIN:" },
98 {TAG_DH_PRIME, "Prime(p):"},
99 {TAG_DH_GENERATOR, "Generator(g):"},
100 {TAG_DH_PRIVATE, "Private_value(x):"},
101 {TAG_DH_PUBLIC, "Public_value(y):"},
103 {TAG_DSA_PRIME, "Prime(p):"},
104 {TAG_DSA_SUBPRIME, "Subprime(q):"},
105 {TAG_DSA_BASE, "Base(g):"},
106 {TAG_DSA_PRIVATE, "Private_value(x):"},
107 {TAG_DSA_PUBLIC, "Public_value(y):"},
109 {TAG_GOST_PRIVASN1, "GostAsn1:"},
111 {TAG_ECDSA_PRIVATEKEY, "PrivateKey:"},
113 {TAG_HMACMD5_KEY, "Key:"},
114 {TAG_HMACMD5_BITS, "Bits:"},
116 {TAG_HMACSHA1_KEY, "Key:"},
117 {TAG_HMACSHA1_BITS, "Bits:"},
119 {TAG_HMACSHA224_KEY, "Key:"},
120 {TAG_HMACSHA224_BITS, "Bits:"},
122 {TAG_HMACSHA256_KEY, "Key:"},
123 {TAG_HMACSHA256_BITS, "Bits:"},
125 {TAG_HMACSHA384_KEY, "Key:"},
126 {TAG_HMACSHA384_BITS, "Bits:"},
128 {TAG_HMACSHA512_KEY, "Key:"},
129 {TAG_HMACSHA512_BITS, "Bits:"},
135 find_value(const char *s, const unsigned int alg) {
138 for (i = 0; map[i].tag != NULL; i++) {
139 if (strcasecmp(s, map[i].tag) == 0 &&
140 (TAG_ALG(map[i].value) == alg))
141 return (map[i].value);
147 find_tag(const int value) {
151 if (map[i].tag == NULL)
153 else if (value == map[i].value)
159 find_metadata(const char *s, const char *tags[], int ntags) {
162 for (i = 0; i < ntags; i++) {
163 if (strcasecmp(s, tags[i]) == 0)
171 find_timedata(const char *s) {
172 return (find_metadata(s, timetags, TIMING_NTAGS));
176 find_numericdata(const char *s) {
177 return (find_metadata(s, numerictags, NUMERIC_NTAGS));
181 check_rsa(const dst_private_t *priv) {
183 isc_boolean_t have[RSA_NTAGS];
187 for (i = 0; i < RSA_NTAGS; i++)
189 for (j = 0; j < priv->nelements; j++) {
190 for (i = 0; i < RSA_NTAGS; i++)
191 if (priv->elements[j].tag == TAG(DST_ALG_RSAMD5, i))
199 mask <<= sizeof(mask) * 8 - TAG_SHIFT;
200 mask >>= sizeof(mask) * 8 - TAG_SHIFT;
202 if (have[TAG_RSA_ENGINE & mask])
203 ok = have[TAG_RSA_MODULUS & mask] &&
204 have[TAG_RSA_PUBLICEXPONENT & mask] &&
205 have[TAG_RSA_LABEL & mask];
207 ok = have[TAG_RSA_MODULUS & mask] &&
208 have[TAG_RSA_PUBLICEXPONENT & mask] &&
209 have[TAG_RSA_PRIVATEEXPONENT & mask] &&
210 have[TAG_RSA_PRIME1 & mask] &&
211 have[TAG_RSA_PRIME2 & mask] &&
212 have[TAG_RSA_EXPONENT1 & mask] &&
213 have[TAG_RSA_EXPONENT2 & mask] &&
214 have[TAG_RSA_COEFFICIENT & mask];
215 return (ok ? 0 : -1 );
219 check_dh(const dst_private_t *priv) {
221 if (priv->nelements != DH_NTAGS)
223 for (i = 0; i < DH_NTAGS; i++) {
224 for (j = 0; j < priv->nelements; j++)
225 if (priv->elements[j].tag == TAG(DST_ALG_DH, i))
227 if (j == priv->nelements)
234 check_dsa(const dst_private_t *priv) {
236 if (priv->nelements != DSA_NTAGS)
238 for (i = 0; i < DSA_NTAGS; i++) {
239 for (j = 0; j < priv->nelements; j++)
240 if (priv->elements[j].tag == TAG(DST_ALG_DSA, i))
242 if (j == priv->nelements)
249 check_gost(const dst_private_t *priv) {
250 if (priv->nelements != GOST_NTAGS)
252 if (priv->elements[0].tag != TAG(DST_ALG_ECCGOST, 0))
258 check_ecdsa(const dst_private_t *priv) {
259 if (priv->nelements != ECDSA_NTAGS)
261 if (priv->elements[0].tag != TAG(DST_ALG_ECDSA256, 0))
267 check_hmac_md5(const dst_private_t *priv, isc_boolean_t old) {
270 if (priv->nelements != HMACMD5_NTAGS) {
272 * If this is a good old format and we are accepting
273 * the old format return success.
275 if (old && priv->nelements == OLD_HMACMD5_NTAGS &&
276 priv->elements[0].tag == TAG_HMACMD5_KEY)
281 * We must be new format at this point.
283 for (i = 0; i < HMACMD5_NTAGS; i++) {
284 for (j = 0; j < priv->nelements; j++)
285 if (priv->elements[j].tag == TAG(DST_ALG_HMACMD5, i))
287 if (j == priv->nelements)
294 check_hmac_sha(const dst_private_t *priv, unsigned int ntags,
298 if (priv->nelements != ntags)
300 for (i = 0; i < ntags; i++) {
301 for (j = 0; j < priv->nelements; j++)
302 if (priv->elements[j].tag == TAG(alg, i))
304 if (j == priv->nelements)
311 check_data(const dst_private_t *priv, const unsigned int alg,
314 /* XXXVIX this switch statement is too sparse to gen a jump table. */
317 case DST_ALG_RSASHA1:
318 case DST_ALG_NSEC3RSASHA1:
319 case DST_ALG_RSASHA256:
320 case DST_ALG_RSASHA512:
321 return (check_rsa(priv));
323 return (check_dh(priv));
325 case DST_ALG_NSEC3DSA:
326 return (check_dsa(priv));
327 case DST_ALG_ECCGOST:
328 return (check_gost(priv));
329 case DST_ALG_ECDSA256:
330 case DST_ALG_ECDSA384:
331 return (check_ecdsa(priv));
332 case DST_ALG_HMACMD5:
333 return (check_hmac_md5(priv, old));
334 case DST_ALG_HMACSHA1:
335 return (check_hmac_sha(priv, HMACSHA1_NTAGS, alg));
336 case DST_ALG_HMACSHA224:
337 return (check_hmac_sha(priv, HMACSHA224_NTAGS, alg));
338 case DST_ALG_HMACSHA256:
339 return (check_hmac_sha(priv, HMACSHA256_NTAGS, alg));
340 case DST_ALG_HMACSHA384:
341 return (check_hmac_sha(priv, HMACSHA384_NTAGS, alg));
342 case DST_ALG_HMACSHA512:
343 return (check_hmac_sha(priv, HMACSHA512_NTAGS, alg));
345 return (DST_R_UNSUPPORTEDALG);
350 dst__privstruct_free(dst_private_t *priv, isc_mem_t *mctx) {
355 for (i = 0; i < priv->nelements; i++) {
356 if (priv->elements[i].data == NULL)
358 memset(priv->elements[i].data, 0, MAXFIELDSIZE);
359 isc_mem_put(mctx, priv->elements[i].data, MAXFIELDSIZE);
365 dst__privstruct_parse(dst_key_t *key, unsigned int alg, isc_lex_t *lex,
366 isc_mem_t *mctx, dst_private_t *priv)
368 int n = 0, major, minor, check;
371 unsigned char *data = NULL;
372 unsigned int opt = ISC_LEXOPT_EOL;
376 REQUIRE(priv != NULL);
379 memset(priv->elements, 0, sizeof(priv->elements));
381 #define NEXTTOKEN(lex, opt, token) \
383 ret = isc_lex_gettoken(lex, opt, token); \
384 if (ret != ISC_R_SUCCESS) \
388 #define READLINE(lex, opt, token) \
390 ret = isc_lex_gettoken(lex, opt, token); \
391 if (ret == ISC_R_EOF) \
393 else if (ret != ISC_R_SUCCESS) \
395 } while ((*token).type != isc_tokentype_eol)
398 * Read the description line.
400 NEXTTOKEN(lex, opt, &token);
401 if (token.type != isc_tokentype_string ||
402 strcmp(DST_AS_STR(token), PRIVATE_KEY_STR) != 0)
404 ret = DST_R_INVALIDPRIVATEKEY;
408 NEXTTOKEN(lex, opt, &token);
409 if (token.type != isc_tokentype_string ||
410 (DST_AS_STR(token))[0] != 'v')
412 ret = DST_R_INVALIDPRIVATEKEY;
415 if (sscanf(DST_AS_STR(token), "v%d.%d", &major, &minor) != 2)
417 ret = DST_R_INVALIDPRIVATEKEY;
421 if (major > DST_MAJOR_VERSION) {
422 ret = DST_R_INVALIDPRIVATEKEY;
427 * Store the private key format version number
429 dst_key_setprivateformat(key, major, minor);
431 READLINE(lex, opt, &token);
434 * Read the algorithm line.
436 NEXTTOKEN(lex, opt, &token);
437 if (token.type != isc_tokentype_string ||
438 strcmp(DST_AS_STR(token), ALGORITHM_STR) != 0)
440 ret = DST_R_INVALIDPRIVATEKEY;
444 NEXTTOKEN(lex, opt | ISC_LEXOPT_NUMBER, &token);
445 if (token.type != isc_tokentype_number ||
446 token.value.as_ulong != (unsigned long) dst_key_alg(key))
448 ret = DST_R_INVALIDPRIVATEKEY;
452 READLINE(lex, opt, &token);
457 for (n = 0; n < MAXFIELDS; n++) {
461 ret = isc_lex_gettoken(lex, opt, &token);
462 if (ret == ISC_R_EOF)
464 if (ret != ISC_R_SUCCESS)
466 } while (token.type == isc_tokentype_eol);
468 if (token.type != isc_tokentype_string) {
469 ret = DST_R_INVALIDPRIVATEKEY;
473 /* Numeric metadata */
474 tag = find_numericdata(DST_AS_STR(token));
476 INSIST(tag < NUMERIC_NTAGS);
478 NEXTTOKEN(lex, opt | ISC_LEXOPT_NUMBER, &token);
479 if (token.type != isc_tokentype_number) {
480 ret = DST_R_INVALIDPRIVATEKEY;
484 dst_key_setnum(key, tag, token.value.as_ulong);
488 /* Timing metadata */
489 tag = find_timedata(DST_AS_STR(token));
491 INSIST(tag < TIMING_NTAGS);
493 NEXTTOKEN(lex, opt, &token);
494 if (token.type != isc_tokentype_string) {
495 ret = DST_R_INVALIDPRIVATEKEY;
499 ret = dns_time32_fromtext(DST_AS_STR(token), &when);
500 if (ret != ISC_R_SUCCESS)
503 dst_key_settime(key, tag, when);
509 tag = find_value(DST_AS_STR(token), alg);
510 if (tag < 0 && minor > DST_MINOR_VERSION)
513 ret = DST_R_INVALIDPRIVATEKEY;
517 priv->elements[n].tag = tag;
519 data = (unsigned char *) isc_mem_get(mctx, MAXFIELDSIZE);
523 isc_buffer_init(&b, data, MAXFIELDSIZE);
524 ret = isc_base64_tobuffer(lex, &b, -1);
525 if (ret != ISC_R_SUCCESS)
528 isc_buffer_usedregion(&b, &r);
529 priv->elements[n].length = r.length;
530 priv->elements[n].data = r.base;
534 READLINE(lex, opt, &token);
538 check = check_data(priv, alg, ISC_TRUE);
540 ret = DST_R_INVALIDPRIVATEKEY;
542 } else if (check != ISC_R_SUCCESS) {
547 return (ISC_R_SUCCESS);
550 dst__privstruct_free(priv, mctx);
552 isc_mem_put(mctx, data, MAXFIELDSIZE);
558 dst__privstruct_writefile(const dst_key_t *key, const dst_private_t *priv,
559 const char *directory)
563 char filename[ISC_DIR_NAMEMAX];
564 char buffer[MAXFIELDSIZE * 2];
565 isc_fsaccess_t access;
574 REQUIRE(priv != NULL);
576 ret = check_data(priv, dst_key_alg(key), ISC_FALSE);
578 return (DST_R_INVALIDPRIVATEKEY);
579 else if (ret != ISC_R_SUCCESS)
582 isc_buffer_init(&b, filename, sizeof(filename));
583 result = dst_key_buildfilename(key, DST_TYPE_PRIVATE, directory, &b);
584 if (result != ISC_R_SUCCESS)
587 result = isc_file_mode(filename, &mode);
588 if (result == ISC_R_SUCCESS && mode != 0600) {
589 /* File exists; warn that we are changing its permissions */
590 isc_log_write(dns_lctx, DNS_LOGCATEGORY_GENERAL,
591 DNS_LOGMODULE_DNSSEC, ISC_LOG_WARNING,
592 "Permissions on the file %s "
593 "have changed from 0%o to 0600 as "
594 "a result of this operation.",
595 filename, (unsigned int)mode);
598 if ((fp = fopen(filename, "w")) == NULL)
599 return (DST_R_WRITEERROR);
602 isc_fsaccess_add(ISC_FSACCESS_OWNER,
603 ISC_FSACCESS_READ | ISC_FSACCESS_WRITE,
605 (void)isc_fsaccess_set(filename, access);
607 dst_key_getprivateformat(key, &major, &minor);
608 if (major == 0 && minor == 0) {
609 major = DST_MAJOR_VERSION;
610 minor = DST_MINOR_VERSION;
613 /* XXXDCL return value should be checked for full filesystem */
614 fprintf(fp, "%s v%d.%d\n", PRIVATE_KEY_STR, major, minor);
616 fprintf(fp, "%s %d ", ALGORITHM_STR, dst_key_alg(key));
618 /* XXXVIX this switch statement is too sparse to gen a jump table. */
619 switch (dst_key_alg(key)) {
621 fprintf(fp, "(RSA)\n");
624 fprintf(fp, "(DH)\n");
627 fprintf(fp, "(DSA)\n");
629 case DST_ALG_RSASHA1:
630 fprintf(fp, "(RSASHA1)\n");
632 case DST_ALG_NSEC3RSASHA1:
633 fprintf(fp, "(NSEC3RSASHA1)\n");
635 case DST_ALG_NSEC3DSA:
636 fprintf(fp, "(NSEC3DSA)\n");
638 case DST_ALG_RSASHA256:
639 fprintf(fp, "(RSASHA256)\n");
641 case DST_ALG_RSASHA512:
642 fprintf(fp, "(RSASHA512)\n");
644 case DST_ALG_ECCGOST:
645 fprintf(fp, "(ECC-GOST)\n");
647 case DST_ALG_ECDSA256:
648 fprintf(fp, "(ECDSAP256SHA256)\n");
650 case DST_ALG_ECDSA384:
651 fprintf(fp, "(ECDSAP384SHA384)\n");
653 case DST_ALG_HMACMD5:
654 fprintf(fp, "(HMAC_MD5)\n");
656 case DST_ALG_HMACSHA1:
657 fprintf(fp, "(HMAC_SHA1)\n");
659 case DST_ALG_HMACSHA224:
660 fprintf(fp, "(HMAC_SHA224)\n");
662 case DST_ALG_HMACSHA256:
663 fprintf(fp, "(HMAC_SHA256)\n");
665 case DST_ALG_HMACSHA384:
666 fprintf(fp, "(HMAC_SHA384)\n");
668 case DST_ALG_HMACSHA512:
669 fprintf(fp, "(HMAC_SHA512)\n");
672 fprintf(fp, "(?)\n");
676 for (i = 0; i < priv->nelements; i++) {
679 s = find_tag(priv->elements[i].tag);
681 r.base = priv->elements[i].data;
682 r.length = priv->elements[i].length;
683 isc_buffer_init(&b, buffer, sizeof(buffer));
684 result = isc_base64_totext(&r, sizeof(buffer), "", &b);
685 if (result != ISC_R_SUCCESS) {
687 return (DST_R_INVALIDPRIVATEKEY);
689 isc_buffer_usedregion(&b, &r);
691 fprintf(fp, "%s %.*s\n", s, (int)r.length, r.base);
694 /* Add the metadata tags */
695 if (major > 1 || (major == 1 && minor >= 3)) {
696 for (i = 0; i < NUMERIC_NTAGS; i++) {
697 result = dst_key_getnum(key, i, &value);
698 if (result != ISC_R_SUCCESS)
700 fprintf(fp, "%s %u\n", numerictags[i], value);
702 for (i = 0; i < TIMING_NTAGS; i++) {
703 result = dst_key_gettime(key, i, &when);
704 if (result != ISC_R_SUCCESS)
707 isc_buffer_init(&b, buffer, sizeof(buffer));
708 result = dns_time32_totext(when, &b);
709 if (result != ISC_R_SUCCESS) {
711 return (DST_R_INVALIDPRIVATEKEY);
714 isc_buffer_usedregion(&b, &r);
716 fprintf(fp, "%s %.*s\n", timetags[i], (int)r.length,
722 result = ferror(fp) ? DST_R_WRITEERROR : ISC_R_SUCCESS;