1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454
|
/*
* IPsec DOI and Oakley resolution routines
*
* Copyright (C) 1997 Angelos D. Keromytis.
* Copyright (C) 1998-2002,2010-2017 D. Hugh Redelmeier <hugh@mimosa.com>
* Copyright (C) 2003-2006 Michael Richardson <mcr@xelerance.com>
* Copyright (C) 2003-2011 Paul Wouters <paul@xelerance.com>
* Copyright (C) 2010-2011 Tuomo Soini <tis@foobar.fi>
* Copyright (C) 2009 Avesh Agarwal <avagarwa@redhat.com>
* Copyright (C) 2012-2018 Paul Wouters <pwouters@redhat.com>
* Copyright (C) 2013 David McCullough <ucdevel@gmail.com>
* Copyright (C) 2013 Matt Rogers <mrogers@redhat.com>
* Copyright (C) 2014-2019 Andrew Cagney <cagney@gnu.org>
* Copyright (C) 2017-2018 Antony Antony <antony@phenome.org>
* Copyright (C) 2017 Mayank Totale <mtotale@gmail.com>
*
* 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. See <https://www.gnu.org/licenses/gpl2.txt>.
*
* 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.
*
*/
#include <stdio.h>
#include <string.h>
#include <stddef.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <resolv.h>
#include "sysdep.h"
#include "constants.h"
#include "defs.h"
#include "state.h"
#include "id.h"
#include "x509.h"
#include "certs.h"
#include "connections.h" /* needs id.h */
#include "packet.h"
#include "keys.h"
#include "demux.h" /* needs packet.h */
#include "kernel.h" /* needs connections.h */
#include "log.h"
#include "server.h"
#include "timer.h"
#include "rnd.h"
#include "ipsec_doi.h" /* needs demux.h and state.h */
#include "ikev1_quick.h"
#include "whack.h"
#include "fetch.h"
#include "asn1.h"
#include "crypto.h"
#include "secrets.h"
#include "crypt_dh.h"
#include "ike_alg.h"
#include "ike_alg_integ.h"
#include "ike_alg_encrypt.h"
#include "kernel_alg.h"
#include "plutoalg.h"
#include "ikev1.h"
#include "ikev1_continuations.h"
#include "ikev2.h"
#include "ikev2_send.h"
#include "ikev1_xauth.h"
#include "ip_info.h"
#include "vendor.h"
#include "nat_traversal.h"
#include "ikev1_dpd.h"
#include "pluto_x509.h"
#include "ip_address.h"
#include "pluto_stats.h"
#include "chunk.h"
#include "pending.h"
#include "iface.h"
#include "ikev2_delete.h" /* for record_v2_delete(); but call is dying */
void ipsecdoi_initiate(struct fd *whack_sock,
struct connection *c,
lset_t policy,
unsigned long try,
so_serial_t replacing,
const threadtime_t *inception,
chunk_t sec_label)
{
dbg("ipsecdoi_initiate() called with sec_label %.*s", (int)sec_label.len, sec_label.ptr);
/*
* If there's already an IKEv1 ISAKMP SA established, use that and
* go directly to Quick Mode. We are even willing to use one
* that is still being negotiated, but only if we are the Initiator
* (thus we can be sure that the IDs are not going to change;
* other issues around intent might matter).
* Note: there is no way to initiate with a Road Warrior.
*/
struct state *st = find_phase1_state(c,
#ifdef USE_IKEv1
ISAKMP_SA_ESTABLISHED_STATES |
PHASE1_INITIATOR_STATES |
#endif
IKEV2_ISAKMP_INITIATOR_STATES);
switch (c->ike_version) {
#ifdef USE_IKEv1
case IKEv1:
if (st == NULL) {
initiator_function *initiator = (policy & POLICY_AGGRESSIVE) ? aggr_outI1 : main_outI1;
initiator(whack_sock, c, NULL, policy, try, inception, sec_label);
} else if (!IS_ISAKMP_SA_ESTABLISHED(st->st_state)) {
/* leave our Phase 2 negotiation pending */
add_pending(whack_sock, pexpect_ike_sa(st),
c, policy, try,
replacing, sec_label,
false /*part of initiate*/);
} else {
/*
* ??? we assume that peer_nexthop_sin isn't
* important: we already have it from when we
* negotiated the ISAKMP SA! It isn't clear
* what to do with the error return.
*/
quick_outI1(whack_sock, st, c, policy, try,
replacing, sec_label);
}
break;
#endif
case IKEv2:
if (st == NULL) {
/* note: new IKE SA pulls sec_label from connection */
ikev2_parent_outI1(whack_sock, c, NULL, policy, try, inception, empty_chunk);
} else if (!IS_PARENT_SA_ESTABLISHED(st)) {
/* leave CHILD SA negotiation pending */
add_pending(whack_sock, pexpect_ike_sa(st),
c, policy, try,
replacing, sec_label,
false /*part of initiate*/);
} else {
struct pending p = {
.whack_sock = whack_sock, /*on-stack*/
.ike = pexpect_ike_sa(st),
.connection = c,
.try = try,
.policy = policy,
.replacing = replacing,
.sec_label = sec_label,
};
ikev2_initiate_child_sa(&p);
}
break;
default:
bad_case(c->ike_version);
}
}
/* Replace SA with a fresh one that is similar
*
* Shares some logic with ipsecdoi_initiate, but not the same!
* - we must not reuse the ISAKMP SA if we are trying to replace it!
* - if trying to replace IPSEC SA, use ipsecdoi_initiate to build
* ISAKMP SA if needed.
* - duplicate whack fd, if live.
* Does not delete the old state -- someone else will do that.
*/
void ipsecdoi_replace(struct state *st, unsigned long try)
{
/*
* start billing the new state. The old state also gets
* billed for this function call, oops.
*/
threadtime_t inception = threadtime_start();
if (IS_IKE_SA(st)) {
/* start from policy in connection */
struct connection *c = st->st_connection;
lset_t policy = c->policy & ~POLICY_IPSEC_MASK;
if (IS_PARENT_SA_ESTABLISHED(st))
log_state(RC_LOG, st, "initiate reauthentication of IKE SA");
switch(st->st_ike_version) {
case IKEv2:
{
initiator_function *initiator = ikev2_parent_outI1;
initiator(st->st_logger->object_whackfd, c, st, policy, try, &inception, c->spd.this.sec_label);
break;
}
#ifdef USE_IKEv1
case IKEv1:
{
initiator_function *initiator = (policy & POLICY_AGGRESSIVE) ? aggr_outI1 : main_outI1;
initiator(st->st_logger->object_whackfd, c, st, policy, try, &inception, c->spd.this.sec_label);
break;
}
#endif
default:
dbg("unsupported IKE version '%d', cannot initiate", st->st_ike_version);
}
} else {
/*
* Start from policy in (ipsec) state, not connection.
* This ensures that rekeying doesn't downgrade
* security. I admit that this doesn't capture
* everything.
*/
lset_t policy = st->st_policy;
if (st->st_pfs_group != NULL)
policy |= POLICY_PFS;
if (st->st_ah.present) {
policy |= POLICY_AUTHENTICATE;
if (st->st_ah.attrs.mode ==
ENCAPSULATION_MODE_TUNNEL)
policy |= POLICY_TUNNEL;
}
if (st->st_esp.present &&
st->st_esp.attrs.transattrs.ta_encrypt != &ike_alg_encrypt_null) {
policy |= POLICY_ENCRYPT;
if (st->st_esp.attrs.mode ==
ENCAPSULATION_MODE_TUNNEL)
policy |= POLICY_TUNNEL;
}
if (st->st_ipcomp.present) {
policy |= POLICY_COMPRESS;
if (st->st_ipcomp.attrs.mode ==
ENCAPSULATION_MODE_TUNNEL)
policy |= POLICY_TUNNEL;
}
if (st->st_ike_version == IKEv1)
passert(HAS_IPSEC_POLICY(policy));
ipsecdoi_initiate(st->st_logger->object_whackfd, st->st_connection,
policy, try, st->st_serialno, &inception, empty_chunk);
}
}
/*
* look for the existence of a non-expiring preloaded public key
*/
bool has_preloaded_public_key(const struct state *st)
{
const struct connection *c = st->st_connection;
/* do not consider rw connections since
* the peer's identity must be known
*/
if (c->kind == CK_PERMANENT) {
/* look for a matching RSA public key */
for (const struct pubkey_list *p = pluto_pubkeys; p != NULL;
p = p->next) {
const struct pubkey *key = p->key;
if (key->type == &pubkey_type_rsa &&
same_id(&c->spd.that.id, &key->id) &&
is_realtime_epoch(key->until_time)) {
/* found a preloaded public key */
return TRUE;
}
}
}
return FALSE;
}
void initialize_new_state(struct state *st,
lset_t policy,
int try)
{
/*
* reset our choice of interface
*
* XXX: why? suspect this has the side effect of restoring /
* updating connection's ends?
*/
struct connection *c = st->st_connection;
pexpect(oriented(*c));
c->interface = NULL;
(void)orient(c);
st->st_interface = c->interface;
passert(st->st_interface != NULL);
st->st_remote_endpoint = endpoint3(c->interface->protocol,
&c->spd.that.host_addr,
ip_hport(c->spd.that.host_port));
endpoint_buf eb;
dbg("in %s with remote endpoint set to %s",
__func__, str_endpoint(&st->st_remote_endpoint, &eb));
st->st_policy = policy & ~POLICY_IPSEC_MASK; /* clear bits */
st->st_try = try;
for (const struct spd_route *sr = &c->spd;
sr != NULL; sr = sr->spd_next) {
if (sr->this.xauth_client) {
if (sr->this.xauth_username != NULL) {
jam_str(st->st_xauth_username, sizeof(st->st_xauth_username), sr->this.xauth_username);
break;
}
}
}
binlog_refresh_state(st);
}
void lswlog_child_sa_established(struct jambuf *buf, struct state *st)
{
struct connection *const c = st->st_connection;
const char *ini = " {";
jam_string(buf, c->policy & POLICY_TUNNEL ? " tunnel mode" : " transport mode");
if (st->st_esp.present) {
bool nat = (st->hidden_variables.st_nat_traversal & NAT_T_DETECTED) != 0;
bool tfc = c->sa_tfcpad != 0 && !st->st_seen_no_tfc;
bool esn = st->st_esp.attrs.transattrs.esn_enabled;
bool tcp = st->st_interface->protocol == &ip_protocol_tcp;
if (nat)
dbg("NAT-T: NAT Traversal detected - their IKE port is '%d'",
c->spd.that.host_port);
dbg("NAT-T: encaps is '%s'",
c->encaps == yna_auto ? "auto" : bool_str(c->encaps == yna_yes));
jam(buf, "%sESP%s%s%s=>0x%08" PRIx32 " <0x%08" PRIx32 "",
ini,
tcp ? "inTCP" : nat ? "inUDP" : "",
esn ? "/ESN" : "",
tfc ? "/TFC" : "",
ntohl(st->st_esp.attrs.spi),
ntohl(st->st_esp.our_spi));
jam(buf, " xfrm=%s", st->st_esp.attrs.transattrs.ta_encrypt->common.fqn);
/* log keylen when it is required and/or "interesting" */
if (!st->st_esp.attrs.transattrs.ta_encrypt->keylen_omitted ||
(st->st_esp.attrs.transattrs.enckeylen != 0 &&
st->st_esp.attrs.transattrs.enckeylen != st->st_esp.attrs.transattrs.ta_encrypt->keydeflen)) {
jam(buf, "_%u", st->st_esp.attrs.transattrs.enckeylen);
}
jam(buf, "-%s", st->st_esp.attrs.transattrs.ta_integ->common.fqn);
if ((st->st_ike_version == IKEv2) && st->st_pfs_group != NULL) {
jam_string(buf, "-");
jam_string(buf, st->st_pfs_group->common.fqn);
}
ini = " ";
}
if (st->st_ah.present) {
jam(buf, "%sAH%s=>0x%08" PRIx32 " <0x%08" PRIx32 " xfrm=%s",
ini,
st->st_ah.attrs.transattrs.esn_enabled ? "/ESN" : "",
ntohl(st->st_ah.attrs.spi),
ntohl(st->st_ah.our_spi),
st->st_ah.attrs.transattrs.ta_integ->common.fqn);
ini = " ";
}
if (st->st_ipcomp.present) {
jam(buf, "%sIPCOMP=>0x%08" PRIx32 " <0x%08" PRIx32,
ini,
ntohl(st->st_ipcomp.attrs.spi),
ntohl(st->st_ipcomp.our_spi));
ini = " ";
}
jam_string(buf, ini);
jam_string(buf, "NATOA=");
/* XXX: can lswlog_ip() be used? */
ipstr_buf ipb;
jam_string(buf,
(address_is_unset(&st->hidden_variables.st_nat_oa) ||
address_is_any(&st->hidden_variables.st_nat_oa)) ? "none" :
ipstr(&st->hidden_variables.st_nat_oa, &ipb));
jam_string(buf, " NATD=");
if (address_is_unset(&st->hidden_variables.st_natd) ||
address_is_any(&st->hidden_variables.st_natd)) {
jam_string(buf, "none");
} else {
/* XXX: can lswlog_ip() be used? need to check st_remoteport */
char oa[ADDRTOT_BUF + sizeof(":00000")];
snprintf(oa, sizeof(oa),
"%s:%d",
sensitive_ipstr(&st->hidden_variables.st_natd, &ipb),
endpoint_hport(&st->st_remote_endpoint));
jam_string(buf, oa);
}
jam(buf, (st->st_ike_version == IKEv1 && !st->hidden_variables.st_peer_supports_dpd) ? " DPD=unsupported" :
dpd_active_locally(st) ? " DPD=active" : " DPD=passive");
if (st->st_xauth_username[0] != '\0') {
jam_string(buf, " username=");
jam_string(buf, st->st_xauth_username);
}
jam_string(buf, "}");
}
void lswlog_ike_sa_established(struct jambuf *buf, struct state *st)
{
passert(st->st_oakley.ta_encrypt != NULL);
passert(st->st_oakley.ta_prf != NULL);
passert(st->st_oakley.ta_dh != NULL);
jam_string(buf, " {auth=");
if (st->st_ike_version == IKEv2) {
jam(buf, "IKEv2");
} else {
jam_enum_short(buf, &oakley_auth_names, st->st_oakley.auth);
}
jam(buf, " cipher=%s", st->st_oakley.ta_encrypt->common.fqn);
if (st->st_oakley.enckeylen > 0) {
/* XXX: also check omit key? */
jam(buf, "_%d", st->st_oakley.enckeylen);
}
/*
* Note: for IKEv1 and AEAD encrypters,
* st->st_oakley.ta_integ is 'none'!
*/
jam_string(buf, " integ=");
if (st->st_ike_version == IKEv2) {
if (st->st_oakley.ta_integ == &ike_alg_integ_none) {
jam_string(buf, "n/a");
} else {
jam_string(buf, st->st_oakley.ta_integ->common.fqn);
}
} else {
/*
* For IKEv1, since the INTEG algorithm is potentially
* (always?) NULL. Display the PRF. The choice and
* behaviour are historic.
*/
jam_string(buf, st->st_oakley.ta_prf->common.fqn);
}
if (st->st_ike_version == IKEv2) {
jam(buf, " prf=%s", st->st_oakley.ta_prf->common.fqn);
}
jam(buf, " group=%s}", st->st_oakley.ta_dh->common.fqn);
}
|