1997-11-24 12:04:11 +01:00
|
|
|
/* seskey.c - make sesssion keys etc.
|
2002-06-29 15:46:34 +02:00
|
|
|
* Copyright (C) 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
|
1997-11-18 15:06:00 +01:00
|
|
|
*
|
1998-12-23 13:41:40 +01:00
|
|
|
* This file is part of GnuPG.
|
1997-11-18 15:06:00 +01:00
|
|
|
*
|
1998-12-23 13:41:40 +01:00
|
|
|
* GnuPG is free software; you can redistribute it and/or modify
|
1997-11-18 15:06:00 +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-11-18 15:06:00 +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 <assert.h>
|
|
|
|
#include "util.h"
|
2002-06-29 15:46:34 +02:00
|
|
|
#include "cipher.h"
|
|
|
|
#include "mpi.h"
|
1997-11-24 23:24:04 +01:00
|
|
|
#include "main.h"
|
1998-09-14 17:49:56 +02:00
|
|
|
#include "i18n.h"
|
1997-11-18 15:06:00 +01:00
|
|
|
|
|
|
|
|
|
|
|
/****************
|
|
|
|
* Make a session key and put it into DEK
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
make_session_key( DEK *dek )
|
|
|
|
{
|
2002-06-29 15:46:34 +02:00
|
|
|
CIPHER_HANDLE chd;
|
1998-09-14 17:49:56 +02:00
|
|
|
int i, rc;
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
dek->keylen = cipher_get_keylen( dek->algo ) / 8;
|
1998-09-14 17:49:56 +02:00
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
chd = cipher_open( dek->algo, CIPHER_MODE_AUTO_CFB, 1 );
|
|
|
|
randomize_buffer( dek->key, dek->keylen, 1 );
|
1998-09-14 17:49:56 +02:00
|
|
|
for(i=0; i < 16; i++ ) {
|
2002-06-29 15:46:34 +02:00
|
|
|
rc = cipher_setkey( chd, dek->key, dek->keylen );
|
1998-09-14 17:49:56 +02:00
|
|
|
if( !rc ) {
|
2002-06-29 15:46:34 +02:00
|
|
|
cipher_close( chd );
|
1998-09-14 17:49:56 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
log_info(_("weak key created - retrying\n") );
|
|
|
|
/* Renew the session key until we get a non-weak key. */
|
2002-06-29 15:46:34 +02:00
|
|
|
randomize_buffer( dek->key, dek->keylen, 1 );
|
1998-09-14 17:49:56 +02:00
|
|
|
}
|
|
|
|
log_fatal(_(
|
|
|
|
"cannot avoid weak key for symmetric cipher; tried %d times!\n"),
|
|
|
|
i);
|
1997-11-18 15:06:00 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/****************
|
|
|
|
* Encode the session key. NBITS is the number of bits which should be used
|
1997-12-16 20:15:09 +01:00
|
|
|
* for packing the session key.
|
1997-11-18 15:06:00 +01:00
|
|
|
* returns: A mpi with the session key (caller must free)
|
|
|
|
*/
|
|
|
|
MPI
|
|
|
|
encode_session_key( DEK *dek, unsigned nbits )
|
|
|
|
{
|
|
|
|
int nframe = (nbits+7) / 8;
|
|
|
|
byte *p;
|
1998-02-12 15:39:08 +01:00
|
|
|
byte *frame;
|
1998-08-07 10:53:38 +02:00
|
|
|
int i,n;
|
1997-11-18 15:06:00 +01:00
|
|
|
u16 csum;
|
1998-02-12 15:39:08 +01:00
|
|
|
MPI a;
|
1997-11-18 15:06:00 +01:00
|
|
|
|
1998-04-14 19:51:16 +02:00
|
|
|
/* the current limitation is that we can only use a session key
|
|
|
|
* whose length is a multiple of BITS_PER_MPI_LIMB
|
1997-11-18 15:06:00 +01:00
|
|
|
* I think we can live with that.
|
|
|
|
*/
|
1998-02-12 15:39:08 +01:00
|
|
|
if( dek->keylen + 7 > nframe || !nframe )
|
1997-11-18 15:06:00 +01:00
|
|
|
log_bug("can't encode a %d bit key in a %d bits frame\n",
|
|
|
|
dek->keylen*8, nbits );
|
|
|
|
|
|
|
|
/* We encode the session key in this way:
|
|
|
|
*
|
|
|
|
* 0 2 RND(n bytes) 0 A DEK(k bytes) CSUM(2 bytes)
|
|
|
|
*
|
1998-04-07 20:16:10 +02:00
|
|
|
* (But how can we store the leading 0 - the external representaion
|
1998-04-14 19:51:16 +02:00
|
|
|
* of MPIs doesn't allow leading zeroes =:-)
|
1998-04-07 20:16:10 +02:00
|
|
|
*
|
1997-11-18 15:06:00 +01:00
|
|
|
* RND are non-zero random bytes.
|
1997-11-24 23:24:04 +01:00
|
|
|
* A is the cipher algorithm
|
1997-11-18 15:06:00 +01:00
|
|
|
* DEK is the encryption key (session key) length k depends on the
|
1998-04-30 16:06:01 +02:00
|
|
|
* cipher algorithm (20 is used with blowfish160).
|
1997-11-18 15:06:00 +01:00
|
|
|
* CSUM is the 16 bit checksum over the DEK
|
|
|
|
*/
|
|
|
|
csum = 0;
|
|
|
|
for( p = dek->key, i=0; i < dek->keylen; i++ )
|
|
|
|
csum += *p++;
|
1998-02-12 15:39:08 +01:00
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
frame = m_alloc_secure( nframe );
|
1998-02-12 15:39:08 +01:00
|
|
|
n = 0;
|
|
|
|
frame[n++] = 0;
|
|
|
|
frame[n++] = 2;
|
|
|
|
i = nframe - 6 - dek->keylen;
|
|
|
|
assert( i > 0 );
|
2002-06-29 15:46:34 +02:00
|
|
|
p = get_random_bits( i*8, 1, 1 );
|
1998-08-08 21:27:00 +02:00
|
|
|
/* replace zero bytes by new values */
|
|
|
|
for(;;) {
|
|
|
|
int j, k;
|
|
|
|
byte *pp;
|
|
|
|
|
|
|
|
/* count the zero bytes */
|
|
|
|
for(j=k=0; j < i; j++ )
|
|
|
|
if( !p[j] )
|
|
|
|
k++;
|
|
|
|
if( !k )
|
|
|
|
break; /* okay: no zero bytes */
|
|
|
|
k += k/128; /* better get some more */
|
2002-06-29 15:46:34 +02:00
|
|
|
pp = get_random_bits( k*8, 1, 1);
|
1998-08-08 21:27:00 +02:00
|
|
|
for(j=0; j < i && k ; j++ )
|
|
|
|
if( !p[j] )
|
|
|
|
p[j] = pp[--k];
|
2002-06-29 15:46:34 +02:00
|
|
|
m_free(pp);
|
1998-08-08 21:27:00 +02:00
|
|
|
}
|
1998-08-07 10:53:38 +02:00
|
|
|
memcpy( frame+n, p, i );
|
2002-06-29 15:46:34 +02:00
|
|
|
m_free(p);
|
1998-08-07 10:53:38 +02:00
|
|
|
n += i;
|
1998-02-12 15:39:08 +01:00
|
|
|
frame[n++] = 0;
|
|
|
|
frame[n++] = dek->algo;
|
|
|
|
memcpy( frame+n, dek->key, dek->keylen ); n += dek->keylen;
|
|
|
|
frame[n++] = csum >>8;
|
|
|
|
frame[n++] = csum;
|
1997-11-18 15:06:00 +01:00
|
|
|
assert( n == nframe );
|
2002-06-29 15:46:34 +02:00
|
|
|
a = mpi_alloc_secure( (nframe+BYTES_PER_MPI_LIMB-1) / BYTES_PER_MPI_LIMB );
|
|
|
|
mpi_set_buffer( a, frame, nframe, 0 );
|
|
|
|
m_free(frame);
|
1998-02-12 15:39:08 +01:00
|
|
|
return a;
|
1997-11-18 15:06:00 +01:00
|
|
|
}
|
|
|
|
|
1997-11-24 12:04:11 +01:00
|
|
|
|
1998-02-12 00:22:09 +01:00
|
|
|
static MPI
|
2002-06-29 15:46:34 +02:00
|
|
|
do_encode_md( MD_HANDLE md, int algo, size_t len, unsigned nbits,
|
2000-07-14 19:34:53 +02:00
|
|
|
const byte *asn, size_t asnlen, int v3compathack )
|
1997-12-31 13:32:54 +01:00
|
|
|
{
|
|
|
|
int nframe = (nbits+7) / 8;
|
1998-02-12 15:39:08 +01:00
|
|
|
byte *frame;
|
1998-01-16 22:15:24 +01:00
|
|
|
int i,n;
|
1998-02-12 15:39:08 +01:00
|
|
|
MPI a;
|
1997-12-31 13:32:54 +01:00
|
|
|
|
1998-02-12 15:39:08 +01:00
|
|
|
if( len + asnlen + 4 > nframe )
|
1998-02-16 21:05:02 +01:00
|
|
|
log_bug("can't encode a %d bit MD into a %d bits frame\n",
|
|
|
|
(int)(len*8), (int)nbits);
|
1997-12-31 13:32:54 +01:00
|
|
|
|
|
|
|
/* We encode the MD in this way:
|
|
|
|
*
|
2002-06-29 15:46:34 +02:00
|
|
|
* 0 A PAD(n bytes) 0 ASN(asnlen bytes) MD(len bytes)
|
1997-12-31 13:32:54 +01:00
|
|
|
*
|
|
|
|
* PAD consists of FF bytes.
|
|
|
|
*/
|
2002-06-29 15:46:34 +02:00
|
|
|
frame = md_is_secure(md)? m_alloc_secure( nframe ) : m_alloc( nframe );
|
1997-12-31 13:32:54 +01:00
|
|
|
n = 0;
|
1998-02-12 15:39:08 +01:00
|
|
|
frame[n++] = 0;
|
2000-07-14 19:34:53 +02:00
|
|
|
frame[n++] = v3compathack? algo : 1; /* block type */
|
1998-02-12 15:39:08 +01:00
|
|
|
i = nframe - len - asnlen -3 ;
|
|
|
|
assert( i > 1 );
|
|
|
|
memset( frame+n, 0xff, i ); n += i;
|
|
|
|
frame[n++] = 0;
|
|
|
|
memcpy( frame+n, asn, asnlen ); n += asnlen;
|
2002-06-29 15:46:34 +02:00
|
|
|
memcpy( frame+n, md_read(md, algo), len ); n += len;
|
1997-11-24 12:04:11 +01:00
|
|
|
assert( n == nframe );
|
2002-06-29 15:46:34 +02:00
|
|
|
a = md_is_secure(md)?
|
|
|
|
mpi_alloc_secure( (nframe+BYTES_PER_MPI_LIMB-1) / BYTES_PER_MPI_LIMB )
|
|
|
|
: mpi_alloc( (nframe+BYTES_PER_MPI_LIMB-1) / BYTES_PER_MPI_LIMB );
|
|
|
|
mpi_set_buffer( a, frame, nframe, 0 );
|
|
|
|
m_free(frame);
|
1998-02-12 15:39:08 +01:00
|
|
|
return a;
|
1997-11-24 12:04:11 +01:00
|
|
|
}
|
|
|
|
|
1997-11-24 23:24:04 +01:00
|
|
|
|
2000-07-14 19:34:53 +02:00
|
|
|
/****************
|
|
|
|
* Encode a message digest into an MPI.
|
|
|
|
* v3compathack is used to work around a bug in old GnuPG versions
|
|
|
|
* which did put the algo identifier inseatd of the block type 1 into
|
2002-06-29 15:46:34 +02:00
|
|
|
* the encoded value. Setting this flag forces the old behaviour.
|
2000-07-14 19:34:53 +02:00
|
|
|
*/
|
1997-12-01 11:33:23 +01:00
|
|
|
MPI
|
2002-06-29 15:46:34 +02:00
|
|
|
encode_md_value( int pubkey_algo, MD_HANDLE md, int hash_algo,
|
2000-07-14 19:34:53 +02:00
|
|
|
unsigned nbits, int v3compathack )
|
1997-12-01 11:33:23 +01:00
|
|
|
{
|
2002-06-29 15:46:34 +02:00
|
|
|
int algo = hash_algo? hash_algo : md_get_algo(md);
|
|
|
|
const byte *asn;
|
|
|
|
size_t asnlen, mdlen;
|
1998-06-15 17:41:04 +02:00
|
|
|
MPI frame;
|
|
|
|
|
2002-06-29 15:46:34 +02:00
|
|
|
if( pubkey_algo == PUBKEY_ALGO_DSA ) {
|
|
|
|
mdlen = md_digest_length (hash_algo);
|
|
|
|
if (mdlen != 20) {
|
|
|
|
log_error (_("DSA requires the use of a 160 bit hash algorithm\n"));
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
frame = md_is_secure(md)? mpi_alloc_secure((md_digest_length(hash_algo)
|
|
|
|
+BYTES_PER_MPI_LIMB-1) / BYTES_PER_MPI_LIMB )
|
|
|
|
: mpi_alloc((md_digest_length(hash_algo)
|
|
|
|
+BYTES_PER_MPI_LIMB-1) / BYTES_PER_MPI_LIMB );
|
|
|
|
mpi_set_buffer( frame, md_read(md, hash_algo),
|
|
|
|
md_digest_length(hash_algo), 0 );
|
1998-06-15 17:41:04 +02:00
|
|
|
}
|
|
|
|
else {
|
2002-06-29 15:46:34 +02:00
|
|
|
asn = md_asn_oid( algo, &asnlen, &mdlen );
|
|
|
|
frame = do_encode_md( md, algo, mdlen, nbits, asn, asnlen, v3compathack);
|
1998-06-15 17:41:04 +02:00
|
|
|
}
|
|
|
|
return frame;
|
1997-12-01 11:33:23 +01:00
|
|
|
}
|
|
|
|
|