blob: 958910009abbed7e5a7da5a184bcb04314a0f2d7 [file] [log] [blame]
Neels Hofmeyr17518fe2017-06-20 04:35:06 +02001/*! \file auth_milenage.c
2 * GSM/GPRS/3G authentication core infrastructure */
3/*
4 * (C) 2011 by Harald Welte <laforge@gnumonks.org>
Harald Welte781bd5d2011-12-06 22:23:52 +01005 *
6 * All Rights Reserved
7 *
Harald Weltee08da972017-11-13 01:00:26 +09008 * SPDX-License-Identifier: GPL-2.0+
9 *
Harald Welte781bd5d2011-12-06 22:23:52 +010010 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2 of the License, or
13 * (at your option) any later version.
14 *
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
19 *
20 * You should have received a copy of the GNU General Public License along
21 * with this program; if not, write to the Free Software Foundation, Inc.,
22 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
23 *
24 */
25
26#include <osmocom/crypt/auth.h>
Maxaead05d2016-04-21 15:57:52 +020027#include <osmocom/core/bits.h>
Harald Welte781bd5d2011-12-06 22:23:52 +010028#include "milenage/common.h"
29#include "milenage/milenage.h"
30
Harald Welte96e2a002017-06-12 21:44:18 +020031/*! \addtogroup auth
32 * @{
33 */
34
Harald Welte113392a2017-08-16 23:37:25 +020035static const uint8_t *gen_opc_if_needed(const struct osmo_sub_auth_data *aud, uint8_t *gen_opc)
36{
37 int rc;
38
39 /* Check if we only know OP and compute OPC if required */
40 if (aud->type == OSMO_AUTH_TYPE_UMTS && aud->u.umts.opc_is_op) {
41 rc = milenage_opc_gen(gen_opc, aud->u.umts.k, aud->u.umts.opc);
42 if (rc < 0)
43 return NULL;
44 return gen_opc;
45 } else
46 return aud->u.umts.opc;
47}
48
Harald Welte781bd5d2011-12-06 22:23:52 +010049static int milenage_gen_vec(struct osmo_auth_vector *vec,
50 struct osmo_sub_auth_data *aud,
51 const uint8_t *_rand)
52{
53 size_t res_len = sizeof(vec->res);
Neels Hofmeyr82c9a0e2017-03-13 17:36:17 +010054 uint64_t next_sqn;
Harald Welte113392a2017-08-16 23:37:25 +020055 uint8_t gen_opc[16];
56 const uint8_t *opc;
Harald Welte781bd5d2011-12-06 22:23:52 +010057 uint8_t sqn[6];
Neels Hofmeyrbb6f7b72017-03-13 17:27:17 +010058 uint64_t ind_mask;
59 uint64_t seq_1;
Harald Welte781bd5d2011-12-06 22:23:52 +010060 int rc;
61
Harald Welte113392a2017-08-16 23:37:25 +020062 opc = gen_opc_if_needed(aud, gen_opc);
63 if (!opc)
64 return -1;
65
Neels Hofmeyrbb6f7b72017-03-13 17:27:17 +010066 /* Determine next SQN, according to 3GPP TS 33.102:
67 * SQN consists of SEQ and a lower significant part of IND bits:
68 *
69 * |----------SEQ------------|
70 * |------------------------SQN-----------|
71 * |-----IND----|
72 *
73 * The IND part is used as "slots": e.g. a given HLR client will always
74 * get the same IND part, called ind here, with incrementing SEQ. In
75 * the USIM, each IND slot enforces that its SEQ are used in ascending
76 * order -- as long as that constraint is satisfied, the SQN may jump
77 * forwards and backwards. For example, for ind_bitlen == 5, asking the
78 * USIM for SQN = 32, 64, 33 is allowed, because 32 and 64 are
79 * SEQ || (ind == 0), and though 33 is below 64, it is ind == 1 and
80 * allowed. Not allowed would be 32, 96, 64, because 64 would go
81 * backwards after 96, both being ind == 0.
82 *
83 * From the last used SQN, we want to increment SEQ + 1, and then pick
84 * the matching IND part.
85 *
86 * IND size is suggested in TS 33.102 as 5 bits. SQN is 48 bits long.
87 * If ind_bitlen is passed too large here, the algorithms will break
88 * down. But at which point should we return an error? A sane limit
89 * seems to be ind_bitlen == 10, but to protect against failure,
90 * limiting ind_bitlen to 28 is enough, 28 being the number of bits
91 * suggested for the delta in 33.102, which is discussed to still
92 * require 2^15 > 32000 authentications to wrap the SQN back to the
93 * start.
94 *
95 * Note that if a caller with ind == 1 generates N vectors, the SQN
96 * stored after this will reflect SEQ + N. If then another caller with
97 * ind == 2 generates another N vectors, this will then use SEQ + N
98 * onwards and end up with SEQ + N + N. In other words, most of each
99 * SEQ's IND slots will remain unused. When looking at SQN being 48
100 * bits wide, after dropping ind_bitlen (say 5) from it, we will still
101 * have a sequence range of 2^43 = 8.8e12, eight trillion sequences,
102 * which is large enough to not bother further. With the maximum
103 * ind_bitlen of 28 enforced below, we still get more than 1 million
104 * sequences, which is also sufficiently large.
105 *
106 * An ind_bitlen of zero may be passed from legacy callers that are not
107 * aware of the IND extension. For these, below algorithm works out as
108 * before, simply incrementing SQN by 1.
109 *
110 * This is also a mechanism for tools like the osmo-auc-gen to directly
111 * request a given SQN to be used. With ind_bitlen == 0 the caller can
112 * be sure that this code will increment SQN by exactly one before
113 * generating a tuple, thus a caller would simply pass
114 * { .ind_bitlen = 0, .ind = 0, .sqn = (desired_sqn - 1) }
115 */
116
Neels Hofmeyr1a02e362017-10-07 04:44:08 +0200117 if (aud->u.umts.ind_bitlen > OSMO_MILENAGE_IND_BITLEN_MAX)
Neels Hofmeyrbb6f7b72017-03-13 17:27:17 +0100118 return -2;
119
120 seq_1 = 1LL << aud->u.umts.ind_bitlen;
121 ind_mask = ~(seq_1 - 1);
122
123 /* the ind index must not affect the SEQ part */
Neels Hofmeyre0cb0ee2017-03-16 05:30:11 +0100124 if (aud->u.umts.ind >= seq_1)
Neels Hofmeyrbb6f7b72017-03-13 17:27:17 +0100125 return -3;
126
Neels Hofmeyr82c9a0e2017-03-13 17:36:17 +0100127 /* keep the incremented SQN local until gsm_milenage() succeeded. */
Neels Hofmeyrbb6f7b72017-03-13 17:27:17 +0100128 next_sqn = ((aud->u.umts.sqn + seq_1) & ind_mask) + aud->u.umts.ind;
Neels Hofmeyr82c9a0e2017-03-13 17:36:17 +0100129
130 osmo_store64be_ext(next_sqn, sqn, 6);
Harald Welte113392a2017-08-16 23:37:25 +0200131 milenage_generate(opc, aud->u.umts.amf, aud->u.umts.k,
Harald Welte781bd5d2011-12-06 22:23:52 +0100132 sqn, _rand,
133 vec->autn, vec->ik, vec->ck, vec->res, &res_len);
134 vec->res_len = res_len;
Harald Welte113392a2017-08-16 23:37:25 +0200135 rc = gsm_milenage(opc, aud->u.umts.k, _rand, vec->sres, vec->kc);
Harald Welte781bd5d2011-12-06 22:23:52 +0100136 if (rc < 0)
137 return rc;
138
139 vec->auth_types = OSMO_AUTH_TYPE_UMTS | OSMO_AUTH_TYPE_GSM;
Neels Hofmeyr82c9a0e2017-03-13 17:36:17 +0100140
141 /* for storage in the caller's AUC database */
142 aud->u.umts.sqn = next_sqn;
Harald Welte781bd5d2011-12-06 22:23:52 +0100143
144 return 0;
145}
146
147static int milenage_gen_vec_auts(struct osmo_auth_vector *vec,
148 struct osmo_sub_auth_data *aud,
149 const uint8_t *auts, const uint8_t *rand_auts,
150 const uint8_t *_rand)
151{
152 uint8_t sqn_out[6];
Harald Weltea72e47b2012-03-21 09:03:16 +0100153 uint8_t gen_opc[16];
Harald Welte113392a2017-08-16 23:37:25 +0200154 const uint8_t *opc;
Harald Welte781bd5d2011-12-06 22:23:52 +0100155 int rc;
156
Harald Welte113392a2017-08-16 23:37:25 +0200157 opc = gen_opc_if_needed(aud, gen_opc);
Harald Weltea72e47b2012-03-21 09:03:16 +0100158
159 rc = milenage_auts(opc, aud->u.umts.k, rand_auts, auts, sqn_out);
Harald Welte781bd5d2011-12-06 22:23:52 +0100160 if (rc < 0)
161 return rc;
162
Neels Hofmeyr2066a422017-08-26 22:43:50 +0200163 aud->u.umts.sqn_ms = osmo_load64be_ext(sqn_out, 6) >> 16;
Neels Hofmeyrbb6f7b72017-03-13 17:27:17 +0100164 /* Update our "largest used SQN" from the USIM -- milenage_gen_vec()
165 * below will increment SQN. */
Neels Hofmeyr2066a422017-08-26 22:43:50 +0200166 aud->u.umts.sqn = aud->u.umts.sqn_ms;
Harald Welte781bd5d2011-12-06 22:23:52 +0100167
168 return milenage_gen_vec(vec, aud, _rand);
169}
170
171static struct osmo_auth_impl milenage_alg = {
172 .algo = OSMO_AUTH_ALG_MILENAGE,
173 .name = "MILENAGE (libosmogsm built-in)",
174 .priority = 1000,
175 .gen_vec = &milenage_gen_vec,
176 .gen_vec_auts = &milenage_gen_vec_auts,
177};
178
179static __attribute__((constructor)) void on_dso_load_milenage(void)
180{
181 osmo_auth_register(&milenage_alg);
182}
Harald Welte96e2a002017-06-12 21:44:18 +0200183
184/*! @} */