1
0
mirror of git://git.gnupg.org/gnupg.git synced 2024-11-10 21:38:50 +01:00
gnupg/g10/skclist.c

177 lines
4.6 KiB
C
Raw Normal View History

1997-12-31 13:32:54 +01:00
/* skclist.c
2002-06-29 15:46:34 +02:00
* Copyright (C) 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
1997-12-31 13:32:54 +01:00
*
* This file is part of GnuPG.
1997-12-31 13:32:54 +01:00
*
* GnuPG is free software; you can redistribute it and/or modify
1997-12-31 13:32:54 +01:00
* 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.
*
* GnuPG is distributed in the hope that it will be useful,
1997-12-31 13:32:54 +01: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
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*/
#include <config.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <assert.h>
#include "options.h"
#include "packet.h"
#include "errors.h"
#include "keydb.h"
2002-06-29 15:46:34 +02:00
#include "memory.h"
1997-12-31 13:32:54 +01:00
#include "util.h"
1998-11-10 13:59:59 +01:00
#include "i18n.h"
2002-06-29 15:46:34 +02:00
#include "cipher.h"
1997-12-31 13:32:54 +01:00
void
1998-06-29 14:30:57 +02:00
release_sk_list( SK_LIST sk_list )
1997-12-31 13:32:54 +01:00
{
1998-06-29 14:30:57 +02:00
SK_LIST sk_rover;
1997-12-31 13:32:54 +01:00
1998-06-29 14:30:57 +02:00
for( ; sk_list; sk_list = sk_rover ) {
sk_rover = sk_list->next;
free_secret_key( sk_list->sk );
xfree ( sk_list );
1997-12-31 13:32:54 +01:00
}
}
2002-06-29 15:46:34 +02:00
static int
key_present_in_sk_list(SK_LIST sk_list, PKT_secret_key *sk)
{
for (; sk_list; sk_list = sk_list->next) {
if ( !cmp_secret_keys(sk_list->sk, sk) )
return 0;
}
return -1;
}
static int
is_duplicated_entry (STRLIST list, STRLIST item)
{
for(; list && list != item; list = list->next) {
if ( !strcmp (list->d, item->d) )
return 1;
}
return 0;
}
1997-12-31 13:32:54 +01:00
int
2002-06-29 15:46:34 +02:00
build_sk_list( STRLIST locusr, SK_LIST *ret_sk_list,
int unlock, unsigned int use )
1997-12-31 13:32:54 +01:00
{
1998-06-29 14:30:57 +02:00
SK_LIST sk_list = NULL;
1997-12-31 13:32:54 +01:00
int rc;
if( !locusr ) { /* use the default one */
1998-06-29 14:30:57 +02:00
PKT_secret_key *sk;
1997-12-31 13:32:54 +01:00
sk = xcalloc (1, sizeof *sk );
sk->req_usage = use;
2002-06-29 15:46:34 +02:00
if( (rc = get_seckey_byname( sk, NULL, unlock )) ) {
1998-06-29 14:30:57 +02:00
free_secret_key( sk ); sk = NULL;
log_error("no default secret key: %s\n", gpg_strerror (rc) );
1997-12-31 13:32:54 +01:00
}
else if( !(rc=openpgp_pk_test_algo (sk->pubkey_algo, use)) ) {
1998-06-29 14:30:57 +02:00
SK_LIST r;
2002-06-29 15:46:34 +02:00
if( sk->version == 4 && (use & PUBKEY_USAGE_SIG)
&& sk->pubkey_algo == PUBKEY_ALGO_ELGAMAL_E ) {
log_info("this is a PGP generated "
1998-04-08 21:49:02 +02:00
"ElGamal key which is NOT secure for signatures!\n");
1998-06-29 14:30:57 +02:00
free_secret_key( sk ); sk = NULL;
1998-05-04 20:49:26 +02:00
}
else {
r = xmalloc ( sizeof *r );
1998-06-29 14:30:57 +02:00
r->sk = sk; sk = NULL;
r->next = sk_list;
1998-05-04 20:49:26 +02:00
r->mark = 0;
1998-06-29 14:30:57 +02:00
sk_list = r;
1998-05-04 20:49:26 +02:00
}
1997-12-31 13:32:54 +01:00
}
else {
1998-06-29 14:30:57 +02:00
free_secret_key( sk ); sk = NULL;
log_error("invalid default secret key: %s\n", gpg_strerror (rc) );
1997-12-31 13:32:54 +01:00
}
}
else {
2002-06-29 15:46:34 +02:00
STRLIST locusr_orig = locusr;
1997-12-31 13:32:54 +01:00
for(; locusr; locusr = locusr->next ) {
1998-06-29 14:30:57 +02:00
PKT_secret_key *sk;
2002-06-29 15:46:34 +02:00
rc = 0;
/* Do an early check agains 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_error(_("skipped `%s': duplicated\n"), locusr->d );
continue;
}
sk = xcalloc (1, sizeof *sk );
sk->req_usage = use;
2002-06-29 15:46:34 +02:00
if( (rc = get_seckey_byname( sk, locusr->d, 0 )) ) {
1998-06-29 14:30:57 +02:00
free_secret_key( sk ); sk = NULL;
log_error(_("skipped `%s': %s\n"), locusr->d, gpg_strerror (rc) );
1997-12-31 13:32:54 +01:00
}
2002-06-29 15:46:34 +02:00
else if ( key_present_in_sk_list(sk_list, sk) == 0) {
free_secret_key(sk); sk = NULL;
log_info(_("skipped: secret key already present\n"));
}
else if ( unlock && (rc = check_secret_key( sk, 0 )) ) {
free_secret_key( sk ); sk = NULL;
log_error(_("skipped `%s': %s\n"), locusr->d, gpg_strerror (rc) );
2002-06-29 15:46:34 +02:00
}
else if( !(rc=openpgp_pk_test_algo (sk->pubkey_algo, use)) ) {
1998-06-29 14:30:57 +02:00
SK_LIST r;
2002-06-29 15:46:34 +02:00
if( sk->version == 4 && (use & PUBKEY_USAGE_SIG)
&& sk->pubkey_algo == PUBKEY_ALGO_ELGAMAL_E ) {
log_info(_("skipped `%s': this is a PGP generated "
1998-11-10 13:59:59 +01:00
"ElGamal key which is not secure for signatures!\n"),
1998-05-04 20:49:26 +02:00
locusr->d );
1998-06-29 14:30:57 +02:00
free_secret_key( sk ); sk = NULL;
1998-05-04 20:49:26 +02:00
}
else {
r = xmalloc ( sizeof *r );
1998-06-29 14:30:57 +02:00
r->sk = sk; sk = NULL;
r->next = sk_list;
1998-05-04 20:49:26 +02:00
r->mark = 0;
1998-06-29 14:30:57 +02:00
sk_list = r;
1998-05-04 20:49:26 +02:00
}
1997-12-31 13:32:54 +01:00
}
else {
1998-06-29 14:30:57 +02:00
free_secret_key( sk ); sk = NULL;
log_error("skipped `%s': %s\n", locusr->d, gpg_strerror (rc) );
1997-12-31 13:32:54 +01:00
}
}
}
1998-06-29 14:30:57 +02:00
if( !rc && !sk_list ) {
1997-12-31 13:32:54 +01:00
log_error("no valid signators\n");
rc = GPG_ERR_NO_USER_ID;
1997-12-31 13:32:54 +01:00
}
if( rc )
1998-06-29 14:30:57 +02:00
release_sk_list( sk_list );
1997-12-31 13:32:54 +01:00
else
1998-06-29 14:30:57 +02:00
*ret_sk_list = sk_list;
1997-12-31 13:32:54 +01:00
return rc;
}