2006-04-19 11:26:11 +00:00
|
|
|
/* skclist.c - Build a list of secret keys
|
2010-02-02 14:06:19 +00:00
|
|
|
* Copyright (C) 1998, 1999, 2000, 2001, 2006,
|
|
|
|
* 2010 Free Software Foundation, Inc.
|
1997-12-31 12:32:54 +00:00
|
|
|
*
|
1998-12-23 12:41:40 +00:00
|
|
|
* This file is part of GnuPG.
|
1997-12-31 12:32:54 +00:00
|
|
|
*
|
1998-12-23 12:41:40 +00:00
|
|
|
* GnuPG is free software; you can redistribute it and/or modify
|
1997-12-31 12:32:54 +00:00
|
|
|
* it under the terms of the GNU General Public License as published by
|
2007-07-04 19:49:40 +00:00
|
|
|
* the Free Software Foundation; either version 3 of the License, or
|
1997-12-31 12:32:54 +00:00
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
1998-12-23 12:41:40 +00:00
|
|
|
* GnuPG is distributed in the hope that it will be useful,
|
1997-12-31 12:32:54 +00:00
|
|
|
* 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
|
2007-07-04 19:49:40 +00:00
|
|
|
* along with this program; if not, see <http://www.gnu.org/licenses/>.
|
1997-12-31 12:32:54 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <assert.h>
|
|
|
|
|
2006-04-19 11:26:11 +00:00
|
|
|
#include "gpg.h"
|
1997-12-31 12:32:54 +00:00
|
|
|
#include "options.h"
|
|
|
|
#include "packet.h"
|
2007-11-19 16:03:50 +00:00
|
|
|
#include "status.h"
|
1997-12-31 12:32:54 +00:00
|
|
|
#include "keydb.h"
|
|
|
|
#include "util.h"
|
1998-11-10 12:59:59 +00:00
|
|
|
#include "i18n.h"
|
1997-12-31 12:32:54 +00:00
|
|
|
|
|
|
|
|
2006-08-21 20:20:23 +00:00
|
|
|
/* Return true if Libgcrypt's RNG is in faked mode. */
|
|
|
|
int
|
2006-05-23 16:19:43 +00:00
|
|
|
random_is_faked (void)
|
|
|
|
{
|
2010-02-02 14:06:19 +00:00
|
|
|
return !!gcry_control (GCRYCTL_FAKED_RANDOM_P, 0);
|
2006-05-23 16:19:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1997-12-31 12:32:54 +00:00
|
|
|
void
|
2010-02-02 14:06:19 +00:00
|
|
|
release_sk_list (SK_LIST sk_list)
|
1997-12-31 12:32:54 +00:00
|
|
|
{
|
2010-02-02 14:06:19 +00:00
|
|
|
SK_LIST sk_rover;
|
1997-12-31 12:32:54 +00:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
for (; sk_list; sk_list = sk_rover)
|
|
|
|
{
|
|
|
|
sk_rover = sk_list->next;
|
2011-09-20 19:24:52 +02:00
|
|
|
free_public_key (sk_list->pk);
|
2010-02-02 14:06:19 +00:00
|
|
|
xfree (sk_list);
|
1997-12-31 12:32:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-01-12 10:20:24 +00:00
|
|
|
|
2006-04-19 11:26:11 +00:00
|
|
|
/* Check that we are only using keys which don't have
|
|
|
|
* the string "(insecure!)" or "not secure" or "do not use"
|
2010-02-02 14:06:19 +00:00
|
|
|
* in one of the user ids. */
|
2006-04-19 11:26:11 +00:00
|
|
|
static int
|
2010-02-02 14:06:19 +00:00
|
|
|
is_insecure (PKT_public_key *pk)
|
2006-04-19 11:26:11 +00:00
|
|
|
{
|
2010-02-02 14:06:19 +00:00
|
|
|
u32 keyid[2];
|
|
|
|
KBNODE node = NULL, u;
|
|
|
|
int insecure = 0;
|
2006-04-19 11:26:11 +00:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
keyid_from_pk (pk, keyid);
|
|
|
|
node = get_pubkeyblock (keyid);
|
|
|
|
for (u = node; u; u = u->next)
|
|
|
|
{
|
|
|
|
if (u->pkt->pkttype == PKT_USER_ID)
|
|
|
|
{
|
|
|
|
PKT_user_id *id = u->pkt->pkt.user_id;
|
|
|
|
if (id->attrib_data)
|
|
|
|
continue; /* skip attribute packets */
|
|
|
|
if (strstr (id->name, "(insecure!)")
|
|
|
|
|| strstr (id->name, "not secure")
|
|
|
|
|| strstr (id->name, "do not use")
|
|
|
|
|| strstr (id->name, "(INSECURE!)"))
|
|
|
|
{
|
|
|
|
insecure = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-04-19 11:26:11 +00:00
|
|
|
}
|
2010-02-02 14:06:19 +00:00
|
|
|
release_kbnode (node);
|
|
|
|
|
|
|
|
return insecure;
|
2006-04-19 11:26:11 +00:00
|
|
|
}
|
2002-06-29 13:46:34 +00:00
|
|
|
|
|
|
|
static int
|
2010-02-02 14:06:19 +00:00
|
|
|
key_present_in_sk_list (SK_LIST sk_list, PKT_public_key *pk)
|
2002-06-29 13:46:34 +00:00
|
|
|
{
|
2010-02-02 14:06:19 +00:00
|
|
|
for (; sk_list; sk_list = sk_list->next)
|
|
|
|
{
|
|
|
|
if (!cmp_public_keys (sk_list->pk, pk))
|
|
|
|
return 0;
|
2002-06-29 13:46:34 +00:00
|
|
|
}
|
2010-02-02 14:06:19 +00:00
|
|
|
return -1;
|
2002-06-29 13:46:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2006-10-02 11:54:35 +00:00
|
|
|
is_duplicated_entry (strlist_t list, strlist_t item)
|
2002-06-29 13:46:34 +00:00
|
|
|
{
|
2010-02-02 14:06:19 +00:00
|
|
|
for (; list && list != item; list = list->next)
|
|
|
|
{
|
|
|
|
if (!strcmp (list->d, item->d))
|
|
|
|
return 1;
|
2002-06-29 13:46:34 +00:00
|
|
|
}
|
2010-02-02 14:06:19 +00:00
|
|
|
return 0;
|
2002-06-29 13:46:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
gpg_error_t
|
2010-04-23 11:36:59 +00:00
|
|
|
build_sk_list (strlist_t locusr, SK_LIST *ret_sk_list, unsigned int use)
|
1997-12-31 12:32:54 +00:00
|
|
|
{
|
2010-02-02 14:06:19 +00:00
|
|
|
gpg_error_t err;
|
|
|
|
SK_LIST sk_list = NULL;
|
1997-12-31 12:32:54 +00:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
if (!locusr) /* No user ids given - use the default key. */
|
|
|
|
{
|
|
|
|
PKT_public_key *pk;
|
1997-12-31 12:32:54 +00:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
pk = xmalloc_clear (sizeof *pk);
|
|
|
|
pk->req_usage = use;
|
|
|
|
if ((err = getkey_byname (NULL, pk, NULL, 1, NULL)))
|
|
|
|
{
|
|
|
|
free_public_key (pk);
|
|
|
|
pk = NULL;
|
|
|
|
log_error ("no default secret key: %s\n", gpg_strerror (err));
|
|
|
|
write_status_text (STATUS_INV_SGNR, get_inv_recpsgnr_code (err));
|
|
|
|
}
|
|
|
|
else if ((err = openpgp_pk_test_algo2 (pk->pubkey_algo, use)))
|
|
|
|
{
|
|
|
|
free_public_key (pk);
|
|
|
|
pk = NULL;
|
|
|
|
log_error ("invalid default secret key: %s\n", gpg_strerror (err));
|
|
|
|
write_status_text (STATUS_INV_SGNR, get_inv_recpsgnr_code (err));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
SK_LIST r;
|
2011-02-04 12:57:53 +01:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
if (random_is_faked () && !is_insecure (pk))
|
|
|
|
{
|
|
|
|
log_info (_("key is not flagged as insecure - "
|
|
|
|
"can't use it with the faked RNG!\n"));
|
|
|
|
free_public_key (pk);
|
|
|
|
pk = NULL;
|
|
|
|
write_status_text (STATUS_INV_SGNR,
|
|
|
|
get_inv_recpsgnr_code (GPG_ERR_NOT_TRUSTED));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
r = xmalloc (sizeof *r);
|
|
|
|
r->pk = pk;
|
|
|
|
pk = NULL;
|
|
|
|
r->next = sk_list;
|
|
|
|
r->mark = 0;
|
|
|
|
sk_list = r;
|
|
|
|
}
|
1997-12-31 12:32:54 +00:00
|
|
|
}
|
2010-02-02 14:06:19 +00:00
|
|
|
}
|
|
|
|
else /* Check the given user ids. */
|
|
|
|
{
|
|
|
|
strlist_t locusr_orig = locusr;
|
2002-06-29 13:46:34 +00:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
for (; locusr; locusr = locusr->next)
|
|
|
|
{
|
|
|
|
PKT_public_key *pk;
|
2002-06-29 13:46:34 +00:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
err = 0;
|
|
|
|
/* Do an early check against duplicated entries. However
|
|
|
|
* this won't catch all duplicates because the user IDs may
|
|
|
|
* be specified in different ways. */
|
|
|
|
if (is_duplicated_entry (locusr_orig, locusr))
|
|
|
|
{
|
|
|
|
log_info (_("skipped \"%s\": duplicated\n"), locusr->d);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
pk = xmalloc_clear (sizeof *pk);
|
|
|
|
pk->req_usage = use;
|
|
|
|
if ((err = getkey_byname (NULL, pk, locusr->d, 1, NULL)))
|
|
|
|
{
|
|
|
|
free_public_key (pk);
|
|
|
|
pk = NULL;
|
|
|
|
log_error (_("skipped \"%s\": %s\n"),
|
|
|
|
locusr->d, gpg_strerror (err));
|
|
|
|
write_status_text_and_buffer
|
|
|
|
(STATUS_INV_SGNR, get_inv_recpsgnr_code (err),
|
|
|
|
locusr->d, strlen (locusr->d), -1);
|
|
|
|
}
|
|
|
|
else if (!key_present_in_sk_list (sk_list, pk))
|
|
|
|
{
|
|
|
|
free_public_key (pk);
|
|
|
|
pk = NULL;
|
|
|
|
log_info (_("skipped: secret key already present\n"));
|
|
|
|
}
|
|
|
|
else if ((err = openpgp_pk_test_algo2 (pk->pubkey_algo, use)))
|
|
|
|
{
|
|
|
|
free_public_key (pk);
|
|
|
|
pk = NULL;
|
|
|
|
log_error ("skipped \"%s\": %s\n", locusr->d, gpg_strerror (err));
|
|
|
|
write_status_text_and_buffer
|
|
|
|
(STATUS_INV_SGNR, get_inv_recpsgnr_code (err),
|
|
|
|
locusr->d, strlen (locusr->d), -1);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
SK_LIST r;
|
2011-02-04 12:57:53 +01:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
if (pk->version == 4 && (use & PUBKEY_USAGE_SIG)
|
|
|
|
&& pk->pubkey_algo == PUBKEY_ALGO_ELGAMAL_E)
|
|
|
|
{
|
|
|
|
log_info (_("skipped \"%s\": %s\n"), locusr->d,
|
|
|
|
_("this is a PGP generated Elgamal key which"
|
|
|
|
" is not secure for signatures!"));
|
|
|
|
free_public_key (pk);
|
|
|
|
pk = NULL;
|
|
|
|
write_status_text_and_buffer
|
|
|
|
(STATUS_INV_SGNR,
|
|
|
|
get_inv_recpsgnr_code (GPG_ERR_WRONG_KEY_USAGE),
|
|
|
|
locusr->d, strlen (locusr->d), -1);
|
1998-05-04 18:49:26 +00:00
|
|
|
}
|
2010-02-02 14:06:19 +00:00
|
|
|
else if (random_is_faked () && !is_insecure (pk))
|
|
|
|
{
|
|
|
|
log_info (_("key is not flagged as insecure - "
|
|
|
|
"can't use it with the faked RNG!\n"));
|
|
|
|
free_public_key (pk);
|
|
|
|
pk = NULL;
|
|
|
|
write_status_text_and_buffer
|
|
|
|
(STATUS_INV_SGNR,
|
|
|
|
get_inv_recpsgnr_code (GPG_ERR_NOT_TRUSTED),
|
|
|
|
locusr->d, strlen (locusr->d), -1);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
r = xmalloc (sizeof *r);
|
|
|
|
r->pk = pk;
|
|
|
|
pk = NULL;
|
|
|
|
r->next = sk_list;
|
|
|
|
r->mark = 0;
|
|
|
|
sk_list = r;
|
1998-05-04 18:49:26 +00:00
|
|
|
}
|
1997-12-31 12:32:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
if (!err && !sk_list)
|
|
|
|
{
|
|
|
|
log_error ("no valid signators\n");
|
|
|
|
write_status_text (STATUS_NO_SGNR, "0");
|
|
|
|
err = gpg_error (GPG_ERR_NO_USER_ID);
|
1997-12-31 12:32:54 +00:00
|
|
|
}
|
2011-02-04 12:57:53 +01:00
|
|
|
|
2010-02-02 14:06:19 +00:00
|
|
|
if (err)
|
|
|
|
release_sk_list (sk_list);
|
|
|
|
else
|
|
|
|
*ret_sk_list = sk_list;
|
|
|
|
return err;
|
1997-12-31 12:32:54 +00:00
|
|
|
}
|