1997-12-31 13:32:54 +01:00
|
|
|
/* pkclist.c
|
2002-06-29 15:46:34 +02:00
|
|
|
* Copyright (C) 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
|
1997-12-31 13:32:54 +01:00
|
|
|
*
|
1998-12-23 13:41:40 +01:00
|
|
|
* This file is part of GnuPG.
|
1997-12-31 13:32:54 +01:00
|
|
|
*
|
1998-12-23 13:41:40 +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.
|
|
|
|
*
|
1998-12-23 13:41:40 +01:00
|
|
|
* 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"
|
2002-06-29 15:46:34 +02:00
|
|
|
#include "main.h"
|
1998-01-12 11:18:17 +01:00
|
|
|
#include "trustdb.h"
|
1998-01-19 19:54:44 +01:00
|
|
|
#include "ttyio.h"
|
1998-07-09 15:37:17 +02:00
|
|
|
#include "status.h"
|
1998-01-26 23:09:01 +01:00
|
|
|
#include "i18n.h"
|
1998-01-19 19:54:44 +01:00
|
|
|
|
1998-09-11 07:47:32 +02:00
|
|
|
|
|
|
|
#define CONTROL_D ('D' - 'A' + 1)
|
|
|
|
|
1999-07-23 14:03:01 +02:00
|
|
|
|
2000-07-14 19:34:53 +02:00
|
|
|
/****************
|
|
|
|
* Show the revocation reason as it is stored with the given signature
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
do_show_revocation_reason( PKT_signature *sig )
|
|
|
|
{
|
|
|
|
size_t n, nn;
|
|
|
|
const byte *p, *pp;
|
|
|
|
int seq = 0;
|
|
|
|
const char *text;
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
while( (p = enum_sig_subpkt (sig->hashed, SIGSUBPKT_REVOC_REASON,
|
|
|
|
&n, &seq, NULL )) ) {
|
2000-07-14 19:34:53 +02:00
|
|
|
if( !n )
|
|
|
|
continue; /* invalid - just skip it */
|
|
|
|
|
|
|
|
if( *p == 0 )
|
|
|
|
text = _("No reason specified");
|
|
|
|
else if( *p == 0x01 )
|
2002-06-29 15:46:34 +02:00
|
|
|
text = _("Key is superseded");
|
2000-07-14 19:34:53 +02:00
|
|
|
else if( *p == 0x02 )
|
|
|
|
text = _("Key has been compromised");
|
|
|
|
else if( *p == 0x03 )
|
|
|
|
text = _("Key is no longer used");
|
|
|
|
else if( *p == 0x20 )
|
|
|
|
text = _("User ID is no longer valid");
|
|
|
|
else
|
|
|
|
text = NULL;
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
log_info( _("reason for revocation: ") );
|
2000-07-14 19:34:53 +02:00
|
|
|
if( text )
|
|
|
|
fputs( text, log_stream() );
|
|
|
|
else
|
|
|
|
fprintf( log_stream(), "code=%02x", *p );
|
|
|
|
putc( '\n', log_stream() );
|
|
|
|
n--; p++;
|
|
|
|
pp = NULL;
|
|
|
|
do {
|
|
|
|
/* We don't want any empty lines, so skip them */
|
|
|
|
while( n && *p == '\n' ) {
|
|
|
|
p++;
|
|
|
|
n--;
|
|
|
|
}
|
|
|
|
if( n ) {
|
|
|
|
pp = memchr( p, '\n', n );
|
|
|
|
nn = pp? pp - p : n;
|
2002-06-29 15:46:34 +02:00
|
|
|
log_info( _("revocation comment: ") );
|
2000-07-14 19:34:53 +02:00
|
|
|
print_string( log_stream(), p, nn, 0 );
|
|
|
|
putc( '\n', log_stream() );
|
|
|
|
p += nn; n -= nn;
|
|
|
|
}
|
|
|
|
} while( pp );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
/* Mode 0: try and find the revocation based on the pk (i.e. check
|
|
|
|
subkeys, etc.) Mode 1: use only the revocation on the main pk */
|
2000-07-14 19:34:53 +02:00
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
void
|
|
|
|
show_revocation_reason( PKT_public_key *pk, int mode )
|
2000-07-14 19:34:53 +02:00
|
|
|
{
|
|
|
|
/* Hmmm, this is not so easy becuase we have to duplicate the code
|
|
|
|
* used in the trustbd to calculate the keyflags. We need to find
|
2002-06-29 15:46:34 +02:00
|
|
|
* a clean way to check revocation certificates on keys and
|
|
|
|
* signatures. And there should be no duplicate code. Because we
|
|
|
|
* enter this function only when the trustdb told us that we have
|
|
|
|
* a revoked key, we could simply look for a revocation cert and
|
|
|
|
* display this one, when there is only one. Let's try to do this
|
|
|
|
* until we have a better solution. */
|
2000-07-14 19:34:53 +02:00
|
|
|
KBNODE node, keyblock = NULL;
|
|
|
|
byte fingerprint[MAX_FINGERPRINT_LEN];
|
|
|
|
size_t fingerlen;
|
|
|
|
int rc;
|
|
|
|
|
|
|
|
/* get the keyblock */
|
|
|
|
fingerprint_from_pk( pk, fingerprint, &fingerlen );
|
|
|
|
rc = get_keyblock_byfprint( &keyblock, fingerprint, fingerlen );
|
|
|
|
if( rc ) { /* that should never happen */
|
|
|
|
log_debug( "failed to get the keyblock\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( node=keyblock; node; node = node->next ) {
|
2002-06-29 15:46:34 +02:00
|
|
|
if( (mode && node->pkt->pkttype == PKT_PUBLIC_KEY) ||
|
|
|
|
( ( node->pkt->pkttype == PKT_PUBLIC_KEY
|
2000-07-14 19:34:53 +02:00
|
|
|
|| node->pkt->pkttype == PKT_PUBLIC_SUBKEY )
|
2002-06-29 15:46:34 +02:00
|
|
|
&& !cmp_public_keys( node->pkt->pkt.public_key, pk ) ) )
|
2000-07-14 19:34:53 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if( !node ) {
|
|
|
|
log_debug("Oops, PK not in keyblock\n");
|
|
|
|
release_kbnode( keyblock );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* now find the revocation certificate */
|
|
|
|
for( node = node->next; node ; node = node->next ) {
|
|
|
|
if( node->pkt->pkttype == PKT_PUBLIC_SUBKEY )
|
|
|
|
break;
|
|
|
|
if( node->pkt->pkttype == PKT_SIGNATURE
|
|
|
|
&& (node->pkt->pkt.signature->sig_class == 0x20
|
|
|
|
|| node->pkt->pkt.signature->sig_class == 0x28 ) ) {
|
|
|
|
/* FIXME: we should check the signature here */
|
|
|
|
do_show_revocation_reason ( node->pkt->pkt.signature );
|
2002-06-29 15:46:34 +02:00
|
|
|
break;
|
2000-07-14 19:34:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
/* We didn't find it, so check if the whole key is revoked */
|
|
|
|
if(!node && !mode)
|
|
|
|
show_revocation_reason(pk,1);
|
|
|
|
|
2000-07-14 19:34:53 +02:00
|
|
|
release_kbnode( keyblock );
|
|
|
|
}
|
|
|
|
|
1998-09-11 07:47:32 +02:00
|
|
|
|
1998-11-13 20:41:41 +01:00
|
|
|
static void
|
2002-06-29 15:46:34 +02:00
|
|
|
show_paths (const PKT_public_key *pk, int only_first )
|
1998-11-13 20:41:41 +01:00
|
|
|
{
|
2002-06-29 15:46:34 +02:00
|
|
|
log_debug("not yet implemented\n");
|
|
|
|
#if 0
|
1998-11-13 20:41:41 +01:00
|
|
|
void *context = NULL;
|
|
|
|
unsigned otrust, validity;
|
1998-11-18 20:59:06 +01:00
|
|
|
int last_level, level;
|
1998-11-13 20:41:41 +01:00
|
|
|
|
1998-11-18 20:59:06 +01:00
|
|
|
last_level = 0;
|
1998-11-13 20:41:41 +01:00
|
|
|
while( (level=enum_cert_paths( &context, &lid, &otrust, &validity)) != -1){
|
|
|
|
char *p;
|
1999-03-08 20:50:18 +01:00
|
|
|
int c, rc;
|
1998-11-13 20:41:41 +01:00
|
|
|
size_t n;
|
|
|
|
u32 keyid[2];
|
|
|
|
PKT_public_key *pk ;
|
|
|
|
|
1998-11-18 20:59:06 +01:00
|
|
|
if( level < last_level && only_first )
|
|
|
|
break;
|
|
|
|
last_level = level;
|
|
|
|
|
1998-11-13 20:41:41 +01:00
|
|
|
rc = keyid_from_lid( lid, keyid );
|
2002-06-29 15:46:34 +02:00
|
|
|
|
1998-11-13 20:41:41 +01:00
|
|
|
if( rc ) {
|
|
|
|
log_error("ooops: can't get keyid for lid %lu\n", lid);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
pk = m_alloc_clear( sizeof *pk );
|
1998-11-13 20:41:41 +01:00
|
|
|
rc = get_pubkey( pk, keyid );
|
|
|
|
if( rc ) {
|
|
|
|
log_error("key %08lX: public key not found: %s\n",
|
2002-06-29 15:46:34 +02:00
|
|
|
(ulong)keyid[1], g10_errstr(rc) );
|
1998-11-13 20:41:41 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
tty_printf("%*s%4u%c/%08lX.%lu %s \"",
|
1998-11-18 20:59:06 +01:00
|
|
|
level*2, "",
|
1998-11-13 20:41:41 +01:00
|
|
|
nbits_from_pk( pk ), pubkey_letter( pk->pubkey_algo ),
|
|
|
|
(ulong)keyid[1], lid, datestr_from_pk( pk ) );
|
1999-03-08 20:50:18 +01:00
|
|
|
|
1998-12-17 18:36:05 +01:00
|
|
|
c = trust_letter(otrust);
|
|
|
|
if( c )
|
|
|
|
putchar( c );
|
|
|
|
else
|
|
|
|
printf( "%02x", otrust );
|
|
|
|
putchar('/');
|
|
|
|
c = trust_letter(validity);
|
|
|
|
if( c )
|
|
|
|
putchar( c );
|
|
|
|
else
|
|
|
|
printf( "%02x", validity );
|
|
|
|
putchar(' ');
|
|
|
|
|
1998-11-13 20:41:41 +01:00
|
|
|
p = get_user_id( keyid, &n );
|
1999-10-26 14:14:37 +02:00
|
|
|
tty_print_utf8_string( p, n ),
|
2002-06-29 15:46:34 +02:00
|
|
|
m_free(p);
|
1998-11-18 20:59:06 +01:00
|
|
|
tty_printf("\"\n");
|
|
|
|
free_public_key( pk );
|
1998-11-13 20:41:41 +01:00
|
|
|
}
|
|
|
|
enum_cert_paths( &context, NULL, NULL, NULL ); /* release context */
|
2002-06-29 15:46:34 +02:00
|
|
|
#endif
|
1998-11-18 20:59:06 +01:00
|
|
|
tty_printf("\n");
|
1998-11-13 20:41:41 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1998-01-24 17:32:27 +01:00
|
|
|
/****************
|
2002-06-29 15:46:34 +02:00
|
|
|
* mode: 0 = standard
|
|
|
|
* 1 = Without key info and additional menu option 'm'
|
|
|
|
* this does also add an option to set the key to ultimately trusted.
|
|
|
|
* Returns:
|
|
|
|
* -2 = nothing changed - caller should show some additional info
|
|
|
|
* -1 = quit operation
|
|
|
|
* 0 = nothing changed
|
|
|
|
* 1 = new ownertrust now in new_trust
|
1998-01-24 17:32:27 +01:00
|
|
|
*/
|
1999-03-17 13:13:04 +01:00
|
|
|
static int
|
2002-06-29 15:46:34 +02:00
|
|
|
do_edit_ownertrust (PKT_public_key *pk, int mode,
|
|
|
|
unsigned *new_trust, int defer_help )
|
1998-01-19 19:54:44 +01:00
|
|
|
{
|
2002-06-29 15:46:34 +02:00
|
|
|
char *p;
|
|
|
|
size_t n;
|
|
|
|
u32 keyid[2];
|
|
|
|
int changed=0;
|
|
|
|
int quit=0;
|
|
|
|
int show=0;
|
|
|
|
int did_help=defer_help;
|
|
|
|
|
|
|
|
keyid_from_pk (pk, keyid);
|
|
|
|
for(;;) {
|
|
|
|
/* a string with valid answers */
|
|
|
|
const char *ans = _("iImMqQsS");
|
|
|
|
|
|
|
|
if( !did_help )
|
|
|
|
{
|
|
|
|
if( !mode )
|
|
|
|
{
|
|
|
|
tty_printf(_("No trust value assigned to:\n"
|
|
|
|
"%4u%c/%08lX %s \""),
|
|
|
|
nbits_from_pk( pk ), pubkey_letter( pk->pubkey_algo ),
|
|
|
|
(ulong)keyid[1], datestr_from_pk( pk ) );
|
|
|
|
p = get_user_id( keyid, &n );
|
|
|
|
tty_print_utf8_string( p, n ),
|
|
|
|
m_free(p);
|
|
|
|
tty_printf("\"\n");
|
|
|
|
print_fingerprint (pk, NULL, 2);
|
|
|
|
tty_printf("\n");
|
|
|
|
}
|
|
|
|
tty_printf (_(
|
|
|
|
"Please decide how far you trust this user to correctly\n"
|
|
|
|
"verify other users' keys (by looking at passports,\n"
|
|
|
|
"checking fingerprints from different sources...)?\n\n"));
|
|
|
|
tty_printf (_(" %d = Don't know\n"), 1);
|
|
|
|
tty_printf (_(" %d = I do NOT trust\n"), 2);
|
|
|
|
tty_printf (_(" %d = I trust marginally\n"), 3);
|
|
|
|
tty_printf (_(" %d = I trust fully\n"), 4);
|
|
|
|
if (mode)
|
|
|
|
tty_printf (_(" %d = I trust ultimately\n"), 5);
|
2002-08-20 14:45:57 +02:00
|
|
|
#if 0
|
|
|
|
/* not yet implemented */
|
2002-06-29 15:46:34 +02:00
|
|
|
tty_printf (_(" i = please show me more information\n") );
|
2002-08-20 14:45:57 +02:00
|
|
|
#endif
|
2002-06-29 15:46:34 +02:00
|
|
|
if( mode )
|
|
|
|
tty_printf(_(" m = back to the main menu\n"));
|
|
|
|
else
|
|
|
|
{
|
|
|
|
tty_printf(_(" s = skip this key\n"));
|
|
|
|
tty_printf(_(" q = quit\n"));
|
|
|
|
}
|
|
|
|
tty_printf("\n");
|
|
|
|
did_help = 1;
|
|
|
|
}
|
|
|
|
if( strlen(ans) != 8 )
|
|
|
|
BUG();
|
|
|
|
p = cpr_get("edit_ownertrust.value",_("Your decision? "));
|
|
|
|
trim_spaces(p);
|
|
|
|
cpr_kill_prompt();
|
|
|
|
if( !*p )
|
|
|
|
did_help = 0;
|
|
|
|
else if( *p && p[1] )
|
|
|
|
;
|
|
|
|
else if( !p[1] && (*p >= '1' && *p <= (mode?'5':'4')) )
|
|
|
|
{
|
|
|
|
unsigned int trust;
|
|
|
|
switch( *p )
|
|
|
|
{
|
|
|
|
case '1': trust = TRUST_UNDEFINED; break;
|
|
|
|
case '2': trust = TRUST_NEVER ; break;
|
|
|
|
case '3': trust = TRUST_MARGINAL ; break;
|
|
|
|
case '4': trust = TRUST_FULLY ; break;
|
|
|
|
case '5': trust = TRUST_ULTIMATE ; break;
|
|
|
|
default: BUG();
|
|
|
|
}
|
|
|
|
if (trust == TRUST_ULTIMATE
|
|
|
|
&& !cpr_get_answer_is_yes ("edit_ownertrust.set_ultimate.okay",
|
|
|
|
_("Do you really want to set this key"
|
|
|
|
" to ultimate trust? ")))
|
|
|
|
; /* no */
|
|
|
|
else
|
|
|
|
{
|
|
|
|
*new_trust = trust;
|
|
|
|
changed = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2002-08-20 14:45:57 +02:00
|
|
|
#if 0
|
|
|
|
/* not yet implemented */
|
2002-06-29 15:46:34 +02:00
|
|
|
else if( *p == ans[0] || *p == ans[1] )
|
|
|
|
{
|
|
|
|
tty_printf(_("Certificates leading to an ultimately trusted key:\n"));
|
|
|
|
show = 1;
|
|
|
|
break;
|
|
|
|
}
|
2002-08-20 14:45:57 +02:00
|
|
|
#endif
|
2002-06-29 15:46:34 +02:00
|
|
|
else if( mode && (*p == ans[2] || *p == ans[3] || *p == CONTROL_D ) )
|
|
|
|
{
|
|
|
|
break ; /* back to the menu */
|
|
|
|
}
|
|
|
|
else if( !mode && (*p == ans[6] || *p == ans[7] ) )
|
|
|
|
{
|
|
|
|
break; /* skip */
|
|
|
|
}
|
|
|
|
else if( !mode && (*p == ans[4] || *p == ans[5] ) )
|
|
|
|
{
|
|
|
|
quit = 1;
|
|
|
|
break ; /* back to the menu */
|
|
|
|
}
|
|
|
|
m_free(p); p = NULL;
|
|
|
|
}
|
|
|
|
m_free(p);
|
|
|
|
return show? -2: quit? -1 : changed;
|
1998-01-19 19:54:44 +01:00
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
/*
|
|
|
|
* Display a menu to change the ownertrust of the key PK (which should
|
|
|
|
* be a primary key).
|
|
|
|
* For mode values see do_edit_ownertrust ()
|
|
|
|
*/
|
1999-03-17 13:13:04 +01:00
|
|
|
int
|
2002-06-29 15:46:34 +02:00
|
|
|
edit_ownertrust (PKT_public_key *pk, int mode )
|
1999-03-17 13:13:04 +01:00
|
|
|
{
|
2002-06-29 15:46:34 +02:00
|
|
|
unsigned int trust;
|
|
|
|
int no_help = 0;
|
|
|
|
|
|
|
|
for(;;)
|
|
|
|
{
|
|
|
|
switch ( do_edit_ownertrust (pk, mode, &trust, no_help ) )
|
|
|
|
{
|
|
|
|
case -1: /* quit */
|
|
|
|
return -1;
|
|
|
|
case -2: /* show info */
|
|
|
|
show_paths(pk, 1);
|
|
|
|
no_help = 1;
|
|
|
|
break;
|
|
|
|
case 1: /* trust value set */
|
|
|
|
trust &= ~TRUST_FLAG_DISABLED;
|
|
|
|
trust |= get_ownertrust (pk) & TRUST_FLAG_DISABLED;
|
|
|
|
update_ownertrust (pk, trust );
|
|
|
|
return 1;
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
}
|
1999-03-17 13:13:04 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1998-01-24 17:32:27 +01:00
|
|
|
|
1998-01-12 11:18:17 +01:00
|
|
|
/****************
|
1998-06-29 14:30:57 +02:00
|
|
|
* Check whether we can trust this pk which has a trustlevel of TRUSTLEVEL
|
2002-06-29 15:46:34 +02:00
|
|
|
* Returns: true if we trust.
|
1998-01-12 11:18:17 +01:00
|
|
|
*/
|
|
|
|
static int
|
2002-06-29 15:46:34 +02:00
|
|
|
do_we_trust( PKT_public_key *pk, unsigned int *trustlevel )
|
1998-01-12 11:18:17 +01:00
|
|
|
{
|
2002-06-29 15:46:34 +02:00
|
|
|
unsigned int trustmask = 0;
|
|
|
|
|
|
|
|
/* FIXME: get_pubkey_byname already checks the validity and won't
|
|
|
|
* return keys which are either expired or revoked - so these
|
|
|
|
* question here won't get triggered. We have to find a solution
|
|
|
|
* for this. It might make sense to have a function in getkey.c
|
|
|
|
* which does only the basic checks and returns even revoked and
|
|
|
|
* expired keys. This fnction could then also returhn a list of
|
|
|
|
* keys if the speicified name is ambiguous
|
|
|
|
*/
|
2000-07-14 19:34:53 +02:00
|
|
|
if( (*trustlevel & TRUST_FLAG_REVOKED) ) {
|
1998-11-10 13:59:59 +01:00
|
|
|
log_info(_("key %08lX: key has been revoked!\n"),
|
1998-09-28 21:25:31 +02:00
|
|
|
(ulong)keyid_from_pk( pk, NULL) );
|
2002-06-29 15:46:34 +02:00
|
|
|
show_revocation_reason( pk, 0 );
|
1998-02-18 14:58:46 +01:00
|
|
|
if( opt.batch )
|
2002-06-29 15:46:34 +02:00
|
|
|
return 0; /* no */
|
1998-02-18 14:58:46 +01:00
|
|
|
|
1998-11-27 12:42:49 +01:00
|
|
|
if( !cpr_get_answer_is_yes("revoked_key.override",
|
1998-08-08 21:27:00 +02:00
|
|
|
_("Use this key anyway? ")) )
|
2002-06-29 15:46:34 +02:00
|
|
|
return 0; /* no */
|
2000-07-14 19:34:53 +02:00
|
|
|
trustmask |= TRUST_FLAG_REVOKED;
|
1998-02-18 14:58:46 +01:00
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
if( (*trustlevel & TRUST_FLAG_SUB_REVOKED) ) {
|
1999-05-06 14:26:10 +02:00
|
|
|
log_info(_("key %08lX: subkey has been revoked!\n"),
|
|
|
|
(ulong)keyid_from_pk( pk, NULL) );
|
2002-06-29 15:46:34 +02:00
|
|
|
show_revocation_reason( pk, 0 );
|
1999-05-06 14:26:10 +02:00
|
|
|
if( opt.batch )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if( !cpr_get_answer_is_yes("revoked_key.override",
|
|
|
|
_("Use this key anyway? ")) )
|
|
|
|
return 0;
|
2000-07-14 19:34:53 +02:00
|
|
|
trustmask |= TRUST_FLAG_SUB_REVOKED;
|
|
|
|
}
|
|
|
|
*trustlevel &= ~trustmask;
|
|
|
|
|
|
|
|
if( opt.always_trust) {
|
|
|
|
if( opt.verbose )
|
|
|
|
log_info("No trust check due to --always-trust option\n");
|
|
|
|
return 1;
|
1999-05-06 14:26:10 +02:00
|
|
|
}
|
1998-02-18 14:58:46 +01:00
|
|
|
|
2000-07-14 19:34:53 +02:00
|
|
|
switch( (*trustlevel & TRUST_MASK) ) {
|
1998-01-19 19:54:44 +01:00
|
|
|
case TRUST_EXPIRED:
|
1998-11-10 13:59:59 +01:00
|
|
|
log_info(_("%08lX: key has expired\n"),
|
|
|
|
(ulong)keyid_from_pk( pk, NULL) );
|
1998-01-19 19:54:44 +01:00
|
|
|
return 0; /* no */
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
default:
|
|
|
|
log_error ("invalid trustlevel %u returned from validation layer\n",
|
|
|
|
*trustlevel);
|
|
|
|
/* fall thru */
|
|
|
|
case TRUST_UNKNOWN:
|
1998-01-19 19:54:44 +01:00
|
|
|
case TRUST_UNDEFINED:
|
2002-06-29 15:46:34 +02:00
|
|
|
log_info(_("%08lX: There is no indication that this key "
|
|
|
|
"really belongs to the owner\n"),
|
|
|
|
(ulong)keyid_from_pk( pk, NULL) );
|
|
|
|
return 0; /* no */
|
1998-01-19 19:54:44 +01:00
|
|
|
|
|
|
|
case TRUST_NEVER:
|
1998-11-10 13:59:59 +01:00
|
|
|
log_info(_("%08lX: We do NOT trust this key\n"),
|
1998-09-28 21:25:31 +02:00
|
|
|
(ulong)keyid_from_pk( pk, NULL) );
|
1998-01-19 19:54:44 +01:00
|
|
|
return 0; /* no */
|
|
|
|
|
|
|
|
case TRUST_MARGINAL:
|
1998-11-10 13:59:59 +01:00
|
|
|
log_info(
|
1998-11-25 12:55:58 +01:00
|
|
|
_("%08lX: It is not sure that this key really belongs to the owner\n"
|
1998-11-10 13:59:59 +01:00
|
|
|
"but it is accepted anyway\n"), (ulong)keyid_from_pk( pk, NULL) );
|
1998-01-19 19:54:44 +01:00
|
|
|
return 1; /* yes */
|
|
|
|
|
|
|
|
case TRUST_FULLY:
|
1998-02-12 00:22:09 +01:00
|
|
|
if( opt.verbose )
|
1998-11-10 13:59:59 +01:00
|
|
|
log_info(_("This key probably belongs to the owner\n"));
|
1998-01-19 19:54:44 +01:00
|
|
|
return 1; /* yes */
|
|
|
|
|
|
|
|
case TRUST_ULTIMATE:
|
1998-02-12 00:22:09 +01:00
|
|
|
if( opt.verbose )
|
1998-12-10 20:20:47 +01:00
|
|
|
log_info(_("This key belongs to us\n"));
|
1998-01-19 19:54:44 +01:00
|
|
|
return 1; /* yes */
|
1998-01-13 20:04:23 +01:00
|
|
|
}
|
|
|
|
|
1998-01-12 11:18:17 +01:00
|
|
|
return 1; /* yes */
|
|
|
|
}
|
|
|
|
|
1997-12-31 13:32:54 +01:00
|
|
|
|
1999-07-23 14:03:01 +02:00
|
|
|
|
1998-03-03 09:43:28 +01:00
|
|
|
/****************
|
1998-04-14 19:51:16 +02:00
|
|
|
* wrapper around do_we_trust, so we can ask whether to use the
|
1998-03-03 09:43:28 +01:00
|
|
|
* key anyway.
|
|
|
|
*/
|
|
|
|
static int
|
2002-06-29 15:46:34 +02:00
|
|
|
do_we_trust_pre( PKT_public_key *pk, unsigned int trustlevel )
|
1998-03-03 09:43:28 +01:00
|
|
|
{
|
1999-02-25 18:51:55 +01:00
|
|
|
int rc;
|
|
|
|
|
2000-07-14 19:34:53 +02:00
|
|
|
rc = do_we_trust( pk, &trustlevel );
|
1998-03-03 09:43:28 +01:00
|
|
|
|
1998-12-29 19:58:27 +01:00
|
|
|
if( (trustlevel & TRUST_FLAG_REVOKED) && !rc )
|
|
|
|
return 0;
|
1999-05-06 14:26:10 +02:00
|
|
|
if( (trustlevel & TRUST_FLAG_SUB_REVOKED) && !rc )
|
|
|
|
return 0;
|
2002-06-29 15:46:34 +02:00
|
|
|
|
|
|
|
if( !opt.batch && !rc ) {
|
1999-02-26 17:59:48 +01:00
|
|
|
char *p;
|
|
|
|
u32 keyid[2];
|
|
|
|
size_t n;
|
|
|
|
|
|
|
|
keyid_from_pk( pk, keyid);
|
|
|
|
tty_printf( "%4u%c/%08lX %s \"",
|
|
|
|
nbits_from_pk( pk ), pubkey_letter( pk->pubkey_algo ),
|
|
|
|
(ulong)keyid[1], datestr_from_pk( pk ) );
|
|
|
|
p = get_user_id( keyid, &n );
|
1999-10-26 14:14:37 +02:00
|
|
|
tty_print_utf8_string( p, n ),
|
2002-06-29 15:46:34 +02:00
|
|
|
m_free(p);
|
1999-07-23 14:03:01 +02:00
|
|
|
tty_printf("\"\n");
|
2002-06-29 15:46:34 +02:00
|
|
|
print_fingerprint (pk, NULL, 2);
|
1999-07-23 14:03:01 +02:00
|
|
|
tty_printf("\n");
|
1999-02-26 17:59:48 +01:00
|
|
|
|
1998-03-03 09:43:28 +01:00
|
|
|
tty_printf(_(
|
2002-08-30 18:34:13 +02:00
|
|
|
"It is NOT certain that the key belongs to the person named\n"
|
|
|
|
"in the user ID. If you *really* know what you are doing,\n"
|
|
|
|
"you may answer the next question with yes\n\n"));
|
1998-03-03 09:43:28 +01:00
|
|
|
|
1998-11-27 12:42:49 +01:00
|
|
|
if( cpr_get_answer_is_yes("untrusted_key.override",
|
|
|
|
_("Use this key anyway? ")) )
|
1998-03-03 09:43:28 +01:00
|
|
|
rc = 1;
|
1999-02-26 17:59:48 +01:00
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
/* Hmmm: Should we set a flag to tell the user about
|
1999-02-26 17:59:48 +01:00
|
|
|
* his decision the next time he encrypts for this recipient?
|
|
|
|
*/
|
1998-03-03 09:43:28 +01:00
|
|
|
}
|
1998-05-29 13:53:54 +02:00
|
|
|
else if( opt.always_trust && !rc ) {
|
1999-08-04 10:45:27 +02:00
|
|
|
if( !opt.quiet )
|
|
|
|
log_info(_("WARNING: Using untrusted key!\n"));
|
1998-05-29 13:53:54 +02:00
|
|
|
rc = 1;
|
|
|
|
}
|
1998-03-03 09:43:28 +01:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
1997-12-31 13:32:54 +01:00
|
|
|
|
1998-07-09 15:37:17 +02:00
|
|
|
|
|
|
|
/****************
|
|
|
|
* Check whether we can trust this signature.
|
|
|
|
* Returns: Error if we shall not trust this signatures.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
check_signatures_trust( PKT_signature *sig )
|
|
|
|
{
|
2002-06-29 15:46:34 +02:00
|
|
|
PKT_public_key *pk = m_alloc_clear( sizeof *pk );
|
|
|
|
unsigned int trustlevel;
|
|
|
|
int rc=0;
|
|
|
|
|
|
|
|
if ( opt.always_trust)
|
|
|
|
{
|
|
|
|
if( !opt.quiet )
|
|
|
|
log_info(_("WARNING: Using untrusted key!\n"));
|
|
|
|
if (opt.with_fingerprint)
|
|
|
|
print_fingerprint (pk, NULL, 1);
|
|
|
|
goto leave;
|
1999-05-23 14:29:05 +02:00
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
rc = get_pubkey( pk, sig->keyid );
|
|
|
|
if (rc)
|
|
|
|
{ /* this should not happen */
|
|
|
|
log_error("Ooops; the key vanished - can't check the trust\n");
|
|
|
|
rc = G10ERR_NO_PUBKEY;
|
|
|
|
goto leave;
|
1998-07-09 15:37:17 +02:00
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
trustlevel = get_validity (pk, NULL);
|
1998-07-09 15:37:17 +02:00
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
if ( (trustlevel & TRUST_FLAG_REVOKED) )
|
|
|
|
{
|
|
|
|
write_status( STATUS_KEYREVOKED );
|
|
|
|
log_info(_("WARNING: This key has been revoked by its owner!\n"));
|
|
|
|
log_info(_(" This could mean that the signature is forgery.\n"));
|
|
|
|
show_revocation_reason( pk, 0 );
|
1998-07-09 15:37:17 +02:00
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
else if ((trustlevel & TRUST_FLAG_SUB_REVOKED) )
|
|
|
|
{
|
|
|
|
write_status( STATUS_KEYREVOKED );
|
|
|
|
log_info(_("WARNING: This subkey has been revoked by its owner!\n"));
|
|
|
|
show_revocation_reason( pk, 0 );
|
1999-05-06 14:26:10 +02:00
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
|
|
|
|
if ((trustlevel & TRUST_FLAG_DISABLED))
|
|
|
|
log_info (_("Note: This key has been disabled.\n"));
|
|
|
|
|
|
|
|
switch ( (trustlevel & TRUST_MASK) )
|
|
|
|
{
|
|
|
|
case TRUST_EXPIRED:
|
|
|
|
log_info(_("Note: This key has expired!\n"));
|
|
|
|
print_fingerprint (pk, NULL, 1);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
log_error ("invalid trustlevel %u returned from validation layer\n",
|
|
|
|
trustlevel);
|
|
|
|
/* fall thru */
|
|
|
|
case TRUST_UNKNOWN:
|
|
|
|
case TRUST_UNDEFINED:
|
|
|
|
write_status( STATUS_TRUST_UNDEFINED );
|
|
|
|
log_info(_("WARNING: This key is not certified with"
|
|
|
|
" a trusted signature!\n"));
|
|
|
|
log_info(_(" There is no indication that the "
|
|
|
|
"signature belongs to the owner.\n" ));
|
|
|
|
print_fingerprint (pk, NULL, 1);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TRUST_NEVER:
|
|
|
|
/* currently we won't get that status */
|
|
|
|
write_status( STATUS_TRUST_NEVER );
|
|
|
|
log_info(_("WARNING: We do NOT trust this key!\n"));
|
|
|
|
log_info(_(" The signature is probably a FORGERY.\n"));
|
|
|
|
if (opt.with_fingerprint)
|
|
|
|
print_fingerprint (pk, NULL, 1);
|
|
|
|
rc = G10ERR_BAD_SIGN;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TRUST_MARGINAL:
|
|
|
|
write_status( STATUS_TRUST_MARGINAL );
|
|
|
|
log_info(_("WARNING: This key is not certified with"
|
|
|
|
" sufficiently trusted signatures!\n"));
|
|
|
|
log_info(_(" It is not certain that the"
|
|
|
|
" signature belongs to the owner.\n" ));
|
|
|
|
print_fingerprint (pk, NULL, 1);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TRUST_FULLY:
|
|
|
|
write_status( STATUS_TRUST_FULLY );
|
|
|
|
if (opt.with_fingerprint)
|
|
|
|
print_fingerprint (pk, NULL, 1);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TRUST_ULTIMATE:
|
|
|
|
write_status( STATUS_TRUST_ULTIMATE );
|
|
|
|
if (opt.with_fingerprint)
|
|
|
|
print_fingerprint (pk, NULL, 1);
|
|
|
|
break;
|
1998-07-09 15:37:17 +02:00
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
leave:
|
|
|
|
free_public_key( pk );
|
|
|
|
return rc;
|
1998-07-09 15:37:17 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1997-12-31 13:32:54 +01:00
|
|
|
void
|
1998-06-29 14:30:57 +02:00
|
|
|
release_pk_list( PK_LIST pk_list )
|
1997-12-31 13:32:54 +01:00
|
|
|
{
|
1998-06-29 14:30:57 +02:00
|
|
|
PK_LIST pk_rover;
|
1997-12-31 13:32:54 +01:00
|
|
|
|
1998-06-29 14:30:57 +02:00
|
|
|
for( ; pk_list; pk_list = pk_rover ) {
|
|
|
|
pk_rover = pk_list->next;
|
|
|
|
free_public_key( pk_list->pk );
|
2002-06-29 15:46:34 +02:00
|
|
|
m_free( pk_list );
|
1997-12-31 13:32:54 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-06-05 15:36:15 +02:00
|
|
|
|
|
|
|
static int
|
|
|
|
key_present_in_pk_list(PK_LIST pk_list, PKT_public_key *pk)
|
|
|
|
{
|
|
|
|
for( ; pk_list; pk_list = pk_list->next)
|
|
|
|
if (cmp_public_keys(pk_list->pk, pk) == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
1999-07-13 17:41:14 +02:00
|
|
|
|
|
|
|
/****************
|
|
|
|
* Return a malloced string with a default reciepient if there is any
|
|
|
|
*/
|
|
|
|
static char *
|
|
|
|
default_recipient(void)
|
|
|
|
{
|
|
|
|
PKT_secret_key *sk;
|
|
|
|
byte fpr[MAX_FINGERPRINT_LEN+1];
|
|
|
|
size_t n;
|
|
|
|
char *p;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if( opt.def_recipient )
|
2002-06-29 15:46:34 +02:00
|
|
|
return m_strdup( opt.def_recipient );
|
1999-07-13 17:41:14 +02:00
|
|
|
if( !opt.def_recipient_self )
|
|
|
|
return NULL;
|
2002-06-29 15:46:34 +02:00
|
|
|
sk = m_alloc_clear( sizeof *sk );
|
|
|
|
i = get_seckey_byname( sk, NULL, 0 );
|
1999-07-13 17:41:14 +02:00
|
|
|
if( i ) {
|
|
|
|
free_secret_key( sk );
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
n = MAX_FINGERPRINT_LEN;
|
|
|
|
fingerprint_from_sk( sk, fpr, &n );
|
|
|
|
free_secret_key( sk );
|
2002-06-29 15:46:34 +02:00
|
|
|
p = m_alloc( 2*n+3 );
|
1999-07-13 17:41:14 +02:00
|
|
|
*p++ = '0';
|
|
|
|
*p++ = 'x';
|
|
|
|
for(i=0; i < n; i++ )
|
|
|
|
sprintf( p+2*i, "%02X", fpr[i] );
|
|
|
|
p -= 2;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
static int
|
|
|
|
expand_id(const char *id,STRLIST *into,unsigned int flags)
|
|
|
|
{
|
|
|
|
struct groupitem *groups;
|
|
|
|
int count=0;
|
|
|
|
|
|
|
|
for(groups=opt.grouplist;groups;groups=groups->next)
|
|
|
|
{
|
|
|
|
/* need strcasecmp() here, as this should be localized */
|
|
|
|
if(strcasecmp(groups->name,id)==0)
|
|
|
|
{
|
|
|
|
STRLIST each,sl;
|
|
|
|
|
|
|
|
/* this maintains the current utf8-ness */
|
|
|
|
for(each=groups->values;each;each=each->next)
|
|
|
|
{
|
|
|
|
sl=add_to_strlist(into,each->d);
|
|
|
|
sl->flags=flags;
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* For simplicity, and to avoid potential loops, we only expand once -
|
|
|
|
you can't make an alias that points to an alias. */
|
|
|
|
static STRLIST
|
|
|
|
expand_group(STRLIST input)
|
|
|
|
{
|
|
|
|
STRLIST sl,output=NULL,rover;
|
|
|
|
|
|
|
|
for(rover=input;rover;rover=rover->next)
|
|
|
|
if(expand_id(rover->d,&output,rover->flags)==0)
|
|
|
|
{
|
|
|
|
/* Didn't find any groups, so use the existing string */
|
|
|
|
sl=add_to_strlist(&output,rover->d);
|
|
|
|
sl->flags=rover->flags;
|
|
|
|
}
|
|
|
|
|
|
|
|
return output;
|
|
|
|
}
|
1999-07-13 17:41:14 +02:00
|
|
|
|
1997-12-31 13:32:54 +01:00
|
|
|
int
|
2002-06-29 15:46:34 +02:00
|
|
|
build_pk_list( STRLIST rcpts, PK_LIST *ret_pk_list, unsigned use )
|
1997-12-31 13:32:54 +01:00
|
|
|
{
|
1998-06-29 14:30:57 +02:00
|
|
|
PK_LIST pk_list = NULL;
|
|
|
|
PKT_public_key *pk=NULL;
|
1998-03-03 09:43:28 +01:00
|
|
|
int rc=0;
|
1999-02-16 14:16:33 +01:00
|
|
|
int any_recipients=0;
|
2002-06-29 15:46:34 +02:00
|
|
|
STRLIST rov,remusr;
|
1999-07-13 17:41:14 +02:00
|
|
|
char *def_rec = NULL;
|
1999-02-16 14:16:33 +01:00
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
if(opt.grouplist)
|
|
|
|
remusr=expand_group(rcpts);
|
|
|
|
else
|
|
|
|
remusr=rcpts;
|
|
|
|
|
1999-02-16 14:16:33 +01:00
|
|
|
/* check whether there are any recipients in the list and build the
|
|
|
|
* list of the encrypt-to ones (we always trust them) */
|
|
|
|
for( rov = remusr; rov; rov = rov->next ) {
|
|
|
|
if( !(rov->flags & 1) )
|
|
|
|
any_recipients = 1;
|
2002-06-29 15:46:34 +02:00
|
|
|
else if( (use & PUBKEY_USAGE_ENC) && !opt.no_encrypt_to ) {
|
|
|
|
pk = m_alloc_clear( sizeof *pk );
|
2000-09-18 16:35:34 +02:00
|
|
|
pk->req_usage = use;
|
2002-06-29 15:46:34 +02:00
|
|
|
if( (rc = get_pubkey_byname( pk, rov->d, NULL, NULL )) ) {
|
1999-02-16 14:16:33 +01:00
|
|
|
free_public_key( pk ); pk = NULL;
|
2002-06-29 15:46:34 +02:00
|
|
|
log_error(_("%s: skipped: %s\n"), rov->d, g10_errstr(rc) );
|
|
|
|
write_status_text_and_buffer (STATUS_INV_RECP, "0 ",
|
|
|
|
rov->d, strlen (rov->d), -1);
|
2002-08-30 20:01:32 +02:00
|
|
|
goto fail;
|
2002-06-29 15:46:34 +02:00
|
|
|
}
|
|
|
|
else if( !(rc=check_pubkey_algo2(pk->pubkey_algo, use )) ) {
|
1999-06-05 15:36:15 +02:00
|
|
|
/* Skip the actual key if the key is already present
|
|
|
|
* in the list */
|
|
|
|
if (key_present_in_pk_list(pk_list, pk) == 0) {
|
|
|
|
free_public_key(pk); pk = NULL;
|
|
|
|
log_info(_("%s: skipped: public key already present\n"),
|
|
|
|
rov->d);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
PK_LIST r;
|
2002-06-29 15:46:34 +02:00
|
|
|
r = m_alloc( sizeof *r );
|
1999-06-05 15:36:15 +02:00
|
|
|
r->pk = pk; pk = NULL;
|
|
|
|
r->next = pk_list;
|
|
|
|
r->mark = 0;
|
|
|
|
pk_list = r;
|
|
|
|
}
|
1999-02-16 14:16:33 +01:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
free_public_key( pk ); pk = NULL;
|
2002-06-29 15:46:34 +02:00
|
|
|
log_error(_("%s: skipped: %s\n"), rov->d, g10_errstr(rc) );
|
|
|
|
write_status_text_and_buffer (STATUS_INV_RECP, "0 ",
|
|
|
|
rov->d, strlen (rov->d), -1);
|
2002-08-30 20:01:32 +02:00
|
|
|
goto fail;
|
1999-02-16 14:16:33 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
1998-03-03 09:43:28 +01:00
|
|
|
|
1999-02-16 14:16:33 +01:00
|
|
|
if( !any_recipients && !opt.batch ) { /* ask */
|
1999-07-13 17:41:14 +02:00
|
|
|
int have_def_rec;
|
2002-06-29 15:46:34 +02:00
|
|
|
char *answer=NULL;
|
|
|
|
STRLIST backlog=NULL;
|
1998-03-03 09:43:28 +01:00
|
|
|
|
1999-07-13 17:41:14 +02:00
|
|
|
def_rec = default_recipient();
|
|
|
|
have_def_rec = !!def_rec;
|
|
|
|
if( !have_def_rec )
|
|
|
|
tty_printf(_(
|
2002-06-29 15:46:34 +02:00
|
|
|
"You did not specify a user ID. (you may use \"-r\")\n"));
|
1998-03-03 09:43:28 +01:00
|
|
|
for(;;) {
|
|
|
|
rc = 0;
|
2002-06-29 15:46:34 +02:00
|
|
|
m_free(answer);
|
1999-07-13 17:41:14 +02:00
|
|
|
if( have_def_rec ) {
|
|
|
|
answer = def_rec;
|
|
|
|
def_rec = NULL;
|
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
else if(backlog) {
|
|
|
|
answer=pop_strlist(&backlog);
|
|
|
|
}
|
1999-07-13 17:41:14 +02:00
|
|
|
else {
|
|
|
|
answer = cpr_get_utf8("pklist.user_id.enter",
|
2002-06-29 15:46:34 +02:00
|
|
|
_("\nEnter the user ID. End with an empty line: "));
|
1999-07-13 17:41:14 +02:00
|
|
|
trim_spaces(answer);
|
|
|
|
cpr_kill_prompt();
|
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
if( !answer || !*answer ) {
|
|
|
|
m_free(answer);
|
1998-03-03 09:43:28 +01:00
|
|
|
break;
|
2002-06-29 15:46:34 +02:00
|
|
|
}
|
|
|
|
if(expand_id(answer,&backlog,0))
|
|
|
|
continue;
|
1998-06-29 14:30:57 +02:00
|
|
|
if( pk )
|
|
|
|
free_public_key( pk );
|
2002-06-29 15:46:34 +02:00
|
|
|
pk = m_alloc_clear( sizeof *pk );
|
2000-09-18 16:35:34 +02:00
|
|
|
pk->req_usage = use;
|
2002-06-29 15:46:34 +02:00
|
|
|
rc = get_pubkey_byname( pk, answer, NULL, NULL );
|
1998-03-03 09:43:28 +01:00
|
|
|
if( rc )
|
1998-07-06 12:23:57 +02:00
|
|
|
tty_printf(_("No such user ID.\n"));
|
2002-06-29 15:46:34 +02:00
|
|
|
else if( !(rc=check_pubkey_algo2(pk->pubkey_algo, use)) ) {
|
1999-07-13 17:41:14 +02:00
|
|
|
if( have_def_rec ) {
|
1999-09-03 10:15:32 +02:00
|
|
|
if (key_present_in_pk_list(pk_list, pk) == 0) {
|
|
|
|
free_public_key(pk); pk = NULL;
|
|
|
|
log_info(_("skipped: public key "
|
|
|
|
"already set as default recipient\n") );
|
|
|
|
}
|
|
|
|
else {
|
2002-06-29 15:46:34 +02:00
|
|
|
PK_LIST r = m_alloc( sizeof *r );
|
1999-09-03 10:15:32 +02:00
|
|
|
r->pk = pk; pk = NULL;
|
|
|
|
r->next = pk_list;
|
|
|
|
r->mark = 0;
|
|
|
|
pk_list = r;
|
|
|
|
}
|
1999-02-16 14:16:33 +01:00
|
|
|
any_recipients = 1;
|
2002-06-29 15:46:34 +02:00
|
|
|
continue;
|
1998-03-03 09:43:28 +01:00
|
|
|
}
|
1999-07-13 17:41:14 +02:00
|
|
|
else {
|
|
|
|
int trustlevel;
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
trustlevel = get_validity (pk, NULL);
|
|
|
|
if( (trustlevel & TRUST_FLAG_DISABLED) ) {
|
1999-07-13 17:41:14 +02:00
|
|
|
tty_printf(_("Public key is disabled.\n") );
|
|
|
|
}
|
|
|
|
else if( do_we_trust_pre( pk, trustlevel ) ) {
|
1999-09-03 10:15:32 +02:00
|
|
|
/* Skip the actual key if the key is already present
|
|
|
|
* in the list */
|
|
|
|
if (key_present_in_pk_list(pk_list, pk) == 0) {
|
|
|
|
free_public_key(pk); pk = NULL;
|
2002-06-29 15:46:34 +02:00
|
|
|
log_info(_("skipped: public key already set\n") );
|
1999-09-03 10:15:32 +02:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
PK_LIST r;
|
2002-06-29 15:46:34 +02:00
|
|
|
char *p;
|
|
|
|
size_t n;
|
|
|
|
u32 keyid[2];
|
|
|
|
|
|
|
|
keyid_from_pk( pk, keyid);
|
|
|
|
tty_printf("Added %4u%c/%08lX %s \"",
|
|
|
|
nbits_from_pk( pk ),
|
|
|
|
pubkey_letter( pk->pubkey_algo ),
|
|
|
|
(ulong)keyid[1],
|
|
|
|
datestr_from_pk( pk ) );
|
|
|
|
p = get_user_id( keyid, &n );
|
|
|
|
tty_print_utf8_string( p, n );
|
|
|
|
m_free(p);
|
|
|
|
tty_printf("\"\n");
|
|
|
|
|
|
|
|
r = m_alloc( sizeof *r );
|
1999-09-03 10:15:32 +02:00
|
|
|
r->pk = pk; pk = NULL;
|
|
|
|
r->next = pk_list;
|
|
|
|
r->mark = 0;
|
|
|
|
pk_list = r;
|
|
|
|
}
|
1999-07-13 17:41:14 +02:00
|
|
|
any_recipients = 1;
|
2002-06-29 15:46:34 +02:00
|
|
|
continue;
|
1999-07-13 17:41:14 +02:00
|
|
|
}
|
|
|
|
}
|
1998-03-03 09:43:28 +01:00
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
m_free(def_rec); def_rec = NULL;
|
1999-07-13 17:41:14 +02:00
|
|
|
have_def_rec = 0;
|
1998-03-03 09:43:28 +01:00
|
|
|
}
|
1998-06-29 14:30:57 +02:00
|
|
|
if( pk ) {
|
|
|
|
free_public_key( pk );
|
|
|
|
pk = NULL;
|
1998-03-03 09:43:28 +01:00
|
|
|
}
|
1997-12-31 13:32:54 +01:00
|
|
|
}
|
1999-07-13 17:41:14 +02:00
|
|
|
else if( !any_recipients && (def_rec = default_recipient()) ) {
|
2002-06-29 15:46:34 +02:00
|
|
|
pk = m_alloc_clear( sizeof *pk );
|
2000-09-18 16:35:34 +02:00
|
|
|
pk->req_usage = use;
|
2002-06-29 15:46:34 +02:00
|
|
|
rc = get_pubkey_byname( pk, def_rec, NULL, NULL );
|
1999-07-13 17:41:14 +02:00
|
|
|
if( rc )
|
1999-07-26 09:44:46 +02:00
|
|
|
log_error(_("unknown default recipient `%s'\n"), def_rec );
|
2002-06-29 15:46:34 +02:00
|
|
|
else if( !(rc=check_pubkey_algo2(pk->pubkey_algo, use)) ) {
|
|
|
|
/* Mark any_recipients here since the default recipient
|
|
|
|
would have been used if it wasn't already there. It
|
|
|
|
doesn't really matter if we got this key from the default
|
|
|
|
recipient or an encrypt-to. */
|
|
|
|
any_recipients = 1;
|
|
|
|
if (key_present_in_pk_list(pk_list, pk) == 0)
|
|
|
|
log_info(_("skipped: public key already set as default recipient\n"));
|
|
|
|
else {
|
|
|
|
PK_LIST r = m_alloc( sizeof *r );
|
1999-07-13 17:41:14 +02:00
|
|
|
r->pk = pk; pk = NULL;
|
|
|
|
r->next = pk_list;
|
|
|
|
r->mark = 0;
|
|
|
|
pk_list = r;
|
2002-06-29 15:46:34 +02:00
|
|
|
}
|
1999-07-13 17:41:14 +02:00
|
|
|
}
|
|
|
|
if( pk ) {
|
|
|
|
free_public_key( pk );
|
|
|
|
pk = NULL;
|
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
m_free(def_rec); def_rec = NULL;
|
1999-07-13 17:41:14 +02:00
|
|
|
}
|
1997-12-31 13:32:54 +01:00
|
|
|
else {
|
1999-02-26 17:59:48 +01:00
|
|
|
any_recipients = 0;
|
1997-12-31 13:32:54 +01:00
|
|
|
for(; remusr; remusr = remusr->next ) {
|
1999-02-19 15:54:00 +01:00
|
|
|
if( (remusr->flags & 1) )
|
|
|
|
continue; /* encrypt-to keys are already handled */
|
1997-12-31 13:32:54 +01:00
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
pk = m_alloc_clear( sizeof *pk );
|
2000-09-18 16:35:34 +02:00
|
|
|
pk->req_usage = use;
|
2002-06-29 15:46:34 +02:00
|
|
|
if( (rc = get_pubkey_byname( pk, remusr->d, NULL, NULL )) ) {
|
1998-06-29 14:30:57 +02:00
|
|
|
free_public_key( pk ); pk = NULL;
|
2002-06-29 15:46:34 +02:00
|
|
|
log_error(_("%s: skipped: %s\n"), remusr->d, g10_errstr(rc) );
|
|
|
|
write_status_text_and_buffer (STATUS_INV_RECP, "0 ",
|
|
|
|
remusr->d, strlen (remusr->d),
|
|
|
|
-1);
|
2002-08-30 20:01:32 +02:00
|
|
|
goto fail;
|
1997-12-31 13:32:54 +01:00
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
else if( !(rc=check_pubkey_algo2(pk->pubkey_algo, use )) ) {
|
1998-01-12 11:18:17 +01:00
|
|
|
int trustlevel;
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
trustlevel = get_validity (pk, pk->namehash);
|
|
|
|
if( (trustlevel & TRUST_FLAG_DISABLED) ) {
|
1999-07-01 12:53:35 +02:00
|
|
|
free_public_key(pk); pk = NULL;
|
|
|
|
log_info(_("%s: skipped: public key is disabled\n"),
|
|
|
|
remusr->d);
|
2002-06-29 15:46:34 +02:00
|
|
|
write_status_text_and_buffer (STATUS_INV_RECP, "0 ",
|
|
|
|
remusr->d,
|
|
|
|
strlen (remusr->d),
|
|
|
|
-1);
|
2002-08-30 21:21:55 +02:00
|
|
|
rc=G10ERR_UNU_PUBKEY;
|
2002-08-30 20:01:32 +02:00
|
|
|
goto fail;
|
1999-07-01 12:53:35 +02:00
|
|
|
}
|
1998-06-29 14:30:57 +02:00
|
|
|
else if( do_we_trust_pre( pk, trustlevel ) ) {
|
1998-01-13 20:04:23 +01:00
|
|
|
/* note: do_we_trust may have changed the trustlevel */
|
1998-01-12 11:18:17 +01:00
|
|
|
|
1999-06-05 15:36:15 +02:00
|
|
|
/* We have at least one valid recipient. It doesn't matters
|
|
|
|
* if this recipient is already present. */
|
1999-02-16 14:16:33 +01:00
|
|
|
any_recipients = 1;
|
1999-06-05 15:36:15 +02:00
|
|
|
|
|
|
|
/* Skip the actual key if the key is already present
|
|
|
|
* in the list */
|
|
|
|
if (key_present_in_pk_list(pk_list, pk) == 0) {
|
|
|
|
free_public_key(pk); pk = NULL;
|
|
|
|
log_info(_("%s: skipped: public key already present\n"),
|
|
|
|
remusr->d);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
PK_LIST r;
|
2002-06-29 15:46:34 +02:00
|
|
|
r = m_alloc( sizeof *r );
|
1999-06-05 15:36:15 +02:00
|
|
|
r->pk = pk; pk = NULL;
|
|
|
|
r->next = pk_list;
|
|
|
|
r->mark = 0;
|
|
|
|
pk_list = r;
|
|
|
|
}
|
1998-01-12 11:18:17 +01:00
|
|
|
}
|
1998-06-29 14:30:57 +02:00
|
|
|
else { /* we don't trust this pk */
|
|
|
|
free_public_key( pk ); pk = NULL;
|
2002-08-30 21:21:55 +02:00
|
|
|
write_status_text_and_buffer (STATUS_INV_RECP, "10 ",
|
2002-06-29 15:46:34 +02:00
|
|
|
remusr->d,
|
|
|
|
strlen (remusr->d),
|
|
|
|
-1);
|
2002-08-30 21:21:55 +02:00
|
|
|
rc=G10ERR_UNU_PUBKEY;
|
2002-08-30 20:01:32 +02:00
|
|
|
goto fail;
|
1998-01-12 11:18:17 +01:00
|
|
|
}
|
1997-12-31 13:32:54 +01:00
|
|
|
}
|
|
|
|
else {
|
1998-06-29 14:30:57 +02:00
|
|
|
free_public_key( pk ); pk = NULL;
|
2002-06-29 15:46:34 +02:00
|
|
|
write_status_text_and_buffer (STATUS_INV_RECP, "0 ",
|
|
|
|
remusr->d,
|
|
|
|
strlen (remusr->d),
|
|
|
|
-1);
|
|
|
|
log_error(_("%s: skipped: %s\n"), remusr->d, g10_errstr(rc) );
|
2002-08-30 20:01:32 +02:00
|
|
|
goto fail;
|
1997-12-31 13:32:54 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-02-16 14:16:33 +01:00
|
|
|
if( !rc && !any_recipients ) {
|
1998-07-06 12:23:57 +02:00
|
|
|
log_error(_("no valid addressees\n"));
|
2002-06-29 15:46:34 +02:00
|
|
|
write_status_text (STATUS_NO_RECP, "0");
|
|
|
|
rc = G10ERR_NO_USER_ID;
|
1997-12-31 13:32:54 +01:00
|
|
|
}
|
|
|
|
|
2002-08-30 20:01:32 +02:00
|
|
|
fail:
|
|
|
|
|
1997-12-31 13:32:54 +01:00
|
|
|
if( rc )
|
1998-06-29 14:30:57 +02:00
|
|
|
release_pk_list( pk_list );
|
1997-12-31 13:32:54 +01:00
|
|
|
else
|
1998-06-29 14:30:57 +02:00
|
|
|
*ret_pk_list = pk_list;
|
2002-06-29 15:46:34 +02:00
|
|
|
if(opt.grouplist)
|
|
|
|
free_strlist(remusr);
|
1997-12-31 13:32:54 +01:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
/* In pgp6 mode, disallow all ciphers except IDEA (1), 3DES (2), and
|
|
|
|
CAST5 (3), all hashes except MD5 (1), SHA1 (2), and RIPEMD160 (3),
|
|
|
|
and all compressions except none (0) and ZIP (1). pgp7 mode
|
|
|
|
expands the cipher list to include AES128 (7), AES192 (8), AES256
|
|
|
|
(9), and TWOFISH (10). For a true PGP key all of this is unneeded
|
|
|
|
as they are the only items present in the preferences subpacket,
|
|
|
|
but checking here covers the weird case of encrypting to a key that
|
|
|
|
had preferences from a different implementation which was then used
|
|
|
|
with PGP. I am not completely comfortable with this as the right
|
|
|
|
thing to do, as it slightly alters the list of what the user is
|
|
|
|
supposedly requesting. It is not against the RFC however, as the
|
|
|
|
preference chosen will never be one that the user didn't specify
|
|
|
|
somewhere ("The implementation may use any mechanism to pick an
|
|
|
|
algorithm in the intersection"), and PGP has no mechanism to fix
|
|
|
|
such a broken preference list, so I'm including it. -dms */
|
1999-02-25 18:51:55 +01:00
|
|
|
|
|
|
|
static int
|
2002-06-29 15:46:34 +02:00
|
|
|
algo_available( int preftype, int algo, void *hint )
|
1999-02-25 18:51:55 +01:00
|
|
|
{
|
|
|
|
if( preftype == PREFTYPE_SYM ) {
|
2002-06-29 15:46:34 +02:00
|
|
|
if( opt.pgp6 && ( algo != 1 && algo != 2 && algo != 3) )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if( opt.pgp7 && (algo != 1 && algo != 2 && algo != 3 &&
|
|
|
|
algo != 7 && algo != 8 && algo != 9 && algo != 10) )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return algo && !check_cipher_algo( algo );
|
1999-02-25 18:51:55 +01:00
|
|
|
}
|
|
|
|
else if( preftype == PREFTYPE_HASH ) {
|
2002-06-29 15:46:34 +02:00
|
|
|
int bits=0;
|
|
|
|
|
|
|
|
if(hint)
|
|
|
|
bits=*(int *)hint;
|
|
|
|
|
|
|
|
if(bits && (bits != md_digest_length(algo)))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if( (opt.pgp6 || opt.pgp7 ) && ( algo != 1 && algo != 2 && algo != 3) )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return algo && !check_digest_algo( algo );
|
1999-02-25 18:51:55 +01:00
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
else if( preftype == PREFTYPE_ZIP ) {
|
|
|
|
if ( ( opt.pgp6 || opt.pgp7 ) && ( algo !=0 && algo != 1) )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return !check_compress_algo( algo );
|
1999-02-25 18:51:55 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
|
|
|
|
|
1998-08-05 18:51:59 +02:00
|
|
|
/****************
|
|
|
|
* Return -1 if we could not find an algorithm.
|
|
|
|
*/
|
|
|
|
int
|
2002-06-29 15:46:34 +02:00
|
|
|
select_algo_from_prefs(PK_LIST pk_list, int preftype, int request, void *hint)
|
1998-08-05 18:51:59 +02:00
|
|
|
{
|
|
|
|
PK_LIST pkr;
|
|
|
|
u32 bits[8];
|
2002-06-29 15:46:34 +02:00
|
|
|
const prefitem_t *prefs;
|
1998-08-05 18:51:59 +02:00
|
|
|
int i, j;
|
|
|
|
int compr_hack=0;
|
|
|
|
int any;
|
|
|
|
|
|
|
|
if( !pk_list )
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
memset( bits, ~0, 8 * sizeof *bits );
|
|
|
|
for( pkr = pk_list; pkr; pkr = pkr->next ) {
|
|
|
|
u32 mask[8];
|
|
|
|
|
|
|
|
memset( mask, 0, 8 * sizeof *mask );
|
2002-06-29 15:46:34 +02:00
|
|
|
if( preftype == PREFTYPE_SYM ) {
|
|
|
|
if( opt.pgp2 &&
|
|
|
|
pkr->pk->version < 4 &&
|
|
|
|
pkr->pk->selfsigversion < 4 )
|
|
|
|
mask[0] |= (1<<1); /* IDEA is implicitly there for v3 keys
|
|
|
|
with v3 selfsigs (rfc2440:12.1) if
|
|
|
|
--pgp2 mode is on. This doesn't
|
|
|
|
mean it's actually available, of
|
|
|
|
course. */
|
|
|
|
else
|
|
|
|
mask[0] |= (1<<2); /* 3DES is implicitly there for everyone else */
|
1999-02-19 15:54:00 +01:00
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
else if( preftype == PREFTYPE_HASH ) {
|
|
|
|
/* While I am including this code for completeness, note
|
|
|
|
that currently --pgp2 mode locks the hash at MD5, so this
|
|
|
|
function will never even be called. Even if the hash
|
|
|
|
wasn't locked at MD5, we don't support sign+encrypt in
|
|
|
|
--pgp2 mode, and that's the only time PREFTYPE_HASH is
|
|
|
|
used anyway. -dms */
|
|
|
|
if( opt.pgp2 &&
|
|
|
|
pkr->pk->version < 4 &&
|
|
|
|
pkr->pk->selfsigversion < 4 )
|
|
|
|
mask[0] |= (1<<1); /* MD5 is there for v3 keys with v3
|
|
|
|
selfsigs when --pgp2 is on. */
|
|
|
|
else
|
|
|
|
mask[0] |= (1<<2); /* SHA1 is there for everyone else */
|
|
|
|
}
|
|
|
|
else if( preftype == PREFTYPE_ZIP )
|
|
|
|
mask[0] |= (1<<0); /* Uncompressed is implicit */
|
|
|
|
|
|
|
|
if (pkr->pk->user_id) /* selected by user ID */
|
|
|
|
prefs = pkr->pk->user_id->prefs;
|
|
|
|
else
|
|
|
|
prefs = pkr->pk->prefs;
|
|
|
|
|
1998-08-05 18:51:59 +02:00
|
|
|
any = 0;
|
2002-06-29 15:46:34 +02:00
|
|
|
if( prefs ) {
|
|
|
|
for (i=0; prefs[i].type; i++ ) {
|
|
|
|
if( prefs[i].type == preftype ) {
|
|
|
|
mask[prefs[i].value/32] |= 1 << (prefs[i].value%32);
|
1998-08-05 18:51:59 +02:00
|
|
|
any = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
|
|
|
|
if( (!prefs || !any) && preftype == PREFTYPE_ZIP ) {
|
1998-08-05 18:51:59 +02:00
|
|
|
mask[0] |= 3; /* asume no_compression and old pgp */
|
|
|
|
compr_hack = 1;
|
|
|
|
}
|
|
|
|
|
1998-12-13 14:14:27 +01:00
|
|
|
#if 0
|
2002-06-29 15:46:34 +02:00
|
|
|
log_debug("pref mask=%08lX%08lX%08lX%08lX%08lX%08lX%08lX%08lX\n",
|
1998-08-05 18:51:59 +02:00
|
|
|
(ulong)mask[7], (ulong)mask[6], (ulong)mask[5], (ulong)mask[4],
|
1998-12-13 14:14:27 +01:00
|
|
|
(ulong)mask[3], (ulong)mask[2], (ulong)mask[1], (ulong)mask[0]);
|
|
|
|
#endif
|
1998-08-05 18:51:59 +02:00
|
|
|
for(i=0; i < 8; i++ )
|
|
|
|
bits[i] &= mask[i];
|
1998-12-13 14:14:27 +01:00
|
|
|
#if 0
|
2002-06-29 15:46:34 +02:00
|
|
|
log_debug("pref bits=%08lX%08lX%08lX%08lX%08lX%08lX%08lX%08lX\n",
|
1998-08-05 18:51:59 +02:00
|
|
|
(ulong)bits[7], (ulong)bits[6], (ulong)bits[5], (ulong)bits[4],
|
1998-12-13 14:14:27 +01:00
|
|
|
(ulong)bits[3], (ulong)bits[2], (ulong)bits[1], (ulong)bits[0]);
|
|
|
|
#endif
|
1998-08-05 18:51:59 +02:00
|
|
|
}
|
|
|
|
/* usable algorithms are now in bits
|
|
|
|
* We now use the last key from pk_list to select
|
|
|
|
* the algorithm we want to use. there are no
|
|
|
|
* preferences for the last key, we select the one
|
|
|
|
* corresponding to first set bit.
|
|
|
|
*/
|
|
|
|
i = -1;
|
|
|
|
any = 0;
|
2002-06-29 15:46:34 +02:00
|
|
|
|
2002-08-13 21:00:23 +02:00
|
|
|
/* Can we use the requested algorithm? */
|
|
|
|
if(request>-1 && (bits[request/32] & (1<<(request%32))) &&
|
|
|
|
algo_available(preftype,request,hint))
|
|
|
|
return request;
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
/* If we have personal prefs set, use them instead of the last key */
|
|
|
|
if(preftype==PREFTYPE_SYM && opt.personal_cipher_prefs)
|
|
|
|
prefs=opt.personal_cipher_prefs;
|
|
|
|
else if(preftype==PREFTYPE_HASH && opt.personal_digest_prefs)
|
|
|
|
prefs=opt.personal_digest_prefs;
|
|
|
|
else if(preftype==PREFTYPE_ZIP && opt.personal_compress_prefs)
|
|
|
|
prefs=opt.personal_compress_prefs;
|
|
|
|
|
|
|
|
if( prefs ) {
|
|
|
|
for(j=0; prefs[j].type; j++ ) {
|
|
|
|
if( prefs[j].type == preftype ) {
|
|
|
|
if( (bits[prefs[j].value/32] & (1<<(prefs[j].value%32))) ) {
|
|
|
|
if( algo_available( preftype, prefs[j].value, hint ) ) {
|
1999-04-18 20:53:34 +02:00
|
|
|
any = 1;
|
2002-06-29 15:46:34 +02:00
|
|
|
i = prefs[j].value;
|
1999-02-25 18:51:55 +01:00
|
|
|
break;
|
|
|
|
}
|
1998-08-05 18:51:59 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
if( !prefs || !any ) {
|
1998-08-05 18:51:59 +02:00
|
|
|
for(j=0; j < 256; j++ )
|
|
|
|
if( (bits[j/32] & (1<<(j%32))) ) {
|
2002-06-29 15:46:34 +02:00
|
|
|
if( algo_available( preftype, j, hint ) ) {
|
1999-02-25 18:51:55 +01:00
|
|
|
i = j;
|
|
|
|
break;
|
|
|
|
}
|
1998-08-05 18:51:59 +02:00
|
|
|
}
|
|
|
|
}
|
2002-06-29 15:46:34 +02:00
|
|
|
|
1998-12-13 14:14:27 +01:00
|
|
|
#if 0
|
|
|
|
log_debug("prefs of type %d: selected %d\n", preftype, i );
|
|
|
|
#endif
|
1998-08-05 18:51:59 +02:00
|
|
|
if( compr_hack && !i ) {
|
|
|
|
/* selected no compression, but we should check whether
|
|
|
|
* algorithm 1 is also available (the ordering is not relevant
|
|
|
|
* in this case). */
|
|
|
|
if( bits[0] & (1<<1) )
|
|
|
|
i = 1; /* yep; we can use compression algo 1 */
|
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
/* "If you are building an authentication system, the recipient
|
|
|
|
may specify a preferred signing algorithm. However, the signer
|
|
|
|
would be foolish to use a weak algorithm simply because the
|
|
|
|
recipient requests it." RFC2440:13. If we settle on MD5, and
|
|
|
|
SHA1 is also available, use SHA1 instead. Of course, if the
|
|
|
|
user intentinally chose MD5 (by putting it in their personal
|
|
|
|
prefs), then we should do what they say. */
|
|
|
|
|
|
|
|
if(preftype==PREFTYPE_HASH &&
|
|
|
|
i==DIGEST_ALGO_MD5 && (bits[0] & (1<<DIGEST_ALGO_SHA1)))
|
|
|
|
{
|
|
|
|
i=DIGEST_ALGO_SHA1;
|
|
|
|
|
|
|
|
if(opt.personal_digest_prefs)
|
|
|
|
for(j=0; prefs[j].type; j++ )
|
|
|
|
if(opt.personal_digest_prefs[j].type==PREFTYPE_HASH &&
|
|
|
|
opt.personal_digest_prefs[j].value==DIGEST_ALGO_MD5)
|
|
|
|
{
|
|
|
|
i=DIGEST_ALGO_MD5;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1998-08-05 18:51:59 +02:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
/*
|
|
|
|
* Select the MDC flag from the pk_list. We can only use MDC if all recipients
|
|
|
|
* support this feature
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
select_mdc_from_pklist (PK_LIST pk_list)
|
|
|
|
{
|
|
|
|
PK_LIST pkr;
|
1998-08-05 18:51:59 +02:00
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
if( !pk_list )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
for (pkr = pk_list; pkr; pkr = pkr->next) {
|
|
|
|
int mdc;
|
|
|
|
|
|
|
|
if (pkr->pk->user_id) /* selected by user ID */
|
|
|
|
mdc = pkr->pk->user_id->mdc_feature;
|
|
|
|
else
|
|
|
|
mdc = pkr->pk->mdc_feature;
|
|
|
|
if (!mdc)
|
|
|
|
return 0; /* at least one recipient does not support it */
|
|
|
|
}
|
|
|
|
return 1; /* can be used */
|
|
|
|
}
|