2002-02-11 10:05:58 +00:00
|
|
|
/*
|
|
|
|
protocol_key.c -- handle the meta-protocol, key exchange
|
2003-07-12 17:41:48 +00:00
|
|
|
Copyright (C) 1999-2003 Ivo Timmermans <ivo@o2w.nl>,
|
|
|
|
2000-2003 Guus Sliepen <guus@sliepen.eu.org>
|
2002-02-11 10:05:58 +00:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
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.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
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., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
$Id: protocol_key.c,v 1.1.4.22 2003/07/24 12:08:16 guus Exp $
|
2002-02-11 10:05:58 +00:00
|
|
|
*/
|
|
|
|
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "system.h"
|
2002-02-11 10:05:58 +00:00
|
|
|
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "avl_tree.h"
|
|
|
|
#include "connection.h"
|
|
|
|
#include "logger.h"
|
2002-02-11 10:05:58 +00:00
|
|
|
#include "net.h"
|
|
|
|
#include "netutl.h"
|
|
|
|
#include "node.h"
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "protocol.h"
|
|
|
|
#include "utils.h"
|
|
|
|
#include "xalloc.h"
|
2002-02-11 10:05:58 +00:00
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
bool mykeyused = false;
|
2002-02-11 10:05:58 +00:00
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
bool send_key_changed(connection_t *c, const node_t *n)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
|
|
|
|
|
|
|
/* Only send this message if some other daemon requested our key previously.
|
|
|
|
This reduces unnecessary key_changed broadcasts.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if(n == myself && !mykeyused)
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
return send_request(c, "%d %lx %s", KEY_CHANGED, random(), n->name);
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
bool key_changed_h(connection_t *c)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
char name[MAX_STRING_SIZE];
|
|
|
|
node_t *n;
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
if(sscanf(c->buffer, "%*d %*x " MAX_STRING, name) != 1) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s)"), "KEY_CHANGED",
|
2002-09-09 21:25:28 +00:00
|
|
|
c->name, c->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(seen_request(c->buffer))
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
n = lookup_node(name);
|
|
|
|
|
|
|
|
if(!n) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got %s from %s (%s) origin %s which does not exist"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"KEY_CHANGED", c->name, c->hostname, name);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
n->status.validkey = false;
|
|
|
|
n->status.waitingforkey = false;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
/* Tell the others */
|
|
|
|
|
|
|
|
forward_request(c);
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
bool send_req_key(connection_t *c, const node_t *from, const node_t *to)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
|
|
|
|
|
|
|
return send_request(c, "%d %s %s", REQ_KEY, from->name, to->name);
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
bool req_key_h(connection_t *c)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
char from_name[MAX_STRING_SIZE];
|
|
|
|
char to_name[MAX_STRING_SIZE];
|
|
|
|
node_t *from, *to;
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
if(sscanf(c->buffer, "%*d " MAX_STRING " " MAX_STRING, from_name, to_name) != 2) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s)"), "REQ_KEY", c->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
c->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
from = lookup_node(from_name);
|
|
|
|
|
|
|
|
if(!from) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got %s from %s (%s) origin %s which does not exist in our connection list"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"REQ_KEY", c->name, c->hostname, from_name);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
to = lookup_node(to_name);
|
|
|
|
|
|
|
|
if(!to) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got %s from %s (%s) destination %s which does not exist in our connection list"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"REQ_KEY", c->name, c->hostname, to_name);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Check if this key request is for us */
|
|
|
|
|
|
|
|
if(to == myself) { /* Yes, send our own key back */
|
2003-07-22 20:55:21 +00:00
|
|
|
mykeyused = true;
|
2002-09-09 21:25:28 +00:00
|
|
|
from->received_seqno = 0;
|
2003-04-18 21:18:36 +00:00
|
|
|
memset(from->late, 0, sizeof(from->late));
|
2002-09-09 21:25:28 +00:00
|
|
|
send_ans_key(c, myself, from);
|
|
|
|
} else {
|
|
|
|
send_req_key(to->nexthop->connection, from, to);
|
|
|
|
}
|
2002-02-11 10:05:58 +00:00
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
bool send_ans_key(connection_t *c, const node_t *from, const node_t *to)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
char key[MAX_STRING_SIZE];
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
bin2hex(from->key, key, from->keylength);
|
|
|
|
key[from->keylength * 2] = '\0';
|
|
|
|
|
|
|
|
return send_request(c, "%d %s %s %s %d %d %d %d", ANS_KEY,
|
|
|
|
from->name, to->name, key,
|
|
|
|
from->cipher ? from->cipher->nid : 0,
|
|
|
|
from->digest ? from->digest->type : 0, from->maclength,
|
|
|
|
from->compression);
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
bool ans_key_h(connection_t *c)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
char from_name[MAX_STRING_SIZE];
|
|
|
|
char to_name[MAX_STRING_SIZE];
|
|
|
|
char key[MAX_STRING_SIZE];
|
|
|
|
int cipher, digest, maclength, compression;
|
|
|
|
node_t *from, *to;
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
if(sscanf(c->buffer, "%*d "MAX_STRING" "MAX_STRING" "MAX_STRING" %d %d %d %d",
|
|
|
|
from_name, to_name, key, &cipher, &digest, &maclength,
|
|
|
|
&compression) != 7) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s)"), "ANS_KEY", c->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
c->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
from = lookup_node(from_name);
|
|
|
|
|
|
|
|
if(!from) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got %s from %s (%s) origin %s which does not exist in our connection list"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"ANS_KEY", c->name, c->hostname, from_name);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
to = lookup_node(to_name);
|
|
|
|
|
|
|
|
if(!to) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got %s from %s (%s) destination %s which does not exist in our connection list"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"ANS_KEY", c->name, c->hostname, to_name);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
/* Forward it if necessary */
|
|
|
|
|
|
|
|
if(to != myself) {
|
|
|
|
return send_request(to->nexthop->connection, "%s", c->buffer);
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
/* Update our copy of the origin's packet key */
|
|
|
|
|
|
|
|
if(from->key)
|
|
|
|
free(from->key);
|
|
|
|
|
|
|
|
from->key = xstrdup(key);
|
|
|
|
from->keylength = strlen(key) / 2;
|
|
|
|
hex2bin(from->key, from->key, from->keylength);
|
|
|
|
from->key[from->keylength] = '\0';
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
from->status.validkey = true;
|
|
|
|
from->status.waitingforkey = false;
|
2002-09-09 21:25:28 +00:00
|
|
|
from->sent_seqno = 0;
|
|
|
|
|
|
|
|
/* Check and lookup cipher and digest algorithms */
|
|
|
|
|
|
|
|
if(cipher) {
|
|
|
|
from->cipher = EVP_get_cipherbynid(cipher);
|
|
|
|
|
|
|
|
if(!from->cipher) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Node %s (%s) uses unknown cipher!"), from->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
from->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(from->keylength != from->cipher->key_len + from->cipher->iv_len) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Node %s (%s) uses wrong keylength!"), from->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
from->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
from->cipher = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
from->maclength = maclength;
|
|
|
|
|
|
|
|
if(digest) {
|
|
|
|
from->digest = EVP_get_digestbynid(digest);
|
|
|
|
|
|
|
|
if(!from->digest) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Node %s (%s) uses unknown digest!"), from->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
from->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(from->maclength > from->digest->md_size || from->maclength < 0) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Node %s (%s) uses bogus MAC length!"),
|
2002-09-09 21:25:28 +00:00
|
|
|
from->name, from->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
from->digest = NULL;
|
|
|
|
}
|
|
|
|
|
2003-05-06 21:13:18 +00:00
|
|
|
if(compression < 0 || compression > 11) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Node %s (%s) uses bogus compression level!"), from->name, from->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2003-05-06 21:13:18 +00:00
|
|
|
}
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
from->compression = compression;
|
|
|
|
|
2003-07-23 22:17:31 +00:00
|
|
|
if(from->cipher)
|
|
|
|
EVP_EncryptInit_ex(&from->packet_ctx, from->cipher, NULL, from->key, from->key + from->cipher->key_len);
|
2003-05-06 21:13:18 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
flush_queue(from);
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|