server/keyexch.c: Prefix crypto-details trace messages correctly.

[tripe] / server / keymgmt.c

/* -*-c-*-
 *
 * Key loading and storing
 *
 * (c) 2001 Straylight/Edgeware
 */

/*----- Licensing notice --------------------------------------------------*
 *
 * This file is part of Trivial IP Encryption (TrIPE).
 *
 * TrIPE is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * TrIPE is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with TrIPE; if not, write to the Free Software Foundation,
 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

/*----- Header files ------------------------------------------------------*/

#include "tripe.h"

/*----- Global variables --------------------------------------------------*/

group *gg;
mp *kpriv;
ge *kpub;
algswitch algs;
size_t indexsz;

/*----- Static variables --------------------------------------------------*/

static key_file *kf_pub;
static const char *kr_priv, *kr_pub, *tag_priv;
static fwatch w_priv, w_pub;

/*----- Key groups --------------------------------------------------------*/

typedef struct kgops {
  const char *ty;
  int (*loadpriv)(key_data *, group **, mp **, dstr *, dstr *);
  int (*loadpub)(key_data *, group **, ge **, dstr *, dstr *);
} kgops;

/* --- Diffie-Hellman --- */

static int kgdh_priv(key_data *kd, group **g, mp **x, dstr *t, dstr *e)
{
  key_packstruct kps[DH_PRIVFETCHSZ];
  key_packdef *kp;
  dh_priv dp;
  int rc;

  kp = key_fetchinit(dh_privfetch, kps, &dp);
  if ((rc = key_unpack(kp, kd, t)) != 0) {
    a_format(e, "unpack-failed", "%s", key_strerror(rc), A_END);
    goto fail_0;
  }
  *g = group_prime(&dp.dp);
  *x = MP_COPY(dp.x);
  rc = 0;
  goto done;
fail_0:
  rc = -1;
done:
  key_fetchdone(kp);
  return (rc);
}

static int kgdh_pub(key_data *kd, group **g, ge **p, dstr *t, dstr *e)
{
  key_packstruct kps[DH_PUBFETCHSZ];
  key_packdef *kp;
  dh_pub dp;
  int rc;

  kp = key_fetchinit(dh_pubfetch, kps, &dp);
  if ((rc = key_unpack(kp, kd, t)) != 0) {
    a_format(e, "unpack-failed", "%s", key_strerror(rc), A_END);
    goto fail_0;
  }
  *g = group_prime(&dp.dp);
  *p = G_CREATE(*g);
  if (G_FROMINT(*g, *p, dp.y)) {
    a_format(e, "bad-public-vector", A_END);
    goto fail_1;
  }
  rc = 0;
  goto done;
fail_1:
  G_DESTROY(*g, *p);
  G_DESTROYGROUP(*g);
fail_0:
  rc = -1;
done:
  key_fetchdone(kp);
  return (rc);
}

static const kgops kgdh_ops = { "dh", kgdh_priv, kgdh_pub };

/* --- Elliptic curve --- */

static int kgec_priv(key_data *kd, group **g, mp **x, dstr *t, dstr *e)
{
  key_packstruct kps[EC_PRIVFETCHSZ];
  key_packdef *kp;
  ec_priv ep;
  ec_info ei;
  const char *err;
  int rc;

  kp = key_fetchinit(ec_privfetch, kps, &ep);
  if ((rc = key_unpack(kp, kd, t)) != 0) {
    a_format(e, "unpack-failed", "%s", key_strerror(rc), A_END);
    goto fail_0;
  }
  if ((err = ec_getinfo(&ei, ep.cstr)) != 0) {
    a_format(e, "decode-failed", "%s", err, A_END);
    goto fail_0;
  }
  *g = group_ec(&ei);
  *x = MP_COPY(ep.x);
  rc = 0;
  goto done;
fail_0:
  rc = -1;
done:
  key_fetchdone(kp);
  return (rc);
}

static int kgec_pub(key_data *kd, group **g, ge **p, dstr *t, dstr *e)
{
  key_packstruct kps[EC_PUBFETCHSZ];
  key_packdef *kp;
  ec_pub ep;
  ec_info ei;
  const char *err;
  int rc;

  kp = key_fetchinit(ec_pubfetch, kps, &ep);
  if ((rc = key_unpack(kp, kd, t)) != 0) {
    a_format(e, "unpack-failed", "%s", key_strerror(rc), A_END);
    goto fail_0;
  }
  if ((err = ec_getinfo(&ei, ep.cstr)) != 0) {
    a_format(e, "decode-failed", "%s", err, A_END);
    goto fail_0;
  }
  *g = group_ec(&ei);
  *p = G_CREATE(*g);
  if (G_FROMEC(*g, *p, &ep.p)) {
    a_format(e, "bad-public-vector", A_END);
    goto fail_1;
  }
  rc = 0;
  goto done;
fail_1:
  G_DESTROY(*g, *p);
  G_DESTROYGROUP(*g);
fail_0:
  rc = -1;
done:
  key_fetchdone(kp);
  return (rc);
}

static const kgops kgec_ops = { "ec", kgec_priv, kgec_pub };

/* --- Table of supported key types --- */

static const kgops *kgtab[] = { &kgdh_ops, &kgec_ops, 0 };

/*----- Algswitch stuff ---------------------------------------------------*/

/* --- @algs_get@ --- *
 *
 * Arguments:	@algswitch *a@ = where to put the algorithms
 *		@dstr *e@ = where to write errror tokens
 *		@key_file *kf@ = key file
 *		@key *k@ = key to inspect
 *
 * Returns:	Zero if OK; nonzero on error.
 *
 * Use:		Extracts an algorithm choice from a key.
 */

static int algs_get(algswitch *a, dstr *e, key_file *kf, key *k)
{
  const char *p;
  char *q, *qq;
  dstr d = DSTR_INIT;
  int rc = -1;

  /* --- Symmetric encryption for bulk data --- */

  if ((p = key_getattr(kf, k, "cipher")) == 0) p = "blowfish-cbc";
  if ((a->c = gcipher_byname(p)) == 0) {
    a_format(e, "unknown-cipher", "%s", p, A_END);
    goto done;
  }

  /* --- Hash function --- */

  if ((p = key_getattr(kf, k, "hash")) == 0) p = "rmd160";
  if ((a->h = ghash_byname(p)) == 0) {
    a_format(e, "unknown-hash", "%s", p, A_END);
    goto done;
  }

  /* --- Symmetric encryption for key derivation --- */

  if ((p = key_getattr(kf, k, "mgf")) == 0) {
    dstr_reset(&d);
    dstr_putf(&d, "%s-mgf", a->h->name);
    p = d.buf;
  }
  if ((a->mgf = gcipher_byname(p)) == 0) {
    a_format(e, "unknown-mgf-cipher", "%s", p, A_END);
    goto done;
  }

  /* --- Message authentication for bulk data --- */

  if ((p = key_getattr(kf, k, "mac")) != 0) {
    dstr_reset(&d);
    dstr_puts(&d, p);
    if ((q = strchr(d.buf, '/')) != 0)
      *q++ = 0;
    if ((a->m = gmac_byname(d.buf)) == 0) {
      a_format(e, "unknown-mac", "%s", d.buf, A_END);
      goto done;
    }
    if (!q)
      a->tagsz = a->m->hashsz;
    else {
      unsigned long n = strtoul(q, &qq, 0);
      if (*qq)  {
	a_format(e, "bad-tag-length-string", "%s", q, A_END);
	goto done;
      }
      if (n%8 || n/8 > a->m->hashsz) {
	a_format(e, "bad-tag-length", "%lu", n, A_END);
	goto done;
      }
      a->tagsz = n/8;
    }
  } else {
    dstr_reset(&d);
    dstr_putf(&d, "%s-hmac", a->h->name);
    if ((a->m = gmac_byname(d.buf)) == 0) {
      a_format(e, "no-hmac-for-hash", "%s", a->h->name, A_END);
      goto done;
    }
    a->tagsz = a->h->hashsz/2;
  }

  rc = 0;
done:
  dstr_destroy(&d);
  return (rc);
}

/* --- @algs_check@ --- *
 *
 * Arguments:	@algswitch *a@ = a choice of algorithms
 *		@dstr *e@ = where to write error tokens
 *		@const group *g@ = the group we're working in
 *
 * Returns:	Zero if OK; nonzero on error.
 *
 * Use:		Checks an algorithm choice for sensibleness.  This also
 *		derives some useful information from the choices, and you
 *		must call this before committing the algorithm selection
 *		for use by @keyset@ functions.
 */

static int algs_check(algswitch *a, dstr *e, const group *g)
{
  /* --- Derive the key sizes --- *
   *
   * Must ensure that we have non-empty keys.  This isn't ideal, but it
   * provides a handy sanity check.  Also must be based on a 64- or 128-bit
   * block cipher or we can't do the data expiry properly.
   */

  a->hashsz = a->h->hashsz;
  if ((a->cksz = keysz(a->hashsz, a->c->keysz)) == 0) {
    a_format(e, "cipher", "%s", a->c->name,
	     "no-key-size", "%lu", (unsigned long)a->hashsz,
	     A_END);
    return (-1);
  }
  if ((a->mksz = keysz(a->hashsz, a->m->keysz)) == 0) {
    a_format(e, "mac", "%s", a->m->name,
	     "no-key-size", "%lu", (unsigned long)a->hashsz,
	     A_END);
    return (-1);
  }

  /* --- Derive the data limit --- */

  if (a->c->blksz < 16) a->expsz = MEG(64);
  else a->expsz = MEG(2048);

  /* --- Ensure the MGF accepts hashes as keys --- */

  if (keysz(a->hashsz, a->mgf->keysz) != a->hashsz) {
    a_format(e, "mgf", "%s", a->mgf->name,
	     "restrictive-key-schedule",
	     A_END);
    return (-1);
  }

  /* --- All ship-shape and Bristol-fashion --- */

  return (0);
}

/* --- @algs_samep@ --- *
 *
 * Arguments:	@const algswitch *a, *aa@ = two algorithm selections
 *
 * Returns:	Nonzero if the two selections are the same.
 *
 * Use:		Checks sameness of algorithm selections: used to ensure that
 *		peers are using sensible algorithms.
 */

static int algs_samep(const algswitch *a, const algswitch *aa)
{
  return (a->c == aa->c && a->mgf == aa->mgf && a->h == aa->h &&
	  a->m == aa->m && a->tagsz == aa->tagsz);
}

/*----- Main code ---------------------------------------------------------*/

/* --- @keymoan@ --- *
 *
 * Arguments:	@const char *file@ = name of the file
 *		@int line@ = line number in file
 *		@const char *msg@ = error message
 *		@void *p@ = argument pointer (indicates which keyring)
 *
 * Returns:	---
 *
 * Use:		Reports an error message about loading a key file.
 */

static void keymoan(const char *file, int line, const char *msg, void *p)
{
  const char *kind = p;

  if (!line) {
    a_warn("KEYMGMT", "%s-keyring", kind, "%s", file,
	   "io-error", "?ERRNO", A_END);
  } else {
    a_warn("KEYMGMT", "%s-keyring", kind, "%s", file, "line", "%d", line,
	   "%s", msg, A_END);
  }
}

/* --- @keykg@ --- *
 *
 * Arguments:	@key_file *kf@ = pointer to key file
 *		@key *k@ = pointer to key
 *		@const char **tyr@ = where to put the type string
 *
 * Returns:	Pointer to indicated key-group options, or null.
 *
 * Use:		Looks up a key's group indicator and tries to find a matching
 *		table entry.
 */

static const kgops *keykg(key_file *kf, key *k, const char **tyr)
{
  const char *ty;
  const kgops **ko;

  /* --- Look up the key type in the table --- *
   *
   * There are several places to look for this.  The most obvious is the
   * `kx-group' key attribute.  But there's also the key type itself.
   */

  ty = key_getattr(kf, k, "kx-group");
  if (!ty && strncmp(k->type, "tripe-", 6) == 0) ty = k->type + 6;
  if (!ty) ty = "dh";
  if (tyr) *tyr = ty;

  for (ko = kgtab; *ko; ko++) {
    if (strcmp((*ko)->ty, ty) == 0)
      return (*ko);
  }
  return (0);
}

/* --- @loadpriv@ --- *
 *
 * Arguments:	@dstr *d@ = string to write errors in
 *
 * Returns:	Zero if OK, nonzero on error.
 *
 * Use:		Loads the private key from its keyfile.
 */

static int loadpriv(void)
{
  key_file kf;
  key *k;
  key_data **kd;
  dstr t = DSTR_INIT;
  dstr e = DSTR_INIT;
  group *g = 0;
  mp *x = 0;
  int rc = -1;
  const kgops *ko;
  const char *err, *tag, *ty;
  algswitch a;

  /* --- Open the private key file --- */

  if (key_open(&kf, kr_priv, KOPEN_READ, keymoan, "private"))
    goto done_0;

  /* --- Find the private key --- */

  if (tag_priv ?
      key_qtag(&kf, tag = tag_priv, &t, &k, &kd) :
      key_qtag(&kf, tag = "tripe", &t, &k, &kd) &&
	key_qtag(&kf, tag = "tripe-dh", &t, &k, &kd)) {
    a_warn("KEYMGMT", "private-keyring", "%s", kr_priv,
	   "key-not-found", "%s", tag, A_END);
    goto done_1;
  }

  /* --- Look up the key type in the table --- */

  if ((ko = keykg(&kf, k, &ty)) == 0) {
    a_warn("KEYMGMT", "private-keyring",
	   "%s", kr_priv, "key", "%s", t.buf,
	   "unknown-group-type", "%s", ty, A_END);
    goto done_1;
  }

  /* --- Load the key --- */

  if (ko->loadpriv(*kd, &g, &x, &t, &e)) {
    a_warn("KEYMGMT", "private-keyring",
	   "%s", kr_priv, "key", "%s", t.buf,
	   "*%s", e.buf, A_END);
    goto done_1;
  }

  /* --- Check that the key is sensible --- */

  if ((err = G_CHECK(g, &rand_global)) != 0) {
    a_warn("KEYMGMT", "private-keyring",
	   "%s", kr_priv, "key", "%s", t.buf,
	   "bad-group", "%s", err, A_END);
    goto done_1;
  }

  /* --- Collect the algorithms --- */

  if (algs_get(&a, &e, &kf, k) ||
      algs_check(&a, &e, g)) {
    a_warn("KEYMGMT", "private-keyring",
	   "%s", kr_priv, "key", "%s", t.buf,
	   "*%s", e.buf, A_END);
    goto done_1;
  }

  /* --- Good, we're happy --- *
   *
   * Dodginess!	 We change the group over here, but don't free any old group
   * elements.  This assumes that the new group is basically the same as the
   * old one, and will happily adopt the existing elements.  If it isn't,
   * then we lose badly.  Check this, then.
   */

  if (gg) {
    if (!group_samep(g, gg)) {
      a_warn("KEYMGMT", "private-keyring",
	     "%s", kr_priv, "key", "%s", t.buf,
	     "changed-group", A_END);
      goto done_1;
    }
    G_DESTROYGROUP(gg);
  }
  if (kpriv)
    mp_drop(kpriv);

  if (kpub)
    G_DESTROY(g, kpub);
  kpub = G_CREATE(g);
  G_EXP(g, kpub, g->g, x);
  indexsz = mp_octets(g->r);

  /* --- Dump out the group --- */

  IF_TRACING(T_KEYMGMT, {
    trace(T_KEYMGMT, "keymgmt: extracted private key `%s'", t.buf);
    IF_TRACING(T_CRYPTO, {
      trace(T_CRYPTO, "crypto: r = %s", mpstr(g->r));
      trace(T_CRYPTO, "crypto: h = %s", mpstr(g->h));
      trace(T_CRYPTO, "crypto: x = %s", mpstr(x));
      trace(T_CRYPTO, "crypto: cipher = %s", a.c->name);
      trace(T_CRYPTO, "crypto: mgf = %s", a.mgf->name);
      trace(T_CRYPTO, "crypto: hash = %s", a.h->name);
      trace(T_CRYPTO, "crypto: mac = %s/%lu",
	    a.m->name, (unsigned long)a.tagsz * 8);
    })
  })

  /* --- Success! --- */

  gg = g; g = 0;
  algs = a;
  kpriv = x; x = 0;
  rc = 0;

  /* --- Tidy up --- */

done_1:
  key_close(&kf);
done_0:
  dstr_destroy(&t);
  dstr_destroy(&e);
  if (x) mp_drop(x);
  if (g) G_DESTROYGROUP(g);
  return (rc);
}

/* --- @loadpub@ --- *
 *
 * Arguments:	@dstr *d@ = string to write errors to
 *
 * Returns:	Zero if OK, nonzero on error.
 *
 * Use:		Reloads the public keyring.
 */

static int loadpub(void)
{
  key_file *kf = CREATE(key_file);

  if (key_open(kf, kr_pub, KOPEN_READ, keymoan, "public")) {
    DESTROY(kf);
    return (-1);
  }
  kf_pub = kf;
  T( trace(T_KEYMGMT, "keymgmt: loaded public keyring `%s'", kr_pub); )
  return (0);
}

/* --- @km_reload@ --- *
 *
 * Arguments:	---
 *
 * Returns:	Zero if OK, nonzero to force reloading of keys.
 *
 * Use:		Checks the keyrings to see if they need reloading.
 */

int km_reload(void)
{
  key_file *kf;
  int reload = 0;

  /* --- Check the private key first --- */

  if (fwatch_update(&w_priv, kr_priv)) {
    T( trace(T_KEYMGMT, "keymgmt: private keyring updated: reloading..."); )
    if (!loadpriv())
      reload = 1;
  }

  /* --- Now check the public keys --- */

  if (fwatch_update(&w_pub, kr_pub)) {
    T( trace(T_KEYMGMT, "keymgmt: public keyring updated: reloading..."); )
    kf = kf_pub;
    if (!loadpub()) {
      reload = 1;
      key_close(kf);
      DESTROY(kf);
    }
  }

  /* --- Done --- */

  return (reload);
}

/* --- @km_init@ --- *
 *
 * Arguments:	@const char *priv@ = private keyring file
 *		@const char *pub@ = public keyring file
 *		@const char *tag@ = tag to load
 *
 * Returns:	---
 *
 * Use:		Initializes, and loads the private key.
 */

void km_init(const char *priv, const char *pub, const char *tag)
{
  const gchash *const *hh;

  kr_priv = priv;
  kr_pub = pub;
  tag_priv = tag;
  fwatch_init(&w_priv, kr_priv);
  fwatch_init(&w_pub, kr_pub);

  for (hh = ghashtab; *hh; hh++) {
    if ((*hh)->hashsz > MAXHASHSZ) {
      die(EXIT_FAILURE, "INTERNAL ERROR: %s hash length %lu > MAXHASHSZ %d",
	  (*hh)->name, (unsigned long)(*hh)->hashsz, MAXHASHSZ);
    }
  }

  if (loadpriv() || loadpub())
    exit(EXIT_FAILURE);
}

/* --- @km_getpubkey@ --- *
 *
 * Arguments:	@const char *tag@ = public key tag to load
 *		@ge *kpub@ = where to put the public key
 *		@time_t *t_exp@ = where to put the expiry time
 *
 * Returns:	Zero if OK, nonzero if it failed.
 *
 * Use:		Fetches a public key from the keyring.
 */

int km_getpubkey(const char *tag, ge *kpub, time_t *t_exp)
{
  key *k;
  key_data **kd;
  dstr t = DSTR_INIT;
  dstr e = DSTR_INIT;
  const kgops *ko;
  const char *ty;
  group *g = 0;
  ge *p = 0;
  algswitch a;
  int rc = -1;

  /* --- Find the key --- */

  if (key_qtag(kf_pub, tag, &t, &k, &kd)) {
    a_warn("KEYMGMT", "public-keyring", "%s", kr_pub,
	   "key-not-found", "%s", tag, A_END);
    goto done;
  }

  /* --- Look up the key type in the table --- */

  if ((ko = keykg(kf_pub, k, &ty)) == 0) {
    a_warn("KEYMGMT", "public-keyring",
	   "%s", kr_pub, "key", "%s", t.buf,
	   "unknown-group-type", "%s", ty, A_END);
    goto done;
  }

  /* --- Load the key --- */

  if (ko->loadpub(*kd, &g, &p, &t, &e)) {
    a_warn("KEYMGMT", "public-keyring",
	   "%s", kr_pub, "key", "%s", t.buf,
	   "*%s", e.buf, A_END);
    goto done;
  }

  /* --- Ensure that the group is correct --- *
   *
   * Dodginess!	 We assume that if this works, our global group is willing to
   * adopt this public element.  Probably reasonable.
   */

  if (!group_samep(gg, g)) {
    a_warn("KEYMGMT", "public-keyring",
	   "%s", kr_pub, "key", "%s", t.buf,
	   "*%s", e.buf, A_END);
    goto done;
  }

  /* --- Check the public group element --- */

  if (group_check(gg, p)) {
    a_warn("KEYMGMT", "public-keyring",
	   "%s", kr_pub, "key", "%s", t.buf,
	   "bad-public-group-element",
	   A_END);
    goto done;
  }

  /* --- Check the algorithms --- */

  if (algs_get(&a, &e, kf_pub, k)) {
    a_warn("KEYMGMT", "public-keyring",
	   "%s", kr_pub, "key", "%s", t.buf,
	   "*%s", e.buf, A_END);
    goto done;
  }
  if (!algs_samep(&a, &algs)) {
    a_warn("KEYMGMT", "public-keyring",
	   "%s", kr_pub, "key", "%s", t.buf,
	   "algorithm-mismatch", A_END);
    goto done;
  }

  /* --- Dump the public key --- */

  IF_TRACING(T_KEYMGMT, {
    trace(T_KEYMGMT, "keymgmt: extracted public key `%s'", t.buf);
    trace(T_CRYPTO, "crypto: p = %s", gestr(gg, p));
  })

  /* --- OK, accept the public key --- */

  *t_exp = k->exp;
  G_COPY(gg, kpub, p);
  rc = 0;

  /* --- Tidy up --- */

done:
  if (p) G_DESTROY(g, p);
  if (g) G_DESTROYGROUP(g);
  dstr_destroy(&t);
  dstr_destroy(&e);
  return (rc);
}

/*----- That's all, folks -------------------------------------------------*/