1
0
mirror of git://git.gnupg.org/gnupg.git synced 2024-12-24 10:39:57 +01:00
gnupg/g10/seckey-cert.c

314 lines
9.0 KiB
C
Raw Normal View History

/* seckey-cert.c - secret key certificate packet handling
2001-03-08 14:33:24 +00:00
* Copyright (C) 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
1997-11-18 14:06:00 +00:00
*
* This file is part of GnuPG.
1997-11-18 14:06:00 +00:00
*
* GnuPG is free software; you can redistribute it and/or modify
1997-11-18 14:06:00 +00: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-11-18 14:06:00 +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
* 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 <assert.h>
#include "util.h"
#include "memory.h"
#include "packet.h"
#include "mpi.h"
#include "keydb.h"
#include "cipher.h"
1998-04-07 18:16:10 +00:00
#include "main.h"
#include "options.h"
1998-05-29 11:53:54 +00:00
#include "i18n.h"
#include "status.h"
1997-11-18 14:06:00 +00:00
1997-11-24 22:24:04 +00:00
static int
1998-06-29 12:30:57 +00:00
do_check( PKT_secret_key *sk )
1997-11-18 14:06:00 +00:00
{
1997-12-09 12:46:23 +00:00
byte *buffer;
1998-01-16 21:15:24 +00:00
u16 csum=0;
int i, res;
1997-12-09 12:46:23 +00:00
unsigned nbytes;
1997-11-18 14:06:00 +00:00
1998-06-29 12:30:57 +00:00
if( sk->is_protected ) { /* remove the protection */
1997-11-24 22:24:04 +00:00
DEK *dek = NULL;
u32 keyid[4]; /* 4! because we need two of them */
1998-04-07 18:16:10 +00:00
CIPHER_HANDLE cipher_hd=NULL;
1998-06-29 12:30:57 +00:00
PKT_secret_key *save_sk;
1997-11-24 22:24:04 +00:00
if( sk->protect.s2k.mode == 1001 ) {
log_info(_("secret key parts are not available\n"));
return G10ERR_GENERAL;
}
1998-06-29 12:30:57 +00:00
if( sk->protect.algo == CIPHER_ALGO_NONE )
1998-06-09 15:14:06 +00:00
BUG();
if( check_cipher_algo( sk->protect.algo ) ) {
1998-08-11 17:29:34 +00:00
log_info(_("protection algorithm %d is not supported\n"),
sk->protect.algo );
return G10ERR_CIPHER_ALGO;
}
1998-06-29 12:30:57 +00:00
keyid_from_sk( sk, keyid );
keyid[2] = keyid[3] = 0;
if( !sk->is_primary ) {
2001-02-08 16:28:28 +00:00
keyid[2] = sk->main_keyid[0];
keyid[3] = sk->main_keyid[1];
}
dek = passphrase_to_dek( keyid, sk->pubkey_algo, sk->protect.algo,
1998-06-29 12:30:57 +00:00
&sk->protect.s2k, 0 );
cipher_hd = cipher_open( sk->protect.algo,
1998-06-09 15:14:06 +00:00
CIPHER_MODE_AUTO_CFB, 1);
cipher_setkey( cipher_hd, dek->key, dek->keylen );
m_free(dek);
1998-06-29 12:30:57 +00:00
save_sk = copy_secret_key( NULL, sk );
cipher_setiv( cipher_hd, sk->protect.iv, sk->protect.ivlen );
csum = 0;
1998-08-08 19:27:00 +00:00
if( sk->version >= 4 ) {
1998-08-05 16:51:59 +00:00
int ndata;
byte *p, *data;
u16 csumc = 0;
1998-08-05 16:51:59 +00:00
i = pubkey_get_npkey(sk->pubkey_algo);
assert( mpi_is_opaque( sk->skey[i] ) );
p = mpi_get_opaque( sk->skey[i], &ndata );
if ( ndata > 1 )
csumc = p[ndata-2] << 8 | p[ndata-1];
1998-08-05 16:51:59 +00:00
data = m_alloc_secure( ndata );
cipher_decrypt( cipher_hd, data, p, ndata );
mpi_free( sk->skey[i] ); sk->skey[i] = NULL ;
p = data;
1998-08-08 19:27:00 +00:00
if( ndata < 2 ) {
log_error("not enough bytes for checksum\n");
sk->csum = 0;
csum = 1;
}
else {
csum = checksum( data, ndata-2);
sk->csum = data[ndata-2] << 8 | data[ndata-1];
if ( sk->csum != csum ) {
/* This is a PGP 7.0.0 workaround */
sk->csum = csumc; /* take the encrypted one */
}
1998-08-08 19:27:00 +00:00
}
1998-08-05 16:51:59 +00:00
/* must check it here otherwise the mpi_read_xx would fail
* because the length may have an arbitrary value */
1998-08-05 16:51:59 +00:00
if( sk->csum == csum ) {
for( ; i < pubkey_get_nskey(sk->pubkey_algo); i++ ) {
nbytes = ndata;
sk->skey[i] = mpi_read_from_buffer(p, &nbytes, 1 );
ndata -= nbytes;
p += nbytes;
}
/* at this point ndata should be equal to 2 (the checksum) */
1998-08-05 16:51:59 +00:00
}
m_free(data);
}
1998-08-05 16:51:59 +00:00
else {
for(i=pubkey_get_npkey(sk->pubkey_algo);
i < pubkey_get_nskey(sk->pubkey_algo); i++ ) {
buffer = mpi_get_secure_buffer( sk->skey[i], &nbytes, NULL );
cipher_sync( cipher_hd );
assert( mpi_is_protected(sk->skey[i]) );
cipher_decrypt( cipher_hd, buffer, buffer, nbytes );
mpi_set_buffer( sk->skey[i], buffer, nbytes, 0 );
mpi_clear_protect_flag( sk->skey[i] );
csum += checksum_mpi( sk->skey[i] );
m_free( buffer );
}
if( opt.emulate_bugs & EMUBUG_GPGCHKSUM ) {
csum = sk->csum;
}
1998-06-09 15:14:06 +00:00
}
cipher_close( cipher_hd );
/* now let's see whether we have used the right passphrase */
1998-06-29 12:30:57 +00:00
if( csum != sk->csum ) {
copy_secret_key( sk, save_sk );
2000-11-16 15:45:03 +00:00
passphrase_clear_cache ( keyid, sk->pubkey_algo );
1998-06-29 12:30:57 +00:00
free_secret_key( save_sk );
return G10ERR_BAD_PASS;
1998-06-09 15:14:06 +00:00
}
/* the checksum may fail, so we also check the key itself */
1998-06-29 12:30:57 +00:00
res = pubkey_check_secret_key( sk->pubkey_algo, sk->skey );
1998-06-13 06:59:14 +00:00
if( res ) {
1998-06-29 12:30:57 +00:00
copy_secret_key( sk, save_sk );
2000-11-16 15:45:03 +00:00
passphrase_clear_cache ( keyid, sk->pubkey_algo );
1998-06-29 12:30:57 +00:00
free_secret_key( save_sk );
1998-06-09 15:14:06 +00:00
return G10ERR_BAD_PASS;
}
1998-06-29 12:30:57 +00:00
free_secret_key( save_sk );
sk->is_protected = 0;
1997-11-24 22:24:04 +00:00
}
else { /* not protected, assume it is okay if the checksum is okay */
csum = 0;
1998-06-29 12:30:57 +00:00
for(i=pubkey_get_npkey(sk->pubkey_algo);
i < pubkey_get_nskey(sk->pubkey_algo); i++ ) {
csum += checksum_mpi( sk->skey[i] );
1998-03-09 21:44:06 +00:00
}
1998-06-29 12:30:57 +00:00
if( csum != sk->csum )
1998-06-13 06:59:14 +00:00
return G10ERR_CHECKSUM;
1997-11-18 14:06:00 +00:00
}
1997-12-09 12:46:23 +00:00
1997-11-18 14:06:00 +00:00
return 0;
}
1997-11-24 22:24:04 +00:00
1997-11-18 14:06:00 +00:00
1997-11-24 22:24:04 +00:00
/****************
1998-06-29 12:30:57 +00:00
* Check the secret key
1998-09-11 05:47:32 +00:00
* Ask up to 3 (or n) times for a correct passphrase
1997-11-24 22:24:04 +00:00
*/
int
1998-09-11 05:47:32 +00:00
check_secret_key( PKT_secret_key *sk, int n )
1997-11-24 22:24:04 +00:00
{
1997-12-09 12:46:23 +00:00
int rc = G10ERR_BAD_PASS;
int i;
1998-09-11 05:47:32 +00:00
if( n < 1 )
n = opt.batch? 1 : 3; /* use the default value */
1998-09-11 05:47:32 +00:00
for(i=0; i < n && rc == G10ERR_BAD_PASS; i++ ) {
1997-12-09 12:46:23 +00:00
if( i )
log_info(_("Invalid passphrase; please try again ...\n"));
1998-06-29 12:30:57 +00:00
rc = do_check( sk );
if( rc == G10ERR_BAD_PASS && is_status_enabled() ) {
u32 kid[2];
char buf[50];
keyid_from_sk( sk, kid );
sprintf(buf, "%08lX%08lX", (ulong)kid[0], (ulong)kid[1]);
write_status_text( STATUS_BAD_PASSPHRASE, buf );
}
1998-09-28 19:25:31 +00:00
if( have_static_passphrase() )
1998-01-02 20:40:10 +00:00
break;
1997-12-09 12:46:23 +00:00
}
1998-05-26 13:38:00 +00:00
if( !rc )
write_status( STATUS_GOOD_PASSPHRASE );
1997-12-09 12:46:23 +00:00
return rc;
}
1998-01-06 21:01:36 +00:00
/****************
1998-04-14 17:51:16 +00:00
* check whether the secret key is protected.
1998-01-06 21:01:36 +00:00
* Returns: 0 not protected, -1 on error or the protection algorithm
*/
int
1998-06-29 12:30:57 +00:00
is_secret_key_protected( PKT_secret_key *sk )
1998-01-06 21:01:36 +00:00
{
1998-06-29 12:30:57 +00:00
return sk->is_protected? sk->protect.algo : 0;
1998-04-02 10:30:03 +00:00
}
1997-12-09 12:46:23 +00:00
/****************
1998-06-29 12:30:57 +00:00
* Protect the secret key with the passphrase from DEK
1997-12-09 12:46:23 +00:00
*/
int
1998-06-29 12:30:57 +00:00
protect_secret_key( PKT_secret_key *sk, DEK *dek )
1997-12-09 12:46:23 +00:00
{
1998-08-08 19:27:00 +00:00
int i,j, rc = 0;
byte *buffer;
unsigned nbytes;
u16 csum;
1998-04-02 10:30:03 +00:00
1997-12-09 12:46:23 +00:00
if( !dek )
return 0;
1998-06-29 12:30:57 +00:00
if( !sk->is_protected ) { /* okay, apply the protection */
1998-04-07 18:16:10 +00:00
CIPHER_HANDLE cipher_hd=NULL;
1998-04-02 10:30:03 +00:00
1998-06-29 12:30:57 +00:00
if( check_cipher_algo( sk->protect.algo ) )
1998-07-29 19:35:05 +00:00
rc = G10ERR_CIPHER_ALGO; /* unsupport protection algorithm */
1998-06-09 15:14:06 +00:00
else {
print_cipher_algo_note( sk->protect.algo );
1998-06-29 12:30:57 +00:00
cipher_hd = cipher_open( sk->protect.algo,
1998-04-07 18:16:10 +00:00
CIPHER_MODE_AUTO_CFB, 1 );
1998-09-14 15:49:56 +00:00
if( cipher_setkey( cipher_hd, dek->key, dek->keylen ) )
1998-11-10 12:59:59 +00:00
log_info(_("WARNING: Weak key detected"
1998-09-14 15:49:56 +00:00
" - please change passphrase again.\n"));
sk->protect.ivlen = cipher_get_blocksize( sk->protect.algo );
assert( sk->protect.ivlen <= DIM(sk->protect.iv) );
if( sk->protect.ivlen != 8 && sk->protect.ivlen != 16 )
BUG(); /* yes, we are very careful */
randomize_buffer(sk->protect.iv, sk->protect.ivlen, 1);
cipher_setiv( cipher_hd, sk->protect.iv, sk->protect.ivlen );
1998-08-08 19:27:00 +00:00
if( sk->version >= 4 ) {
byte *bufarr[PUBKEY_MAX_NSKEY];
unsigned narr[PUBKEY_MAX_NSKEY];
unsigned nbits[PUBKEY_MAX_NSKEY];
1998-08-08 19:27:00 +00:00
int ndata=0;
byte *p, *data;
for(j=0, i = pubkey_get_npkey(sk->pubkey_algo);
i < pubkey_get_nskey(sk->pubkey_algo); i++, j++ ) {
assert( !mpi_is_opaque( sk->skey[i] ) );
bufarr[j] = mpi_get_buffer( sk->skey[i], &narr[j], NULL );
1998-08-08 19:27:00 +00:00
nbits[j] = mpi_get_nbits( sk->skey[i] );
ndata += narr[j] + 2;
1998-08-08 19:27:00 +00:00
}
for( ; j < PUBKEY_MAX_NSKEY; j++ )
bufarr[j] = NULL;
1998-08-08 19:27:00 +00:00
ndata += 2; /* for checksum */
data = m_alloc_secure( ndata );
p = data;
for(j=0; j < PUBKEY_MAX_NSKEY && bufarr[j]; j++ ) {
1998-08-08 19:27:00 +00:00
p[0] = nbits[j] >> 8 ;
p[1] = nbits[j];
p += 2;
memcpy(p, bufarr[j], narr[j] );
p += narr[j];
m_free(bufarr[j]);
1998-08-08 19:27:00 +00:00
}
csum = checksum( data, ndata-2);
sk->csum = csum;
*p++ = csum >> 8;
*p++ = csum;
assert( p == data+ndata );
cipher_encrypt( cipher_hd, data, data, ndata );
for(i = pubkey_get_npkey(sk->pubkey_algo);
i < pubkey_get_nskey(sk->pubkey_algo); i++ ) {
mpi_free( sk->skey[i] );
sk->skey[i] = NULL;
}
i = pubkey_get_npkey(sk->pubkey_algo);
sk->skey[i] = mpi_set_opaque(NULL, data, ndata );
1998-08-05 16:51:59 +00:00
}
else {
/* NOTE: we always recalculate the checksum because there
1998-08-08 19:27:00 +00:00
* are some test releases which calculated it wrong */
1998-08-05 16:51:59 +00:00
csum = 0;
for(i=pubkey_get_npkey(sk->pubkey_algo);
i < pubkey_get_nskey(sk->pubkey_algo); i++ ) {
csum += checksum_mpi_counted_nbits( sk->skey[i] );
buffer = mpi_get_buffer( sk->skey[i], &nbytes, NULL );
cipher_sync( cipher_hd );
assert( !mpi_is_protected(sk->skey[i]) );
cipher_encrypt( cipher_hd, buffer, buffer, nbytes );
mpi_set_buffer( sk->skey[i], buffer, nbytes, 0 );
mpi_set_protect_flag( sk->skey[i] );
m_free( buffer );
}
sk->csum = csum;
}
1998-06-29 12:30:57 +00:00
sk->is_protected = 1;
1998-04-07 18:16:10 +00:00
cipher_close( cipher_hd );
1998-04-02 10:30:03 +00:00
}
}
return rc;
1997-11-24 22:24:04 +00:00
}
1997-11-18 14:06:00 +00:00