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/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:"},
70 {TAG_RSA_ENGINE, "Engine:" },
71 {TAG_RSA_LABEL, "Label:" },
72 {TAG_RSA_PIN, "PIN:" },
74 {TAG_DH_PRIME, "Prime(p):"},
75 {TAG_DH_GENERATOR, "Generator(g):"},
76 {TAG_DH_PRIVATE, "Private_value(x):"},
77 {TAG_DH_PUBLIC, "Public_value(y):"},
79 {TAG_DSA_PRIME, "Prime(p):"},
80 {TAG_DSA_SUBPRIME, "Subprime(q):"},
81 {TAG_DSA_BASE, "Base(g):"},
82 {TAG_DSA_PRIVATE, "Private_value(x):"},
83 {TAG_DSA_PUBLIC, "Public_value(y):"},
85 {TAG_HMACMD5_KEY, "Key:"},
86 {TAG_HMACMD5_BITS, "Bits:"},
88 {TAG_HMACSHA1_KEY, "Key:"},
89 {TAG_HMACSHA1_BITS, "Bits:"},
91 {TAG_HMACSHA224_KEY, "Key:"},
92 {TAG_HMACSHA224_BITS, "Bits:"},
94 {TAG_HMACSHA256_KEY, "Key:"},
95 {TAG_HMACSHA256_BITS, "Bits:"},
97 {TAG_HMACSHA384_KEY, "Key:"},
98 {TAG_HMACSHA384_BITS, "Bits:"},
100 {TAG_HMACSHA512_KEY, "Key:"},
101 {TAG_HMACSHA512_BITS, "Bits:"},
107 find_value(const char *s, const unsigned int alg) {
111 if (map[i].tag == NULL)
113 else if (strcasecmp(s, map[i].tag) == 0 &&
114 TAG_ALG(map[i].value) == alg)
115 return (map[i].value);
120 find_tag(const int value) {
124 if (map[i].tag == NULL)
126 else if (value == map[i].value)
132 check_rsa(const dst_private_t *priv) {
134 isc_boolean_t have[RSA_NTAGS];
138 for (i = 0; i < RSA_NTAGS; i++)
140 for (j = 0; j < priv->nelements; j++) {
141 for (i = 0; i < RSA_NTAGS; i++)
142 if (priv->elements[j].tag == TAG(DST_ALG_RSAMD5, i))
150 mask <<= sizeof(mask) * 8 - TAG_SHIFT;
151 mask >>= sizeof(mask) * 8 - TAG_SHIFT;
153 if (have[TAG_RSA_ENGINE & mask])
154 ok = have[TAG_RSA_MODULUS & mask] &&
155 have[TAG_RSA_PUBLICEXPONENT & mask] &&
156 have[TAG_RSA_LABEL & mask];
158 ok = have[TAG_RSA_MODULUS & mask] &&
159 have[TAG_RSA_PUBLICEXPONENT & mask] &&
160 have[TAG_RSA_PRIVATEEXPONENT & mask] &&
161 have[TAG_RSA_PRIME1 & mask] &&
162 have[TAG_RSA_PRIME2 & mask] &&
163 have[TAG_RSA_EXPONENT1 & mask] &&
164 have[TAG_RSA_EXPONENT2 & mask] &&
165 have[TAG_RSA_COEFFICIENT & mask];
166 return (ok ? 0 : -1 );
170 check_dh(const dst_private_t *priv) {
172 if (priv->nelements != DH_NTAGS)
174 for (i = 0; i < DH_NTAGS; i++) {
175 for (j = 0; j < priv->nelements; j++)
176 if (priv->elements[j].tag == TAG(DST_ALG_DH, i))
178 if (j == priv->nelements)
185 check_dsa(const dst_private_t *priv) {
187 if (priv->nelements != DSA_NTAGS)
189 for (i = 0; i < DSA_NTAGS; i++) {
190 for (j = 0; j < priv->nelements; j++)
191 if (priv->elements[j].tag == TAG(DST_ALG_DSA, i))
193 if (j == priv->nelements)
200 check_hmac_md5(const dst_private_t *priv, isc_boolean_t old) {
203 if (priv->nelements != HMACMD5_NTAGS) {
205 * If this is a good old format and we are accepting
206 * the old format return success.
208 if (old && priv->nelements == OLD_HMACMD5_NTAGS &&
209 priv->elements[0].tag == TAG_HMACMD5_KEY)
214 * We must be new format at this point.
216 for (i = 0; i < HMACMD5_NTAGS; i++) {
217 for (j = 0; j < priv->nelements; j++)
218 if (priv->elements[j].tag == TAG(DST_ALG_HMACMD5, i))
220 if (j == priv->nelements)
227 check_hmac_sha(const dst_private_t *priv, unsigned int ntags,
231 if (priv->nelements != ntags)
233 for (i = 0; i < ntags; i++) {
234 for (j = 0; j < priv->nelements; j++)
235 if (priv->elements[j].tag == TAG(alg, i))
237 if (j == priv->nelements)
244 check_data(const dst_private_t *priv, const unsigned int alg,
247 /* XXXVIX this switch statement is too sparse to gen a jump table. */
250 case DST_ALG_RSASHA1:
251 case DST_ALG_NSEC3RSASHA1:
252 case DST_ALG_RSASHA256:
253 case DST_ALG_RSASHA512:
254 return (check_rsa(priv));
256 return (check_dh(priv));
258 case DST_ALG_NSEC3DSA:
259 return (check_dsa(priv));
260 case DST_ALG_HMACMD5:
261 return (check_hmac_md5(priv, old));
262 case DST_ALG_HMACSHA1:
263 return (check_hmac_sha(priv, HMACSHA1_NTAGS, alg));
264 case DST_ALG_HMACSHA224:
265 return (check_hmac_sha(priv, HMACSHA224_NTAGS, alg));
266 case DST_ALG_HMACSHA256:
267 return (check_hmac_sha(priv, HMACSHA256_NTAGS, alg));
268 case DST_ALG_HMACSHA384:
269 return (check_hmac_sha(priv, HMACSHA384_NTAGS, alg));
270 case DST_ALG_HMACSHA512:
271 return (check_hmac_sha(priv, HMACSHA512_NTAGS, alg));
273 return (DST_R_UNSUPPORTEDALG);
278 dst__privstruct_free(dst_private_t *priv, isc_mem_t *mctx) {
283 for (i = 0; i < priv->nelements; i++) {
284 if (priv->elements[i].data == NULL)
286 memset(priv->elements[i].data, 0, MAXFIELDSIZE);
287 isc_mem_put(mctx, priv->elements[i].data, MAXFIELDSIZE);
293 dst__privstruct_parse(dst_key_t *key, unsigned int alg, isc_lex_t *lex,
294 isc_mem_t *mctx, dst_private_t *priv)
296 int n = 0, major, minor, check;
299 unsigned char *data = NULL;
300 unsigned int opt = ISC_LEXOPT_EOL;
303 REQUIRE(priv != NULL);
306 memset(priv->elements, 0, sizeof(priv->elements));
308 #define NEXTTOKEN(lex, opt, token) \
310 ret = isc_lex_gettoken(lex, opt, token); \
311 if (ret != ISC_R_SUCCESS) \
315 #define READLINE(lex, opt, token) \
317 ret = isc_lex_gettoken(lex, opt, token); \
318 if (ret == ISC_R_EOF) \
320 else if (ret != ISC_R_SUCCESS) \
322 } while ((*token).type != isc_tokentype_eol)
325 * Read the description line.
327 NEXTTOKEN(lex, opt, &token);
328 if (token.type != isc_tokentype_string ||
329 strcmp(DST_AS_STR(token), PRIVATE_KEY_STR) != 0)
331 ret = DST_R_INVALIDPRIVATEKEY;
335 NEXTTOKEN(lex, opt, &token);
336 if (token.type != isc_tokentype_string ||
337 (DST_AS_STR(token))[0] != 'v')
339 ret = DST_R_INVALIDPRIVATEKEY;
342 if (sscanf(DST_AS_STR(token), "v%d.%d", &major, &minor) != 2)
344 ret = DST_R_INVALIDPRIVATEKEY;
348 if (major > MAJOR_VERSION ||
349 (major == MAJOR_VERSION && minor > MINOR_VERSION))
351 ret = DST_R_INVALIDPRIVATEKEY;
355 READLINE(lex, opt, &token);
358 * Read the algorithm line.
360 NEXTTOKEN(lex, opt, &token);
361 if (token.type != isc_tokentype_string ||
362 strcmp(DST_AS_STR(token), ALGORITHM_STR) != 0)
364 ret = DST_R_INVALIDPRIVATEKEY;
368 NEXTTOKEN(lex, opt | ISC_LEXOPT_NUMBER, &token);
369 if (token.type != isc_tokentype_number ||
370 token.value.as_ulong != (unsigned long) dst_key_alg(key))
372 ret = DST_R_INVALIDPRIVATEKEY;
376 READLINE(lex, opt, &token);
381 for (n = 0; n < MAXFIELDS; n++) {
386 ret = isc_lex_gettoken(lex, opt, &token);
387 if (ret == ISC_R_EOF)
389 if (ret != ISC_R_SUCCESS)
391 } while (token.type == isc_tokentype_eol);
393 if (token.type != isc_tokentype_string) {
394 ret = DST_R_INVALIDPRIVATEKEY;
398 tag = find_value(DST_AS_STR(token), alg);
399 if (tag < 0 || TAG_ALG(tag) != alg) {
400 ret = DST_R_INVALIDPRIVATEKEY;
403 priv->elements[n].tag = tag;
405 data = (unsigned char *) isc_mem_get(mctx, MAXFIELDSIZE);
409 isc_buffer_init(&b, data, MAXFIELDSIZE);
410 ret = isc_base64_tobuffer(lex, &b, -1);
411 if (ret != ISC_R_SUCCESS)
413 isc_buffer_usedregion(&b, &r);
414 priv->elements[n].length = r.length;
415 priv->elements[n].data = r.base;
417 READLINE(lex, opt, &token);
423 check = check_data(priv, alg, ISC_TRUE);
425 ret = DST_R_INVALIDPRIVATEKEY;
427 } else if (check != ISC_R_SUCCESS) {
432 return (ISC_R_SUCCESS);
436 dst__privstruct_free(priv, mctx);
438 isc_mem_put(mctx, data, MAXFIELDSIZE);
444 dst__privstruct_writefile(const dst_key_t *key, const dst_private_t *priv,
445 const char *directory)
450 char filename[ISC_DIR_NAMEMAX];
451 char buffer[MAXFIELDSIZE * 2];
453 isc_fsaccess_t access;
455 REQUIRE(priv != NULL);
457 ret = check_data(priv, dst_key_alg(key), ISC_FALSE);
459 return (DST_R_INVALIDPRIVATEKEY);
460 else if (ret != ISC_R_SUCCESS)
463 isc_buffer_init(&b, filename, sizeof(filename));
464 result = dst_key_buildfilename(key, DST_TYPE_PRIVATE, directory, &b);
465 if (result != ISC_R_SUCCESS)
468 if ((fp = fopen(filename, "w")) == NULL)
469 return (DST_R_WRITEERROR);
472 isc_fsaccess_add(ISC_FSACCESS_OWNER,
473 ISC_FSACCESS_READ | ISC_FSACCESS_WRITE,
475 (void)isc_fsaccess_set(filename, access);
477 /* XXXDCL return value should be checked for full filesystem */
478 fprintf(fp, "%s v%d.%d\n", PRIVATE_KEY_STR, MAJOR_VERSION,
481 fprintf(fp, "%s %d ", ALGORITHM_STR, dst_key_alg(key));
482 /* XXXVIX this switch statement is too sparse to gen a jump table. */
483 switch (dst_key_alg(key)) {
485 fprintf(fp, "(RSA)\n");
488 fprintf(fp, "(DH)\n");
491 fprintf(fp, "(DSA)\n");
493 case DST_ALG_RSASHA1:
494 fprintf(fp, "(RSASHA1)\n");
496 case DST_ALG_NSEC3DSA:
497 fprintf(fp, "(NSEC3DSA)\n");
499 case DST_ALG_NSEC3RSASHA1:
500 fprintf(fp, "(NSEC3RSASHA1)\n");
502 case DST_ALG_RSASHA256:
503 fprintf(fp, "(RSASHA256)\n");
505 case DST_ALG_RSASHA512:
506 fprintf(fp, "(RSASHA512)\n");
508 case DST_ALG_HMACMD5:
509 fprintf(fp, "(HMAC_MD5)\n");
511 case DST_ALG_HMACSHA1:
512 fprintf(fp, "(HMAC_SHA1)\n");
514 case DST_ALG_HMACSHA224:
515 fprintf(fp, "(HMAC_SHA224)\n");
517 case DST_ALG_HMACSHA256:
518 fprintf(fp, "(HMAC_SHA256)\n");
520 case DST_ALG_HMACSHA384:
521 fprintf(fp, "(HMAC_SHA384)\n");
523 case DST_ALG_HMACSHA512:
524 fprintf(fp, "(HMAC_SHA512)\n");
527 fprintf(fp, "(?)\n");
531 for (i = 0; i < priv->nelements; i++) {
536 s = find_tag(priv->elements[i].tag);
538 r.base = priv->elements[i].data;
539 r.length = priv->elements[i].length;
540 isc_buffer_init(&b, buffer, sizeof(buffer));
541 result = isc_base64_totext(&r, sizeof(buffer), "", &b);
542 if (result != ISC_R_SUCCESS) {
544 return (DST_R_INVALIDPRIVATEKEY);
546 isc_buffer_usedregion(&b, &r);
548 fprintf(fp, "%s %.*s\n", s, (int)r.length, r.base);
552 result = ferror(fp) ? DST_R_WRITEERROR : ISC_R_SUCCESS;