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 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301
|
/* IPsec IKEv1 DOI Quick Mode functions.
*
* Copyright (C) 1997 Angelos D. Keromytis.
* Copyright (C) 1998-2002 D. Hugh Redelmeier.
* Copyright (C) 2003-2008 Michael Richardson <mcr@xelerance.com>
* Copyright (C) 2003-2009 Paul Wouters <paul@xelerance.com>
* Copyright (C) 2009 Avesh Agarwal <avagarwa@redhat.com>
* Copyright (C) 2012-2013 Paul Wouters <paul@libreswan.org>
* Copyright (C) 2013-2019 D. Hugh Redelmeier <hugh@mimosa.com>
* Copyright (C) 2013-2019 Andrew Cagney <cagney@gnu.org>
* Copyright (C) 2019 Paul Wouters <pwouters@redhat.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 "ikev1_msgid.h"
#include "id.h"
#include "x509.h"
#include "certs.h"
#include "connections.h" /* needs id.h */
#include "keys.h"
#include "packet.h"
#include "demux.h" /* needs packet.h */
#include "kernel.h" /* needs connections.h */
#include "log.h"
#include "server.h"
#include "ikev1_spdb.h"
#include "timer.h"
#include "rnd.h"
#include "ipsec_doi.h" /* needs demux.h and state.h */
#include "whack.h"
#include "fetch.h"
#include "asn1.h"
#include "ikev1_send.h"
#include "crypto.h"
#include "secrets.h"
#include "ikev1_prf.h"
#include "ike_alg.h"
#include "kernel_alg.h"
#include "plutoalg.h"
#include "crypt_symkey.h"
#include "crypt_prf.h"
#include "ikev1.h"
#include "ikev1_quick.h"
#include "ikev1_continuations.h"
#include "ikev1_xauth.h"
#include "nat_traversal.h"
#include "ikev1_nat.h"
#include "virtual_ip.h"
#include "ikev1_dpd.h"
#include "pluto_x509.h"
#include "ip_address.h"
#include "ip_info.h"
#include "ip_protocol.h"
#include "ip_selector.h"
#include "ikev1_hash.h"
#include "ikev1_message.h"
#include "crypt_ke.h"
#include <blapit.h>
#include "crypt_dh.h"
#include "unpack.h"
#include "orient.h"
#include "instantiate.h"
#include "terminate.h"
#include "addresspool.h"
#include "ipsec_interface.h"
#include "verbose.h"
#include "peer_id.h"
#include "whack_connectionstatus.h" /* for jam_spd_ends() */
struct connection *find_v1_client_connection(struct connection *c,
const ip_selector *local_client,
const ip_selector *remote_client,
struct verbose verbose);
static stf_status quick_outI1_continue_tail(struct ike_sa *ike,
struct child_sa *child,
struct dh_local_secret *local_secret,
chunk_t *nonce);
static stf_status quick_inI1_outR1_continue_tail(struct ike_sa *ike,
struct child_sa *child,
struct msg_digest *md);
stf_status quick_inR1_outI2_continue_tail(struct ike_sa *ike,
struct child_sa *child,
struct msg_digest *md);
static dh_shared_secret_cb quick_inR1_outI2_continue; /* forward decl and type assertion */
static ke_and_nonce_cb quick_inI1_outR1_continue1; /* forward decl and type assertion */
static dh_shared_secret_cb quick_inI1_outR1_continue2; /* forward decl and type assertion */
static ke_and_nonce_cb quick_outI1_continue; /* type assertion */
static void update_quick_iv(struct child_sa *child,
struct crypt_mac iv,
where_t where)
{
LDBGP_JAMBUF(DBG_BASE, child->sa.logger, buf) {
jam_string(buf, "updating Quick Mode Child IV .st_v1_phase_2_iv from ");
jam_hex_hunk(buf, child->sa.st_v1_phase_2_iv);
jam_string(buf, " to ");
jam_hex_hunk(buf, iv);
jam_string(buf, " ");
jam_where(buf, where);
}
PEXPECT(child->sa.logger, iv.len > 0);
child->sa.st_v1_phase_2_iv = iv;
}
const struct dh_desc *ikev1_quick_pfs(const struct child_proposals proposals)
{
if (proposals.p == NULL) {
return NULL;
}
struct proposal *proposal = next_proposal(proposals.p, NULL);
struct algorithm *dh = next_algorithm(proposal, PROPOSAL_dh, NULL);
if (dh == NULL) {
return NULL;
}
return dh_desc(dh->desc);
}
/* accept_PFS_KE
*
* Check and accept optional Quick Mode KE payload for PFS.
* Extends ACCEPT_PFS to check whether KE is allowed or required.
*/
static v1_notification_t accept_PFS_KE(struct child_sa *child, struct msg_digest *md,
chunk_t *dest, const char *val_name,
const char *msg_name)
{
struct payload_digest *const ke_pd = md->chain[ISAKMP_NEXT_KE];
if (ke_pd == NULL) {
if (child->sa.st_pfs_group != NULL) {
llog(RC_LOG, child->sa.logger,
"missing KE payload in %s message", msg_name);
return v1N_INVALID_KEY_INFORMATION;
}
return v1N_NOTHING_WRONG;
} else {
if (child->sa.st_pfs_group == NULL) {
llog(RC_LOG, child->sa.logger,
"%s message KE payload requires a GROUP_DESCRIPTION attribute in SA",
msg_name);
return v1N_INVALID_KEY_INFORMATION;
}
if (ke_pd->next != NULL) {
llog(RC_LOG, child->sa.logger,
"%s message contains several KE payloads; we accept at most one",
msg_name);
return v1N_INVALID_KEY_INFORMATION; /* ??? */
}
if (!unpack_KE(dest, val_name, child->sa.st_pfs_group,
ke_pd, child->sa.logger)) {
return v1N_INVALID_KEY_INFORMATION;
}
return v1N_NOTHING_WRONG;
}
}
/* Initiate quick mode.
* --> HDR*, HASH(1), SA, Nr [, KE ] [, IDci, IDcr ]
* (see RFC 2409 "IKE" 5.5)
* Note: this is not called from demux.c
*/
static bool emit_subnet_id(enum perspective perspective,
const ip_subnet net,
uint8_t protoid,
uint16_t port,
struct pbs_out *outs)
{
const struct ip_info *ai = subnet_info(net);
const bool usehost = (subnet_prefix_bits(net) == ai->mask_cnt);
struct pbs_out id_pbs;
enum ike_id_type idtype =
(perspective == REMOTE_PERSPECTIVE && impair.v1_remote_quick_id.enabled ? (int)impair.v1_remote_quick_id.value :
usehost ? ai->id_ip_addr :
ai->id_ip_addr_subnet);
struct isakmp_ipsec_id id = {
.isaiid_idtype = idtype,
.isaiid_protoid = protoid,
.isaiid_port = port,
};
if (!out_struct(&id, &isakmp_ipsec_identification_desc, outs, &id_pbs))
return false;
ip_address tp = subnet_prefix(net);
if (!pbs_out_address(&id_pbs, tp, "client network")) {
/* already logged */
return false;
}
if (!usehost) {
ip_address tm = subnet_prefix_mask(net);
if (!pbs_out_address(&id_pbs, tm, "client mask")) {
/* already logged */
return false;
}
}
close_output_pbs(&id_pbs);
return true;
}
/*
* Produce the new key material of Quick Mode.
* RFC 2409 "IKE" section 5.5
* specifies how this is to be done.
*/
static bool compute_proto_keymat(struct ike_sa *ike,
struct child_sa *child,
uint8_t protoid,
struct ipsec_proto_info *pi,
const char *satypename)
{
size_t needed_len = 0; /* bytes of keying material needed */
/*
* Add up the requirements for keying material (It probably
* doesn't matter if we produce too much!)
*
* XXX: This entire switch can probably be reduced to just the
* "default:" case.
*/
switch (protoid) {
case PROTO_IPSEC_ESP:
{
/*
* If there is encryption, then ENCKEYLEN contains the
* required number of bits.
*/
size_t encrypt_key_size = BYTES_FOR_BITS(pi->trans_attrs.enckeylen);
/*
* Finally, some encryption algorithms such as AEAD
* and CTR require "salt" as part of the "starting
* variable".
*/
const struct encrypt_desc *encrypt = pi->trans_attrs.ta_encrypt;
size_t encrypt_salt_size = (encrypt != NULL ? encrypt->salt_size : 0);
needed_len = encrypt_key_size + encrypt_salt_size;
ldbg(child->sa.logger, "compute_proto_keymat: encrypt_key_size %zd encrypt_salt_size %zd needed_len=%zd",
encrypt_key_size, encrypt_salt_size, encrypt_salt_size);
needed_len += pi->trans_attrs.ta_integ->integ_keymat_size;
dbg("compute_proto_keymat: needed_len (after ESP auth)=%d", (int)needed_len);
break;
}
case PROTO_IPSEC_AH:
needed_len += pi->trans_attrs.ta_integ->integ_keymat_size;
break;
default:
bad_case(protoid);
}
free_chunk_content(&pi->inbound.keymat);
pi->inbound.keymat = ikev1_section_5_keymat(child->sa.st_oakley.ta_prf,
ike->sa.st_v1_isakmp_skeyid_d,
child->sa.st_dh_shared_secret,
protoid,
THING_AS_SHUNK(pi->inbound.spi),
child->sa.st_ni, child->sa.st_nr,
needed_len,
child->sa.logger);
PASSERT(child->sa.logger, pi->inbound.keymat.len == needed_len);
free_chunk_content(&pi->outbound.keymat);
pi->outbound.keymat = ikev1_section_5_keymat(child->sa.st_oakley.ta_prf,
ike->sa.st_v1_isakmp_skeyid_d,
child->sa.st_dh_shared_secret,
protoid,
THING_AS_SHUNK(pi->outbound.spi),
child->sa.st_ni, child->sa.st_nr,
needed_len,
child->sa.logger);
PASSERT(child->sa.logger, pi->outbound.keymat.len == needed_len);
if (DBGP(DBG_CRYPT)) {
DBG_log("%s KEYMAT", satypename);
DBG_dump_hunk(" inbound:", pi->inbound.keymat);
DBG_dump_hunk(" outbound:", pi->outbound.keymat);
}
return true;
}
static bool compute_keymats(struct ike_sa *ike, struct child_sa *child)
{
if (child->sa.st_ah.protocol == &ip_protocol_ah)
return compute_proto_keymat(ike, child, PROTO_IPSEC_AH,
&child->sa.st_ah, "AH");
if (child->sa.st_esp.protocol == &ip_protocol_esp)
return compute_proto_keymat(ike, child, PROTO_IPSEC_ESP,
&child->sa.st_esp, "ESP");
return false;
}
/*
* Decode the variable part of an ID packet (during Quick Mode).
*
* This is designed for packets that identify clients, not peers.
* Rejects 0.0.0.0/32 or IPv6 equivalent because (1) it is wrong and
* (2) we use this value for inband signalling.
*/
static bool decode_net_id(struct isakmp_ipsec_id *id,
struct pbs_in *id_pbs,
ip_selector *client,
const char *which,
struct logger *logger)
{
*client = unset_selector;
const struct ip_info *afi = NULL;
/* IDB and IDTYPENAME must have same scope. */
enum ike_id_type id_type = id->isaiid_idtype;
esb_buf idb;
const char *idtypename = str_enum(&ike_id_type_names, id_type, &idb);
switch (id_type) {
case ID_IPV4_ADDR:
case ID_IPV4_ADDR_SUBNET:
case ID_IPV4_ADDR_RANGE:
afi = &ipv4_info;
break;
case ID_IPV6_ADDR:
case ID_IPV6_ADDR_SUBNET:
case ID_IPV6_ADDR_RANGE:
afi = &ipv6_info;
break;
case ID_FQDN:
llog(RC_LOG, logger, "%s type is FQDN", which);
return true;
default:
/* XXX support more */
llog(RC_LOG, logger, "unsupported ID type %s",
idtypename);
/* XXX Could send notification back */
return false;
}
ip_subnet net;
switch (id_type) {
case ID_IPV4_ADDR:
case ID_IPV6_ADDR:
{
ip_address temp_address;
diag_t d = pbs_in_address(id_pbs, &temp_address, afi, "ID address");
if (d != NULL) {
llog(RC_LOG, logger, "%s", str_diag(d));
pfree_diag(&d);
return false;
}
/* i.e., "zero" */
if (!address_is_specified(temp_address)) {
address_buf b;
llog(RC_LOG, logger,
"%s ID payload %s is invalid (%s) in Quick I1",
which, idtypename, str_address(&temp_address, &b));
/* XXX Could send notification back */
return false;
}
net = subnet_from_address(temp_address);
subnet_buf b;
dbg("%s is %s", which, str_subnet(&net, &b));
break;
}
case ID_IPV4_ADDR_SUBNET:
case ID_IPV6_ADDR_SUBNET:
{
diag_t d;
ip_address temp_address;
d = pbs_in_address(id_pbs, &temp_address, afi, "ID address");
if (d != NULL) {
llog(RC_LOG, logger, "%s", str_diag(d));
pfree_diag(&d);
return false;
}
ip_address temp_mask;
d = pbs_in_address(id_pbs, &temp_mask, afi, "ID mask");
if (d != NULL) {
llog(RC_LOG, logger, "%s", str_diag(d));
pfree_diag(&d);
return false;
}
err_t ughmsg = address_mask_to_subnet(temp_address, temp_mask, &net);
if (ughmsg == NULL && subnet_is_zero(net)) {
/* i.e., ::/128 or 0.0.0.0/32 */
ughmsg = "subnet contains no addresses";
}
if (ughmsg != NULL) {
llog(RC_LOG, logger,
"%s ID payload %s bad subnet in Quick I1 (%s)",
which, idtypename, ughmsg);
/* XXX Could send notification back */
return false;
}
subnet_buf buf;
dbg("%s is subnet %s", which, str_subnet(&net, &buf));
break;
}
case ID_IPV4_ADDR_RANGE:
case ID_IPV6_ADDR_RANGE:
{
diag_t d;
ip_address temp_address_from;
d = pbs_in_address(id_pbs, &temp_address_from, afi, "ID from address");
if (d != NULL) {
llog(RC_LOG, logger, "%s", str_diag(d));
pfree_diag(&d);
return false;
}
ip_address temp_address_to;
d = pbs_in_address(id_pbs, &temp_address_to, afi, "ID to address");
if (d != NULL) {
llog(RC_LOG, logger, "%s", str_diag(d));
pfree_diag(&d);
return false;
}
err_t ughmsg = addresses_to_nonzero_subnet(temp_address_from,
temp_address_to, &net);
if (ughmsg != NULL) {
address_buf a, b;
llog(RC_LOG, logger,
"%s ID payload in Quick I1, %s %s - %s unacceptable: %s",
which, idtypename,
str_address_sensitive(&temp_address_from, &a),
str_address_sensitive(&temp_address_to, &b),
ughmsg);
return false;
}
subnet_buf buf;
dbg("%s is subnet %s (received as range)", which, str_subnet(&net, &buf));
break;
}
default:
/* first case rejected all others */
bad_case(id_type);
}
const struct ip_protocol *protocol = protocol_from_ipproto(id->isaiid_protoid);
if (!pexpect(protocol != NULL)) {
/* things would need to be pretty screwed up */
return false;
}
ip_port port = ip_hport(id->isaiid_port);
*client = selector_from_subnet_protocol_port(net, protocol, port);
return true;
}
/*
* Like decode, but checks that what is received matches what was
* sent.
*/
static bool check_net_id(struct isakmp_ipsec_id *id,
struct pbs_in *id_pbs,
uint8_t protoid,
uint16_t port,
ip_subnet net,
const char *which,
struct logger *logger)
{
bool bad_proposal = false;
ip_selector selector_temp;
if (!decode_net_id(id, id_pbs, &selector_temp, which, logger))
return false;
/* toss the proto/port */
ip_subnet subnet_temp = selector_subnet(selector_temp);
if (!subnet_eq_subnet(net, subnet_temp)) {
subnet_buf subrec;
subnet_buf subxmt;
llog(RC_LOG, logger,
"%s subnet returned doesn't match my proposal - us: %s vs them: %s",
which, str_subnet(&net, &subxmt),
str_subnet(&subnet_temp, &subrec));
llog(RC_LOG, logger,
"Allowing questionable (microsoft) proposal anyway");
bad_proposal = false;
}
if (protoid != id->isaiid_protoid) {
llog(RC_LOG, logger,
"%s peer returned protocol id does not match my proposal - us: %d vs them: %d",
which, protoid, id->isaiid_protoid);
llog(RC_LOG, logger,
"Allowing questionable (microsoft) proposal anyway]");
bad_proposal = false;
}
/*
* workaround for #802- "our client ID returned doesn't match my proposal"
* until such time as bug #849 is properly fixed.
*/
if (port != id->isaiid_port) {
llog(RC_LOG, logger,
"%s peer returned port doesn't match my proposal - us: %d vs them: %d",
which, port, id->isaiid_port);
if (port != 0 && id->isaiid_port != 1701) {
llog(RC_LOG, logger,
"Allowing bad L2TP/IPsec proposal (see bug #849) anyway");
bad_proposal = false;
} else {
bad_proposal = true;
}
}
return !bad_proposal;
}
static bool child_has_client(struct ike_sa *ike, struct child_sa *child)
{
struct connection *c = child->sa.st_connection;
#define HAS_CLIENT(P) \
if (P) { \
pdbg(child->sa.logger, "has_client: " #P); \
return true; \
}
HAS_CLIENT(c->local->child.has_client);
HAS_CLIENT(c->remote->child.has_client);
HAS_CLIENT(c->spd->local->client.ipproto != 0);
HAS_CLIENT(c->spd->remote->client.ipproto != 0);
HAS_CLIENT(c->spd->local->client.hport != 0);
HAS_CLIENT(c->spd->remote->client.hport != 0);
HAS_CLIENT(nat_traversal_detected(&ike->sa) && ike->sa.hidden_variables.st_nated_host);
#undef HAS_CLIENT
pdbg(child->sa.logger, "has_client: no!");
return false;
}
struct child_sa *quick_outI1(struct ike_sa *ike,
struct connection *c,
const struct child_policy *policy,
so_serial_t replacing)
{
passert(c != NULL);
struct child_sa *child = new_v1_child_sa(c, ike, SA_INITIATOR);
child->sa.st_policy = (*policy);
child->sa.st_v1_msgid.id = generate_msgid(&ike->sa);
change_v1_state(&child->sa, STATE_QUICK_I1); /* from STATE_UNDEFINED */
binlog_refresh_state(&child->sa);
/* figure out PFS group, if any */
if (child->sa.st_connection->config->child_sa.pfs) {
/*
* See if pfs_group has been specified for this conn,
* use that group.
* if not, fallback to old use-same-as-P1 behaviour
*/
child->sa.st_pfs_group = ikev1_quick_pfs(c->config->child_sa.proposals);
/* otherwise, use the same group as during Phase 1:
* since no negotiation is possible, we pick one that is
* very likely supported.
*/
if (child->sa.st_pfs_group == NULL)
child->sa.st_pfs_group = ike->sa.st_oakley.ta_dh;
}
LLOG_JAMBUF(RC_LOG, child->sa.logger, buf) {
jam(buf, "initiating Quick Mode ");
jam_connection_policies(buf, child->sa.st_connection);
if (replacing != SOS_NOBODY) {
jam(buf, " to replace #%lu", replacing);
}
jam(buf, " {using isakmp"PRI_SO" msgid:%08" PRIx32 " proposal=",
pri_so(ike->sa.st_serialno), child->sa.st_v1_msgid.id);
if (child->sa.st_connection->config->child_sa.proposals.p != NULL) {
jam_proposals(buf, child->sa.st_connection->config->child_sa.proposals.p);
} else {
jam(buf, "defaults");
}
jam(buf, " pfsgroup=");
if (child->sa.st_pfs_group != NULL) {
jam_string(buf, child->sa.st_pfs_group->common.fqn);
} else {
jam_string(buf, "no-pfs");
}
if (child_has_client(ike, child)) {
jam_string(buf, " ");
jam_selector_pair(buf, &c->spd->local->client, &c->spd->remote->client);
}
jam(buf, "}");
}
/* save for post crypto logging */
child->sa.st_v1_ipsec_pred = replacing;
submit_ke_and_nonce(/*callback*/&child->sa,
/*task*/&child->sa,
/*no-md*/NULL,
child->sa.st_pfs_group/*could-be-null*/,
quick_outI1_continue,
/*detach_whack*/false, HERE);
return child;
}
static stf_status quick_outI1_continue(struct state *child_sa,
struct msg_digest *unused_md,
struct dh_local_secret *local_secret,
chunk_t *nonce)
{
pexpect(unused_md == NULL); /* no packet */
struct child_sa *child = pexpect_child_sa(child_sa);
if (pbad(child == NULL)) {
return STF_INTERNAL_ERROR;
}
struct ike_sa *ike = isakmp_sa_where(child, HERE);
if (ike == NULL) {
/* phase1 state got deleted while cryptohelper was working */
llog(RC_LOG, child->sa.logger,
"%s() failed because parent ISAKMP "PRI_SO" is gone",
__func__, pri_so(child->sa.st_clonedfrom));
return STF_FATAL;
}
ldbg(child->sa.logger, "%s() for "PRI_SO": calculated ke+nonce, sending I1",
__func__, pri_so(child->sa.st_serialno));
/*
* XXX: Read and weep:
*
* - when the tail function fails, ST is leaked
*
* - there is no QUICK I0->I1 state transition
*
* - compilete_v1_state_transition() isn't called
*
* - trying to call compilete_v1_state_transition() digs a
* hole - as it assumes md (perhaps this is why the function
* wasn't called)
*/
stf_status e = quick_outI1_continue_tail(ike, child, local_secret, nonce);
if (e == STF_INTERNAL_ERROR) {
llog(RC_LOG, child->sa.logger,
"%s(): %s_tail() failed with STF_INTERNAL_ERROR",
__func__, __func__);
}
/*
* This way all the broken behaviour is ignored.
*/
return STF_SKIP_COMPLETE_STATE_TRANSITION;
}
static stf_status quick_outI1_continue_tail(struct ike_sa *ike,
struct child_sa *child,
struct dh_local_secret *local_secret,
chunk_t *nonce)
{
ldbg(child->sa.logger,
"%s() for "PRI_SO": calculated ke+nonce, sending I1",
__func__, pri_so(child->sa.st_serialno));
struct connection *c = child->sa.st_connection;
struct pbs_out rbody;
bool has_client = child_has_client(ike, child);
if (nat_traversal_detected(&ike->sa)) {
/* Duplicate nat_traversal status in new state */
child->sa.hidden_variables.st_nat_traversal =
ike->sa.hidden_variables.st_nat_traversal;
v1_maybe_natify_initiator_endpoints(&child->sa, HERE);
} else {
child->sa.hidden_variables.st_nat_traversal = LEMPTY;
}
/* set up reply */
reply_stream = open_pbs_out("reply packet",reply_buffer, sizeof(reply_buffer), child->sa.logger);
/* HDR* out */
{
struct isakmp_hdr hdr = {
.isa_version = ISAKMP_MAJOR_VERSION << ISA_MAJ_SHIFT |
ISAKMP_MINOR_VERSION,
.isa_xchg = ISAKMP_XCHG_QUICK,
.isa_msgid = child->sa.st_v1_msgid.id,
.isa_flags = ISAKMP_FLAGS_v1_ENCRYPTION,
};
hdr.isa_ike_initiator_spi = child->sa.st_ike_spis.initiator;
hdr.isa_ike_responder_spi = child->sa.st_ike_spis.responder;
if (!out_struct(&hdr, &isakmp_hdr_desc, &reply_stream,
&rbody)) {
return STF_INTERNAL_ERROR;
}
}
/* HASH(1) -- create and note space to be filled later */
struct v1_hash_fixup hash_fixup;
if (!emit_v1_HASH(V1_HASH_1, "outI1",
IMPAIR_v1_QUICK_EXCHANGE,
&child->sa, &hash_fixup, &rbody)) {
return STF_INTERNAL_ERROR;
}
/* SA out */
/*
* Emit SA payload based on a subset of the policy bits.
* POLICY_COMPRESS is considered iff we can do IPcomp.
*/
{
struct ipsec_db_policy pm = {
.encrypt = (child->sa.st_connection->config->child_sa.encap_proto == ENCAP_PROTO_ESP),
.authenticate = (child->sa.st_connection->config->child_sa.encap_proto == ENCAP_PROTO_AH),
.compress = child->sa.st_policy.compress,
};
ldbg(child->sa.logger,
"emitting quick defaults using policy:%s%s%s",
(pm.encrypt ? " encrypt" : ""),
(pm.authenticate ? " authenticate" : ""),
(pm.compress ? " compress" : ""));
if (!ikev1_out_quick_sa(&rbody, child)) {
return STF_INTERNAL_ERROR;
}
}
{
/* Ni out */
if (!ikev1_ship_nonce(&child->sa.st_ni, nonce, &rbody, "Ni")) {
return STF_INTERNAL_ERROR;
}
}
/* [ KE ] out (for PFS) */
if (child->sa.st_pfs_group != NULL) {
if (!ikev1_ship_KE(&child->sa, local_secret, &child->sa.st_gi, &rbody)) {
return STF_INTERNAL_ERROR;
}
}
/* [ IDci, IDcr ] out */
if (has_client) {
/* IDci (we are initiator) followed by ... */
if (impair.v1_emit_quick_id.enabled &&
impair.v1_emit_quick_id.value < 1) {
llog(RC_LOG, child->sa.logger, "IMPAIR: skipping Quick Mode client initiator ID (IDci)");
} else {
if (!emit_subnet_id(LOCAL_PERSPECTIVE,
selector_subnet(c->spd->local->client),
c->spd->local->client.ipproto,
c->spd->local->client.hport, &rbody)) {
return STF_INTERNAL_ERROR;
}
}
/* ... IDcr (peer is responder) */
if (impair.v1_emit_quick_id.enabled &&
impair.v1_emit_quick_id.value < 2) {
llog(RC_LOG, child->sa.logger, "IMPAIR: skipping Quick Mode client responder ID (IDcr)");
} else {
if (!emit_subnet_id(REMOTE_PERSPECTIVE,
selector_subnet(c->spd->remote->client),
c->spd->remote->client.ipproto,
c->spd->remote->client.hport, &rbody)) {
return STF_INTERNAL_ERROR;
}
}
/* bonus? */
if (impair.v1_emit_quick_id.enabled &&
impair.v1_emit_quick_id.value > 2) {
llog(RC_LOG, child->sa.logger, "IMPAIR: adding bonus Quick Mode client ID");
if (!emit_subnet_id(LOCAL_PERSPECTIVE,
selector_subnet(c->spd->local->client),
c->spd->local->client.ipproto,
c->spd->local->client.hport, &rbody)) {
return STF_INTERNAL_ERROR;
}
}
}
if (c->config->child_sa.encap_mode == ENCAP_MODE_TRANSPORT &&
(child->sa.hidden_variables.st_nat_traversal & NAT_T_WITH_NATOA) &&
child->sa.hidden_variables.st_nated_host) {
/** Send NAT-OA if our address is NATed */
if (!v1_nat_traversal_add_initiator_natoa(&rbody, &child->sa)) {
return STF_INTERNAL_ERROR;
}
}
/* finish computing HASH(1), inserting it in output */
fixup_v1_HASH(&child->sa, &hash_fixup, child->sa.st_v1_msgid.id, rbody.cur);
/*
* Quick Mode uses its own IV generated from Phase1+MSGID.
*/
PEXPECT(child->sa.logger, child->sa.st_v1_phase_2_iv.len == 0);
/* MD->v1_decrypt_iv N/A as initiating */
/* uses ike->sa.st_v1_phase_1_iv */
update_quick_iv(child, new_phase2_iv(ike, child->sa.st_v1_msgid.id,
"IKE sending quick message", HERE),
HERE);
/* Save updated IV ready for response. */
if (!close_and_encrypt_v1_message(ike, &rbody, &child->sa.st_v1_phase_2_iv)) {
return STF_INTERNAL_ERROR;
}
record_and_send_v1_ike_msg(&child->sa, &reply_stream,
"reply packet from quick_outI1");
delete_v1_event(&child->sa);
clear_retransmits(&child->sa);
start_retransmits(&child->sa);
if (child->sa.st_v1_ipsec_pred == SOS_NOBODY) {
llog(RC_LOG, child->sa.logger,
"%s", child->sa.st_state->story);
} else {
llog(RC_LOG, child->sa.logger, "%s, to replace #%lu",
child->sa.st_state->story,
child->sa.st_v1_ipsec_pred);
child->sa.st_v1_ipsec_pred = SOS_NOBODY;
}
return STF_OK;
}
/* Handle first message of Phase 2 -- Quick Mode.
* HDR*, HASH(1), SA, Ni [, KE ] [, IDci, IDcr ] -->
* HDR*, HASH(2), SA, Nr [, KE ] [, IDci, IDcr ]
* (see RFC 2409 "IKE" 5.5)
* Installs inbound IPsec SAs.
* Although this seems early, we know enough to do so, and
* this way we know that it is soon enough to catch all
* packets that other side could send using this IPsec SA.
*
* Broken into parts to allow asynchronous DNS for TXT records:
*
* - quick_inI1_outR1 starts the ball rolling.
* It checks and parses enough to learn the Phase 2 IDs
*
* - quick_inI1_outR1_tail does the rest of the job
* XXX: why the function split?
*
* At the end of quick_inI1_outR1_tail, we have all the info we need, but we
* haven't done any nonce generation or DH that we might need
* to do, so that are two crypto continuations that do this work,
* they are:
* quick_inI1_outR1_continue1 -- called after NONCE/KE
* quick_inI1_outR1_continue2 -- called after DH (if PFS)
*
* we have to call nonce/ke and DH if we are doing PFS.
*/
stf_status quick_inI1_outR1(struct state *ike_sa, struct msg_digest *md)
{
VERBOSE_DBGP(DBG_BASE, ike_sa->logger,
"in %s() with "PRI_SO, __func__, pri_so(ike_sa->st_serialno));
vassert(ike_sa == md->v1_st);
struct ike_sa *ike = pexpect_parent_sa(ike_sa);
struct connection *c = ike->sa.st_connection; /* parent, tentative */
/*
* 5.5 Phase 2 - Quick Mode
*
* The identities of the SAs negotiated in Quick Mode are
* implicitly assumed to be the IP addresses of the ISAKMP
* peers, without any implied constraints on the protocol or
* port numbers allowed, unless client identifiers are
* specified in Quick Mode. If ISAKMP is acting as a client
* negotiator on behalf of another party, the identities of
* the parties MUST be passed as IDci and then IDcr. Local
* policy will dictate whether the proposals are acceptable
* for the identities specified. If the client identities are
* not acceptable to the Quick Mode responder (due to policy
* or other reasons), a Notify payload with Notify Message
* Type INVALID-ID-INFORMATION (18) SHOULD be sent.
*
* Hence parse [ IDci, IDcr ] in
*
* We do this now (probably out of physical order) because we
* wish to select the correct connection before we consult it
* for policy.
*/
ip_selector local_client; /* must-be-determined */
ip_selector remote_client; /* must-be-determined */
struct payload_digest *const IDci = md->chain[ISAKMP_NEXT_ID];
if (IDci != NULL) {
struct payload_digest *IDcr = IDci->next;
PASSERT(ike->sa.logger, IDcr != NULL); /* checked in ikev1.c */
/* ??? we are assuming IPSEC_DOI */
/* IDci (initiator is remote peer) */
if (!decode_net_id(&IDci->payload.ipsec_id, &IDci->pbs,
&remote_client, "peer client", ike->sa.logger))
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
/* for code overwriting above */
const struct ip_protocol *remote_protocol = protocol_from_ipproto(IDci->payload.ipsec_id.isaiid_protoid);
ip_port remote_port = ip_hport(IDci->payload.ipsec_id.isaiid_port);
/* Hack for MS 818043 NAT-T Update.
*
* <http://support.microsoft.com/kb/818043>
* "L2TP/IPsec NAT-T update for Windows XP and Windows
* 2000" This update is has a bug. We choose to work
* around that bug rather than failing to
* interoperate. As to what the bug is, Paul says: "I
* believe on rekey, it sent a bogus subnet or wrong
* type of ID." ??? needs more complete description.
*/
if (IDci->payload.ipsec_id.isaiid_idtype == ID_FQDN) {
llog(RC_LOG, ike->sa.logger,
"applying workaround for MS-818043 NAT-T bug");
remote_client = selector_from_address_protocol_port(c->remote->host.addr,
remote_protocol,
remote_port);
}
/* End Hack for MS 818043 NAT-T Update */
/* IDcr (we are local responder) */
if (!decode_net_id(&IDcr->payload.ipsec_id, &IDcr->pbs,
&local_client, "our client", ike->sa.logger))
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
/*
* if there is a NATOA payload, then use it as
* &st->st_connection->spd->remote->client, if the type
* of the ID was FQDN
*
* We actually do NATOA calculation again later on,
* but we need the info here, and we don't have a
* state to store it in until after we've done the
* authorization steps.
*/
if (nat_traversal_detected(&ike->sa) &&
(ike->sa.hidden_variables.st_nat_traversal & NAT_T_WITH_NATOA) &&
(IDci->payload.ipsec_id.isaiid_idtype == ID_FQDN)) {
struct hidden_variables hv;
shunk_t idfqdn = pbs_in_left(&IDcr->pbs);
hv = ike->sa.hidden_variables;
nat_traversal_natoa_lookup(md, &hv, ike->sa.logger);
if (address_is_specified(hv.st_nat_oa)) {
remote_client = selector_from_address_protocol_port(hv.st_nat_oa,
remote_protocol,
remote_port);
LLOG_JAMBUF(RC_LOG, ike->sa.logger, buf) {
jam(buf, "IDci was FQDN: ");
jam_sanitized_hunk(buf, idfqdn);
jam(buf, ", using NAT_OA=");
jam_selector_range_port(buf, &remote_client);
jam(buf, " as IDci");
}
}
}
} else {
/*
* Implicit IDci and IDcr: peer and self.
*/
if (address_info(c->local->host.addr) != address_info(c->remote->host.addr))
return STF_FAIL_v1N;
local_client = selector_from_address(c->local->host.addr);
remote_client = selector_from_address(c->remote->host.addr);
}
struct hidden_variables hv;
/*
* Note: the peer's IDr is our LOCAL_CLIENT, and the peer's
* IDi is our REMOTE_CLIENT.
*/
selector_pair_buf sb;
llog(RC_LOG, ike->sa.logger, "the peer proposed: %s",
str_selector_pair(&local_client, &remote_client, &sb));
/*
* Now that we have identities of client subnets, we must look
* for a suitable connection (the IKE SA's connection only
* matches for hosts and IDs).
*/
struct connection *p = find_v1_client_connection(ike->sa.st_connection,
&local_client, &remote_client,
verbose);
/*
* For instance: ikev1-l2tp-02 and ikev1-nat-transport-02.
*/
if (p == NULL &&
c->config->child_sa.encap_mode == ENCAP_MODE_TRANSPORT &&
nat_traversal_detected(&ike->sa)) {
p = c;
vdbg("using existing connection; nothing better and current is NAT'ed and transport mode");
}
/*
* For instance: nat-pluto-04.
*
* Note that, as demonstrated by nat-pluto-04, virtual-private
* is not IFF transport-mode.
*/
if (p == NULL &&
/* c->config->child_sa.encap_mode == ENCAP_MODE_TRANSPORT && */
is_virtual_remote(c, verbose)) {
p = c;
vdbg("using existing connection; nothing better and current is virtual-private");
}
if (p == NULL) {
LLOG_JAMBUF(RC_LOG, ike->sa.logger, buf) {
jam(buf, "cannot respond to IPsec SA request because no connection is known for ");
/*
* This message occurs in very puzzling
* circumstances so we must add as much
* information and beauty as we can.
*/
struct spd_end local = *c->spd->local;
struct spd_end remote = *c->spd->remote;
local.client = local_client;
remote.client = remote_client;
jam_spd_ends(buf, c, &local, "...", &remote);
}
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
}
/*
* Switch C to the better connection P. If necessary,
* instantiate.
*
* Note:
*
* All code paths give this function a local reference to C.
* That reference will need to be delref'd before returning.
* Code then, effectively transfers it to the child (using
* addref/delref juggling).
*/
if (p == c) {
connection_buf cib;
vdbg("sticking with existing "PRI_CONNECTION"", pri_connection(p, &cib));
c = connection_addref(p, c->logger); /* must delref */
} else if (is_permanent(p)) {
connection_buf cib;
vdbg("switching to permanent "PRI_CONNECTION"", pri_connection(p, &cib));
c = connection_addref(p, p->logger); /* must delref */
} else if (is_instance(p)) {
connection_buf cib;
vdbg("switching to instance "PRI_CONNECTION"", pri_connection(p, &cib));
c = connection_addref(p, p->logger); /* must delref */
} else if (is_template(p)) {
/*
* Plain Road Warrior because no OPPO for IKEv1.
*
* Instantiate will carry over authenticated peer ID.
* Don't try to update the instantiated template's
* address when it is already set.
*
* Note: fc_try() should have checked that the peer's
* local/remote client fall within this connection
* template (but is this true when it's an address
* pool?).
*
* XXX: Should this call also update local/remote
* selectors based on what the client requested? It
* would overlap part of the lease_that_selector()
* code.
*/
connection_buf cib;
vdbg("instantiating template "PRI_CONNECTION"", pri_connection(p, &cib));
c = rw_responder_v1_quick_n_dirty_instantiate(p, c->remote->host.addr,
remote_client,
&c->remote->host.id,
verbose, HERE); /* must delref */
} else {
connection_buf cib;
llog_pexpect(verbose.logger, HERE,
"unexpected connection type "PRI_CONNECTION"",
pri_connection(p, &cib));
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
}
/*
* Now try to refine C further by taking a lease. Remember,
* IKEv1 only does IPv4 leases.
*
* Normally, MODE_CFG will have assigned the lease before
* reaching this point. But when MODE_CFG is skipped, that
* doesn't happen.
*
* For instance, the client is put to sleep (laptop lid
* closed) leading to the server timing out and deleting the
* connection. When the client wakes it skips MODE_CFG since,
* from its POV, it still "holds" the lease.
*
* For instance, this end crashes, the peer then tries to
* quickly re-establish. Even though INITIAL_CONTACT is sent
* at the end of MAIN mode, the peer still assumes it has the
* lease and skips MODE-CONFIG.
*
* For instance, the client was configured to skip MODE_CFG.
*
* XXX: IKEv1 only does IPv4.
*/
if (c->remote->config->child.addresspools.len == 0) {
vdbg("connection has no addresspool");
} else if (c->remote->child.lease[IPv4_INDEX].is_set) {
vdbg("connection already has a lease");
} else {
ip_address lease_address = selector_prefix(remote_client);
err_t e = assign_remote_lease(c, ike->sa.st_xauth_username,
address_info(lease_address),
&lease_address, ike->sa.logger);
if (e != NULL) {
selector_buf cb;
llog(RC_LOG, ike->sa.logger,
"Quick Mode request rejected, peer requested lease of %s but it is unavailable, %s; deleting ISAKMP SA",
str_selector(&remote_client, &cb), e);
connection_delref(&c, ike->sa.logger);
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
}
selector_buf sb;
llog(RC_LOG, ike->sa.logger,
"Quick Mode without mode-config, assigned lease %s",
str_selector(&remote_client, &sb));
vdbg("another hack to get the SPD in sync");
c->spd->remote->client = remote_client;
spd_db_rehash_remote_client(c->spd);
}
/* fill in the client's true ip address/subnet */
const struct ip_info *client_afi = selector_info(remote_client);
if (client_afi == NULL) {
client_afi = &unspec_ip_info;
}
selector_buf csb;
selector_buf rcb;
address_buf lb;
vdbg("%s() client: %s %s; port wildcard: %s; virtual-private: %s; addresspool %s; current remote: %u %s",
__func__,
bool_str(c->remote->child.has_client),
str_selector(&c->spd->remote->client, &rcb),
bool_str(c->remote->config->child.protoport.has_port_wildcard),
bool_str(is_virtual_remote(c, verbose)),
str_address(&c->remote->child.lease[client_afi->ip_index], &lb),
c->remote->child.selectors.proposed.len,
str_selector(&c->remote->child.selectors.proposed.list[0], &csb));
/* fill in the client's true port */
if (c->remote->config->child.protoport.has_port_wildcard) {
ip_selector selector =
selector_from_range_protocol_port(selector_range(c->remote->child.selectors.proposed.list[0]),
selector_protocol(c->remote->child.selectors.proposed.list[0]),
selector_port(remote_client));
update_first_selector(c, remote, selector);
}
if (is_virtual_remote(c, verbose)) {
vdbg("virtual-private: spd %s/%s; config %s/%s",
bool_str(c->spd->local->virt != NULL),
bool_str(c->spd->remote->virt != NULL),
bool_str(c->local->config->child.virt != NULL),
bool_str(c->remote->config->child.virt != NULL));
update_first_selector(c, remote, remote_client);
spd_db_rehash_remote_client(c->spd);
set_child_has_client(c, remote, true);
virtual_ip_delref(&c->spd->remote->virt);
if (selector_eq_address(remote_client, c->remote->host.addr)) {
set_child_has_client(c, remote, false);
}
LDBGP_JAMBUF(DBG_BASE, verbose.logger, buf) {
jam(buf, PRI_VERBOSE, pri_verbose);
jam(buf, "setting phase 2 virtual values to ");
jam_spd_ends(buf, c, c->spd->remote, "...", c->spd->local);
}
}
/*
* Some sanity checks - confirm above configured connection.
*
* XXX: IKEv1 only does IPv4 address pool.
*/
if (!c->spd->remote->client.is_set) {
llog(RC_LOG, ike->sa.logger, "Quick Mode request rejected; connection has no remote client selector");
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
}
if (!c->spd->local->client.is_set) {
llog(RC_LOG, ike->sa.logger, "Quick Mode request rejected; connection has no remote client selector");
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
}
/* now that we are sure of our connection, create our new state, and
* do any asynchronous cryptographic operations that we may need to
* make it all work.
*/
hv = ike->sa.hidden_variables;
if (nat_traversal_detected(&ike->sa) &&
(hv.st_nat_traversal & NAT_T_WITH_NATOA))
nat_traversal_natoa_lookup(md, &hv, ike->sa.logger);
/* create our new state */
struct child_sa *child = new_v1_child_sa(c, ike, SA_RESPONDER);
/* delref stack reference */
struct connection *cc = c;
connection_delref(&cc, cc->logger);
/*
* first: fill in missing bits of our new state object note:
* we don't copy over st_peer_pubkey, the public key that
* authenticated the ISAKMP SA. We only need it in this
* routine, so we can "reach back" to p1st to get The.
*/
/*
* Since
*
* the decrypted message has passed a basic sanity check and
* has been determined to actually advance the IKE state
* machine
*
* (which includes progressing to a rejected Child SA) advance
* the IV.
*/
update_quick_iv(child, md->v1_decrypt_iv, HERE);
child->sa.st_v1_msgid.id = md->hdr.isa_msgid;
switch_md_st(md, &child->sa, HERE); /* feed back new state */
change_v1_state(&child->sa, STATE_QUICK_R0);
binlog_refresh_state(&child->sa);
/* copy hidden variables (possibly with changes) */
child->sa.hidden_variables = hv;
/*
* copy the connection's IPSEC policy into our state. The
* ISAKMP policy is water under the bridge, I think. It will
* reflect the ISAKMP SA that we are using.
*/
child->sa.st_policy = child_sa_policy(c);
if (nat_traversal_detected(&ike->sa)) {
/* ??? this partially overwrites what was done via hv */
child->sa.hidden_variables.st_nat_traversal =
ike->sa.hidden_variables.st_nat_traversal;
nat_traversal_change_port_lookup(md, md->v1_st);
v1_maybe_natify_initiator_endpoints(&child->sa, HERE);
} else {
/* ??? this partially overwrites what was done via hv */
child->sa.hidden_variables.st_nat_traversal = LEMPTY;
}
passert(child->sa.st_connection != NULL);
passert(child->sa.st_connection == c);
/* process SA in */
{
struct payload_digest *const sapd =
md->chain[ISAKMP_NEXT_SA];
struct pbs_in in_pbs = sapd->pbs;
/*
* parse and accept body, setting variables, but not
* forming our reply. We'll make up the reply later
* on.
*
* note that we process the copy of the pbs,
* so that we can process it again in the
* tail(). XXX: Huh, this is the tail
* function!
*/
child->sa.st_pfs_group = &unset_group;
RETURN_STF_FAIL_v1NURE(parse_ipsec_sa_body(&in_pbs,
&sapd->payload.
sa,
NULL,
false,
child));
}
/* Ni in */
RETURN_STF_FAIL_v1NURE(accept_v1_nonce(child->sa.logger, md, &child->sa.st_ni, "Ni"));
/* [ KE ] in (for PFS) */
RETURN_STF_FAIL_v1NURE(accept_PFS_KE(child, md, &child->sa.st_gi,
"Gi", "Quick Mode I1"));
passert(child->sa.st_pfs_group != &unset_group);
submit_ke_and_nonce(/*callback*/&child->sa, /*task*/&child->sa, md,
child->sa.st_pfs_group/*possibly-null*/,
quick_inI1_outR1_continue1,
/*detach_whack*/false, HERE);
return STF_SUSPEND;
}
static stf_status quick_inI1_outR1_continue1(struct state *child_sa,
struct msg_digest *md,
struct dh_local_secret *local_secret,
chunk_t *nonce)
{
struct child_sa *child = pexpect_child_sa(child_sa);
if (pbad(child == NULL)) {
return STF_INTERNAL_ERROR;
}
struct ike_sa *ike = isakmp_sa_where(child, HERE);
if (ike == NULL) {
/* phase1 state got deleted while cryptohelper was working */
llog(RC_LOG, child->sa.logger,
"%s() failed because parent ISAKMP "PRI_SO" is gone",
__func__, pri_so(child->sa.st_clonedfrom));
return STF_FATAL;
}
ldbg(child->sa.logger, "%s() for "PRI_SO": calculated ke+nonce, calculating DH",
__func__, pri_so(child->sa.st_serialno));
/* we always calculate a nonce */
unpack_nonce(&child->sa.st_nr, nonce);
if (child->sa.st_pfs_group != NULL) {
/* PFS is on: do a new DH */
unpack_KE_from_helper(&child->sa, local_secret, &child->sa.st_gr);
submit_dh_shared_secret(/*callback*/&child->sa, /*task*/&child->sa, md,
child->sa.st_gi,
quick_inI1_outR1_continue2,
HERE);
/*
* XXX: Since more crypto has been requested, MD needs
* to be re suspended. If the original crypto request
* did everything this wouldn't be needed.
*/
return STF_SUSPEND;
}
/*
* but if PFS is off, we don't do a second DH, so just call
* the continuation with NULL struct pluto_crypto_req *
*/
return quick_inI1_outR1_continue_tail(ike, child, md);
}
static stf_status quick_inI1_outR1_continue2(struct state *child_sa,
struct msg_digest *md)
{
passert(md != NULL);
struct child_sa *child = pexpect_child_sa(child_sa);
if (pbad(child == NULL)) {
return STF_INTERNAL_ERROR;
}
struct ike_sa *ike = isakmp_sa_where(child, HERE);
if (ike == NULL) {
/* phase1 state got deleted while cryptohelper was working */
llog(RC_LOG, child->sa.logger,
"%s() failed because parent ISAKMP "PRI_SO" is gone",
__func__, pri_so(child->sa.st_clonedfrom));
return STF_FATAL;
}
ldbg(child->sa.logger, "%s() for "PRI_SO": calculated DH, sending R1",
__func__, pri_so(child->sa.st_serialno));
return quick_inI1_outR1_continue_tail(ike, child, md);
}
/*
* Spit out the IPsec ID payload we got.
*/
static bool echo_id(struct pbs_out *outs,
const struct payload_digest *const id_pd)
{
/* Re-pack the received ID. */
struct isakmp_ipsec_id id_header = {
.isaiid_idtype = id_pd->payload.ipsec_id.isaiid_idtype,
.isaiid_protoid = id_pd->payload.ipsec_id.isaiid_protoid,
.isaiid_port = id_pd->payload.ipsec_id.isaiid_port,
};
struct pbs_out id_body;
if (!pbs_out_struct(outs, &isakmp_ipsec_identification_desc,
&id_header, sizeof(id_header), &id_body)) {
return false;
}
/*
* And the ID proper.
*
* As part of reading the header, id_pb.pbs is set up so that
* .start points at the header, .cursor (.cur) points at the
* header's end, and .roof points at .start+.isaiid_length
* (i.e., length of payload with trailing junk trimmed).
*
* However:
*
* There's code using id_pd.pbs to read the payload breaking
* that assumption. Hence, the need to re-compute the
* location of the Indentifer Data using hunk_slice(). See
* decode_net_id().
*/
shunk_t id_all = pbs_in_all(&id_pd->pbs);
shunk_t id_data = hunk_slice(id_all, sizeof(id_header), id_all.len);
if (!pbs_out_hunk(&id_body, id_data, "ID body")) {
return false;
}
close_output_pbs(&id_body);
return true;
}
/*
* Note: install_inbound_ipsec_sa is only used by the Responder.
* The Responder will subsequently use install_ipsec_sa for the outbound.
* The Initiator uses install_ipsec_sa to install both at once.
*/
static void terminate_conflicts(struct child_sa *child)
{
struct connection *c = child->sa.st_connection;
/*
* If our peer has a fixed-address client, check if we already
* have a route for that client that conflicts. We will take
* this as proof that that route and the connections using it
* are obsolete and should be eliminated. Interestingly, this
* is the only case in which we can tell that a connection is
* obsolete.
*
* XXX: can this make use of connection_routability() and / or
* get_connection_spd_conflicts() below?
*/
passert(is_permanent(c) || is_instance(c));
if (c->remote->child.has_client) {
for (;; ) {
struct spd_owner owner = spd_owner(c->spd, RT_UNROUTED/*ignored*/,
child->sa.logger, HERE);
if (owner.bare_route == NULL)
break; /* nobody interesting has a route */
struct connection *co = owner.bare_route->connection;
if (co == c) {
break; /* nobody interesting has a route */
}
/* note: we ignore the client addresses at this end */
/* XXX: but compating interfaces doesn't ?!? */
if (sameaddr(&co->remote->host.addr,
&c->remote->host.addr) &&
co->iface == c->iface)
break; /* existing route is compatible */
if (kernel_ops->overlap_supported) {
/*
* Both are transport mode, allow overlapping.
* [bart] not sure if this is actually
* intended, but am leaving it in to make it
* behave like before
*/
if (c->config->child_sa.encap_mode == ENCAP_MODE_TRANSPORT &&
co->config->child_sa.encap_mode == ENCAP_MODE_TRANSPORT)
break;
/* Both declared that overlapping is OK. */
if (c->config->overlapip && co->config->overlapip)
break;
}
address_buf b;
connection_buf cib;
llog_sa(RC_LOG, child,
"route to peer's client conflicts with "PRI_CONNECTION" %s; releasing old connection to free the route",
pri_connection(co, &cib),
str_address_sensitive(&co->remote->host.addr, &b));
if (is_instance(co)) {
/*
* NOTE: CO not C.
*
* Presumably the instance CO looses
* to the permanent connection C.
*/
connection_addref(co, child->sa.logger);
terminate_all_connection_states(co, HERE);
connection_delref(&co, child->sa.logger);
} else {
/*
* NOTE: C not CO; why?
*/
terminate_all_connection_states(c, HERE);
}
}
}
}
stf_status quick_inI1_outR1_continue_tail(struct ike_sa *ike,
struct child_sa *child,
struct msg_digest *md)
{
passert(ike != NULL); /* use it */
struct payload_digest *const id_pd = md->chain[ISAKMP_NEXT_ID];
struct payload_digest *const sapd = md->chain[ISAKMP_NEXT_SA];
/* Start the output packet.
*
* proccess_packet() would automatically generate the HDR*
* payload if smc->first_out_payload is not ISAKMP_NEXT_NONE.
* We don't do this because we wish there to be no partially
* built output packet if we need to suspend for asynch DNS.
*
* We build the reply packet as we parse the message since
* the parse_ipsec_sa_body emits the reply SA
*/
/* HDR* out */
struct pbs_out rbody;
ikev1_init_pbs_out_from_md_hdr(md, /*encrypt*/true, &reply_stream,
reply_buffer, sizeof(reply_buffer),
&rbody, child->sa.logger);
struct v1_hash_fixup hash_fixup;
if (!emit_v1_HASH(V1_HASH_2, "quick inR1 outI2",
IMPAIR_v1_QUICK_EXCHANGE,
&child->sa, &hash_fixup, &rbody)) {
return STF_INTERNAL_ERROR;
}
struct pbs_out r_sa_pbs;
{
struct isakmp_sa sa = {
.isasa_doi = ISAKMP_DOI_IPSEC,
};
if (!out_struct(&sa, &isakmp_sa_desc, &rbody, &r_sa_pbs))
return STF_INTERNAL_ERROR;
}
/* parse and accept body, this time recording our reply */
RETURN_STF_FAIL_v1NURE(parse_ipsec_sa_body(&sapd->pbs,
&sapd->payload.sa,
&r_sa_pbs,
false, child));
passert(child->sa.st_pfs_group != &unset_group);
if (child->sa.st_connection->config->child_sa.pfs && child->sa.st_pfs_group == NULL) {
llog(RC_LOG, child->sa.logger,
"we require PFS but Quick I1 SA specifies no GROUP_DESCRIPTION");
return STF_FAIL_v1N + v1N_NO_PROPOSAL_CHOSEN; /* ??? */
}
llog(RC_LOG, child->sa.logger,
"responding to Quick Mode proposal {msgid:%08" PRIx32 "} using ISAKMP SA "PRI_SO,
child->sa.st_v1_msgid.id,
pri_so(child->sa.st_clonedfrom));
LLOG_JAMBUF(RC_LOG, child->sa.logger, buf) {
jam(buf, " us: ");
const struct connection *c = child->sa.st_connection;
const struct spd *sr = c->spd;
jam_spd_ends(buf, c, sr->local, " them: ", sr->remote);
}
/**** finish reply packet: Nr [, KE ] [, IDci, IDcr ] ****/
/* Nr out */
if (!ikev1_justship_nonce(&child->sa.st_nr, &rbody, "Nr")) {
return STF_INTERNAL_ERROR;
}
/* [ KE ] out (for PFS) */
if (child->sa.st_pfs_group != NULL && child->sa.st_gr.ptr != NULL) {
if (!ikev1_justship_KE(child->sa.logger, &child->sa.st_gr, &rbody))
return STF_INTERNAL_ERROR;
}
/* [ IDci, IDcr ] out */
if (id_pd != NULL) {
passert(id_pd->next->next == NULL); /* exactly two */
if (!echo_id(&rbody, id_pd) ||
!echo_id(&rbody, id_pd->next))
return STF_INTERNAL_ERROR;
}
/* Compute reply HASH(2) and insert in output */
fixup_v1_HASH(&child->sa, &hash_fixup, child->sa.st_v1_msgid.id, rbody.cur);
/* Derive new keying material */
if (!compute_keymats(ike, child)) {
return STF_FATAL;
}
/* Tell the kernel to establish the new inbound SA
* (unless the commit bit is set -- which we don't support).
* We do this before any state updating so that
* failure won't look like success.
*/
terminate_conflicts(child);
if (!connection_establish_inbound(child, HERE)) {
return STF_FAIL_v1N; /* ??? we may be partly committed */
}
/* encrypt message, except for fixed part of header */
if (!close_and_encrypt_v1_message(ike, &rbody, &child->sa.st_v1_phase_2_iv)) {
return STF_INTERNAL_ERROR; /* ??? we may be partly committed */
}
dbg("finished processing quick inI1");
return STF_OK;
}
/* Handle (the single) message from Responder in Quick Mode.
* HDR*, HASH(2), SA, Nr [, KE ] [, IDci, IDcr ] -->
* HDR*, HASH(3)
* (see RFC 2409 "IKE" 5.5)
* Installs inbound and outbound IPsec SAs, routing, etc.
*/
stf_status quick_inR1_outI2(struct state *child_sa, struct msg_digest *md)
{
struct child_sa *child = pexpect_child_sa(child_sa);
if (pbad(child == NULL)) {
return STF_INTERNAL_ERROR;
}
struct ike_sa *ike = isakmp_sa_where(child, HERE);
if (ike == NULL) {
/* phase1 state got deleted while cryptohelper was working */
llog(RC_LOG, child->sa.logger,
"%s() failed because parent ISAKMP "PRI_SO" is gone",
__func__, pri_so(child->sa.st_clonedfrom));
return STF_FATAL;
}
/*
* Since
*
* the decrypted message has passed a basic sanity check and
* has been determined to actually advance the IKE state
* machine
*
* (which includes progressing to a rejected Child SA) advance
* the IV.
*/
update_quick_iv(child, md->v1_decrypt_iv, HERE);
/* SA in */
struct payload_digest *const sa_pd = md->chain[ISAKMP_NEXT_SA];
RETURN_STF_FAIL_v1NURE(parse_ipsec_sa_body(&sa_pd->pbs,
&sa_pd->payload.sa,
NULL, true, child));
/* Nr in */
RETURN_STF_FAIL_v1NURE(accept_v1_nonce(child->sa.logger, md, &child->sa.st_nr, "Nr"));
/* [ KE ] in (for PFS) */
RETURN_STF_FAIL_v1NURE(accept_PFS_KE(child, md, &child->sa.st_gr, "Gr",
"Quick Mode R1"));
if (child->sa.st_pfs_group != NULL) {
/* set up DH calculation */
submit_dh_shared_secret(/*callback*/&child->sa, /*task*/&child->sa, md,
child->sa.st_gr,
quick_inR1_outI2_continue,
HERE);
return STF_SUSPEND;
}
/* just call the tail function */
return quick_inR1_outI2_continue_tail(ike, child, md);
}
static stf_status quick_inR1_outI2_continue(struct state *child_sa,
struct msg_digest *md)
{
struct child_sa *child = pexpect_child_sa(child_sa);
if (pbad(child == NULL)) {
return STF_INTERNAL_ERROR;
}
struct ike_sa *ike = isakmp_sa_where(child, HERE);
if (ike == NULL) {
/* phase1 state got deleted while cryptohelper was working */
llog(RC_LOG, child->sa.logger,
"phase2 initiation failed because parent ISAKMP #%lu is gone",
child->sa.st_clonedfrom);
return STF_FATAL;
}
ldbg(child->sa.logger,
"quick_inR1_outI2_continue for "PRI_SO": calculated ke+nonce, calculating DH",
pri_so(child->sa.st_serialno));
passert(md != NULL);
return quick_inR1_outI2_continue_tail(ike, child, md);
}
stf_status quick_inR1_outI2_continue_tail(struct ike_sa *ike, struct child_sa *child, struct msg_digest *md)
{
struct connection *c = child->sa.st_connection;
struct pbs_out rbody;
ikev1_init_pbs_out_from_md_hdr(md, /*encrypt*/true, &reply_stream,
reply_buffer, sizeof(reply_buffer),
&rbody, child->sa.logger);
if (nat_traversal_detected(&child->sa) &&
(child->sa.hidden_variables.st_nat_traversal & NAT_T_WITH_NATOA))
nat_traversal_natoa_lookup(md, &child->sa.hidden_variables, child->sa.logger);
/* [ IDci, IDcr ] in; these must match what we sent */
{
struct payload_digest *const IDci = md->chain[ISAKMP_NEXT_ID];
struct payload_digest *IDcr;
if (IDci != NULL) {
/* ??? we are assuming IPSEC_DOI */
/* IDci (we are initiator) */
if (!check_net_id(&IDci->payload.ipsec_id, &IDci->pbs,
c->spd->local->client.ipproto,
c->spd->local->client.hport,
selector_subnet(child->sa.st_connection->spd->local->client),
"our client", child->sa.logger))
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
/* we checked elsewhere that we got two of them */
IDcr = IDci->next;
passert(IDcr != NULL);
/* IDcr (responder is peer) */
if (!check_net_id(&IDcr->payload.ipsec_id, &IDcr->pbs,
c->spd->remote->client.ipproto,
c->spd->remote->client.hport,
selector_subnet(child->sa.st_connection->spd->remote->client),
"peer client", child->sa.logger))
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
/*
* if there is a NATOA payload, then use it as
* &child->sa.st_connection->spd->remote->client, if the type
* of the ID was FQDN
*/
if (nat_traversal_detected(&child->sa) &&
(child->sa.hidden_variables.st_nat_traversal &
NAT_T_WITH_NATOA) &&
IDcr->payload.ipsec_id.isaiid_idtype == ID_FQDN) {
shunk_t idfqdn = pbs_in_left(&IDcr->pbs);
update_first_selector(child->sa.st_connection, remote,
selector_from_address(child->sa.hidden_variables.st_nat_oa));
LLOG_JAMBUF(RC_LOG, child->sa.logger, buf) {
jam(buf, "IDcr was FQDN: ");
jam_sanitized_hunk(buf, idfqdn);
jam(buf, ", using NAT_OA=");
jam_selector_range(buf, &child->sa.st_connection->spd->remote->client);
jam(buf, " as IDcr");
}
}
} else {
/*
* No IDci, IDcr: we must check that the
* defaults match our proposal.
*/
if (!selector_eq_address(c->spd->local->client, c->local->host.addr) ||
!selector_eq_address(c->spd->remote->client, c->remote->host.addr)) {
llog(RC_LOG, child->sa.logger,
"IDci, IDcr payloads missing in message but default does not match proposal");
return STF_FAIL_v1N + v1N_INVALID_ID_INFORMATION;
}
}
}
/**************** build reply packet HDR*, HASH(3) ****************/
/* HDR* out done */
/* HASH(3) out -- sometimes, we add more content */
struct v1_hash_fixup hash_fixup;
if (!emit_v1_HASH(V1_HASH_3, "quick_inR1_outI2",
IMPAIR_v1_QUICK_EXCHANGE, &child->sa, &hash_fixup, &rbody)) {
return STF_INTERNAL_ERROR;
}
fixup_v1_HASH(&child->sa, &hash_fixup, child->sa.st_v1_msgid.id, NULL);
/* Derive new keying material */
compute_keymats(ike, child);
/* Tell the kernel to establish the inbound, outbound, and routing part
* of the new SA (unless the commit bit is set -- which we don't support).
* We do this before any state updating so that
* failure won't look like success.
*/
if (!connection_establish_child(ike, child, HERE))
return STF_FAIL_v1N;
/* encrypt message, except for fixed part of header */
if (!close_and_encrypt_v1_message(ike, &rbody, &child->sa.st_v1_phase_2_iv)) {
return STF_INTERNAL_ERROR; /* ??? we may be partly committed */
}
if (dpd_init(&child->sa) != STF_OK) {
return STF_FAIL_v1N;
}
return STF_OK;
}
/* Handle last message of Quick Mode.
* HDR*, HASH(3) -> done
* (see RFC 2409 "IKE" 5.5)
* Installs outbound IPsec SAs, routing, etc.
*/
stf_status quick_inI2(struct state *child_sa, struct msg_digest *md)
{
struct child_sa *child = pexpect_child_sa(child_sa);
if (pbad(child == NULL)) {
return STF_INTERNAL_ERROR;
}
struct ike_sa *ike = isakmp_sa_where(child, HERE);
if (ike == NULL) {
/*
* Phase1 state got deleted while crypto-helper was
* working.
*
* XXX: but the IKE SA is needed to decrypt the packet
* and no crypto work was needed?!?
*/
llog(RC_LOG, child->sa.logger,
"%s() failed because parent ISAKMP "PRI_SO" is gone",
__func__, pri_so(child->sa.st_clonedfrom));
return STF_FATAL;
}
/*
* Since
*
* the decrypted message has passed a basic sanity check and
* has been determined to actually advance the IKE state
* machine
*
* (which includes progressing to a rejected Child SA) advance
* the IV.
*
* Since there are no further exchanges, this isn't necessary;
* but it is tidy.
*/
update_quick_iv(child, md->v1_decrypt_iv, HERE);
/* Tell the kernel to establish the outbound and routing part of the new SA
* (the previous state established inbound)
* (unless the commit bit is set -- which we don't support).
* We do this before any state updating so that
* failure won't look like success.
*/
if (!connection_establish_outbound(ike, child, HERE))
return STF_FAIL_v1N;
/*
* If we have dpd delay and dpdtimeout set, then we are doing DPD
* on this conn, so initialize it
*/
if (dpd_init(&child->sa) != STF_OK) {
return STF_FAIL_v1N;
}
return STF_OK;
}
/*
* find_client_connection: given a connection suitable for ISAKMP
* (i.e. the hosts match), find a one suitable for IPSEC
* (i.e. with matching clients).
*
* If we don't find an exact match (not even our current connection),
* we try for one that still needs instantiation. Try Road Warrior
* abstract connections and the Opportunistic abstract connections.
* This requires inverse instantiation: abstraction.
*
* After failing to find an exact match, we abstract the peer
* to be NO_IP (the wildcard value). This enables matches with
* Road Warrior and Opportunistic abstract connections.
*
* After failing that search, we also abstract the Phase 1 peer ID
* if possible. If the peer's ID was the peer's IP address, we make
* it NO_ID; instantiation will make it the peer's IP address again.
*
* If searching for a Road Warrior abstract connection fails,
* and conditions are suitable, we search for the best Opportunistic
* abstract connection.
*
* Note: in the end, both Phase 1 IDs must be preserved, after any
* instantiation. They are the IDs that have been authenticated.
*/
#define PATH_WEIGHT 1
#define WILD_WEIGHT (MAX_CA_PATH_LEN + 1)
#define PRIO_WEIGHT ((MAX_WILDCARDS + 1) * WILD_WEIGHT)
/*
* fc_try() an unhelpful confusion of find_client_connection.
*/
static struct connection *fc_try(const struct connection *c,
const ip_address local_address,
const ip_address remote_address,
const ip_selector *local_client,
const ip_selector *remote_client,
struct verbose verbose)
{
selector_pair_buf spb;
address_buf lb, rb;
vdbg("%s() %s<-%s %s",
__func__,
str_address(&local_address, &lb), str_address(&remote_address, &rb),
str_selector_pair(local_client, remote_client, &spb));
verbose.level++;
if (selector_is_unset(local_client) ||
selector_is_unset(remote_client)) {
vdbg("null selectors!?!");
return NULL;
}
struct connection *best = NULL;
connection_priority_t best_prio = BOTTOM_PRIORITY;
err_t virtualwhy = NULL;
struct connection_filter hpf = {
.host_pair = {
.local = &local_address,
.remote = &remote_address, /* could be %any */
},
.ike_version = IKEv1,
.search = {
.order = NEW2OLD,
.verbose = verbose,
.where = HERE,
},
};
while (next_connection(&hpf)) {
struct connection *d = hpf.c;
struct verbose verbose = hpf.search.verbose;
if (is_instance(d) && d->remote->host.id.kind == ID_NULL) {
vdbg("skipping unauthenticated connection instance with ID_NULL");
continue;
}
/*
* ??? what should wildcards and pathlen default to?
*
* Coverity Scan detected that they could be
* referenced without initialization. This happens if
* the connaliases match. This bug was introduced in
* 605c8010007.
*
* For now, I've defaulted them to the largest values.
*
* Same code in ikev2_ts.c
*/
struct connection_id_score score = {
.wildcards = MAX_WILDCARDS,
.pathlen = MAX_CA_PATH_LEN,
};
if (!compare_connection_id(c, d, &score, verbose)) {
/* already logged */
continue;
}
if (is_virtual_remote(d, verbose)) {
/* non-NULL when rejected; saved for later */
virtualwhy = is_virtual_net_allowed(d, (*remote_client), verbose);
if (virtualwhy != NULL) {
vdbg("skipping virtual connection: %s",
virtualwhy);
continue;
}
/* allow spd code to execute; should skip the
* remote part */
}
/*
* The SPD's selector should be set to the address
* pool range, but isn't. Instead ot is ANY so need
* to do an explicit check here.
*
* The type of connection - template or instance
* (can't be permanent) - really doesn't matter as in
* both cases the address must fit.
*
* In xauth-pluto-26 there's a configured address pool
* but then the XAUTH exchange replaces it with one
* from a file.
*/
if (c->pool[IPv4_INDEX] != NULL) {
ip_range pool_range = addresspool_range(c->pool[IPv4_INDEX]);
if (!selector_contains_one_address(*remote_client)) {
range_buf rb;
selector_buf cb;
vdbg("skipping connection with address pool %s, remote client %s is not an address",
str_range(&pool_range, &rb),
str_selector(remote_client, &cb));
continue;
}
ip_address remote_address = selector_prefix(*remote_client);
if (!address_in_range(remote_address, pool_range)) {
range_buf rb;
selector_buf cb;
vdbg("skipping connection with address pool %s, remote client %s is not in range",
str_range(&pool_range, &rb),
str_selector(remote_client, &cb));
continue;
}
}
/*
* non-Opportunistic case: local_client must match.
*
* So must remote_client, but the testing is
* complicated by the fact that the peer might be a
* wildcard and if so, the default value of
* that.client won't match the default remote_net. The
* appropriate test:
*
* If d has a peer client, it must match remote_net.
*
* If d has no peer client, remote_net must just have
* peer itself.
*/
unsigned level = verbose.level;
FOR_EACH_ITEM(d_spd, &d->child.spds) {
verbose.level = level;
selector_pair_buf sb;
vdbg("trying %s SPD %s virt=%s",
d->prefix,
str_selector_pair(&d_spd->local->client, &d_spd->remote->client, &sb),
bool_str(is_virtual_spd_end(d_spd->remote, verbose)));
verbose.level++;
/*
* Compare local selectors.
*
* In addition to the obvious (IN), need to
* check that the ranges exactly match. Why?
* IKEv1 doesn't do narrowing, mostly.
*/
if (!selector_in_selector(*local_client, d_spd->local->client)) {
selector_buf s1, s2;
vdbg("skipping SPD, initiator's local client select %s must be within %s",
str_selector(local_client, &s2),
str_selector(&d_spd->local->client, &s1));
continue;
}
if (!selector_range_eq_selector_range(*local_client, d_spd->local->client)) {
selector_buf s1, s2;
vdbg("skipping SPD, initiator's local client range %s must match %s",
str_selector(local_client, &s2),
str_selector(&d_spd->local->client, &s1));
continue;
}
/*
* Compare remote selectors.
*
* Now things get weird.
*/
if (!selector_in_selector(*remote_client, d_spd->remote->client)) {
selector_buf s1, s2;
vdbg("skipping SPD, initiator's remote client selector %s must be within %s",
str_selector(remote_client, &s2),
str_selector(&d_spd->remote->client, &s1));
continue;
}
if (c->pool[IPv4_INDEX] != NULL) {
selector_buf s2;
vdbg("initiator's remote client range %s is within address-pool, continuing",
str_selector(remote_client, &s2));
} else if (is_instance(d) || is_permanent(d)) {
if (!selector_range_eq_selector_range(*remote_client, d_spd->remote->client)) {
selector_buf s1, s2;
vdbg("skipping instance|permanent SPD, initiator's remote client range %s must match %s",
str_selector(remote_client, &s2),
str_selector(&d_spd->remote->client, &s1));
continue;
}
}
/*
* We've run the gauntlet -- success:
* We've got an exact match of subnets.
* The connection is feasible, but we continue looking
* for the best.
* The highest priority wins, implementing eroute-like
* rule.
* - a routed connection is preferred
* - given that, the smallest number of ID wildcards
* are preferred
* - given that, the shortest CA pathlength is preferred
* - given that, not switching is preferred
*/
connection_priority_t prio =
PRIO_WEIGHT * kernel_route_installed(d) +
WILD_WEIGHT * (MAX_WILDCARDS - score.wildcards) +
PATH_WEIGHT * (MAX_CA_PATH_LEN - score.pathlen) +
(c == d ? 1 : 0) +
1;
if (prio <= best_prio) {
vdbg("not the best as %d <= %d", prio, best_prio);
continue;
}
vdbg("best so far!");
best = d;
best_prio = prio;
break;
}
}
if (best != NULL && never_negotiate(best)) {
connection_buf cb;
llog(RC_LOG, verbose.logger,
"best connection "PRI_CONNECTION" is never-negotiate, ignoring",
pri_connection(best, &cb));
return NULL;
}
if (best != NULL) {
connection_buf cb;
vdbg("concluding with "PRI_CONNECTION" with priority %d",
pri_connection(best, &cb), best_prio);
return best;
}
if (virtualwhy != NULL) {
/* this may not be the only/real reason! */
llog(RC_LOG, verbose.logger,
"peer proposal was rejected in a virtual connection policy: %s",
virtualwhy);
}
vdbg("concluding with no matching connection");
return NULL;
}
struct connection *find_v1_client_connection(struct connection *const c,
const ip_selector *local_client,
const ip_selector *remote_client,
struct verbose verbose)
{
selector_pair_buf sb;
connection_buf cb;
vdbg("%s() looking for %s, starting with "PRI_CONNECTION,
__func__, str_selector_pair(local_client, remote_client, &sb),
pri_connection(c, &cb));
verbose.level++;
/* weird things can happen to our interfaces */
if (!oriented(c)) {
vdbg("connection is unoriented");
return NULL;
}
if (selector_is_unset(local_client)) {
vdbg("peer's local client is not set");
return NULL;
}
if (selector_is_unset(remote_client)) {
vdbg("peer's remote client is not set");
return NULL;
}
/*
* Give priority to current connection
* but even greater priority to a routed concrete connection.
*/
/* exact match? */
/*
* clang 3.4 says: warning: Access to field 'host_pair'
* results in a dereference of a null pointer (loaded from
* variable 'c')
*
* If so, the caller must have passed NULL for it and earlier
* references would be wrong (segfault).
*/
struct connection *d;
d = fc_try(c, c->local->host.addr, c->remote->host.addr,
local_client, remote_client, verbose);
if (d != NULL) {
connection_buf cb;
vdbg("success! fc_try %s gives "PRI_CONNECTION,
c->name, pri_connection(d, &cb));
return d;
}
/*
* Retry looking for a template.
*/
d = fc_try(c, c->local->host.addr, unset_address,
local_client, remote_client, verbose);
if (d != NULL) {
connection_buf cb;
vdbg("success! template search found "PRI_CONNECTION,
pri_connection(d, &cb));
return d;
}
vdbg("concluding with no connection");
return NULL;
}
|