2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2008 Isilon Inc http://www.isilon.com/
5 * Authors: Doug Rabson <dfr@rabson.org>
6 * Developed with Red Inc: Alfred Perlstein <alfred@freebsd.org>
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
33 #include <sys/param.h>
34 #include <sys/malloc.h>
38 #include <kgssapi/gssapi.h>
39 #include <kgssapi/gssapi_impl.h>
43 static struct krb5_encryption_class *krb5_encryption_classes[] = {
44 &krb5_des_encryption_class,
45 &krb5_des3_encryption_class,
46 &krb5_aes128_encryption_class,
47 &krb5_aes256_encryption_class,
48 &krb5_arcfour_encryption_class,
49 &krb5_arcfour_56_encryption_class,
53 struct krb5_encryption_class *
54 krb5_find_encryption_class(int etype)
58 for (i = 0; krb5_encryption_classes[i]; i++) {
59 if (krb5_encryption_classes[i]->ec_type == etype)
60 return (krb5_encryption_classes[i]);
65 struct krb5_key_state *
66 krb5_create_key(const struct krb5_encryption_class *ec)
68 struct krb5_key_state *ks;
70 ks = malloc(sizeof(struct krb5_key_state), M_GSSAPI, M_WAITOK);
72 refcount_init(&ks->ks_refs, 1);
73 ks->ks_key = malloc(ec->ec_keylen, M_GSSAPI, M_WAITOK);
80 krb5_free_key(struct krb5_key_state *ks)
83 if (refcount_release(&ks->ks_refs)) {
84 ks->ks_class->ec_destroy(ks);
85 bzero(ks->ks_key, ks->ks_class->ec_keylen);
86 free(ks->ks_key, M_GSSAPI);
92 gcd(size_t a, size_t b)
101 lcm(size_t a, size_t b)
103 return ((a * b) / gcd(a, b));
107 * Rotate right 13 of a variable precision number in 'in', storing the
108 * result in 'out'. The number is assumed to be big-endian in memory
112 krb5_rotate_right_13(uint8_t *out, uint8_t *in, size_t numlen)
118 * Special case when numlen == 1. A rotate right 13 of a
119 * single byte number changes to a rotate right 5.
123 out[0] = (in[0] << 3) | carry;
127 carry = ((in[numlen - 2] & 31) << 8) | in[numlen - 1];
128 for (i = 2; i < numlen; i++) {
129 out[i] = ((in[i - 2] & 31) << 3) | (in[i - 1] >> 5);
131 out[1] = ((carry & 31) << 3) | (in[0] >> 5);
136 * Add two variable precision numbers in big-endian representation
137 * using ones-complement arithmetic.
140 krb5_ones_complement_add(uint8_t *out, const uint8_t *in, size_t len)
145 * First calculate the 2s complement sum, remembering the
149 for (i = len - 1; i >= 0; i--) {
150 n = out[i] + in[i] + n;
155 * Then add back the carry.
157 for (i = len - 1; n && i >= 0; i--) {
165 krb5_n_fold(uint8_t *out, size_t outlen, const uint8_t *in, size_t inlen)
172 tmplen = lcm(inlen, outlen);
173 tmp = malloc(tmplen, M_GSSAPI, M_WAITOK);
175 bcopy(in, tmp, inlen);
176 for (i = inlen, p = tmp; i < tmplen; i += inlen, p += inlen) {
177 krb5_rotate_right_13(p + inlen, p, inlen);
180 for (i = 0, p = tmp; i < tmplen; i += outlen, p += outlen) {
181 krb5_ones_complement_add(out, p, outlen);
186 struct krb5_key_state *
187 krb5_derive_key(struct krb5_key_state *inkey,
188 void *constant, size_t constantlen)
190 struct krb5_key_state *dk;
191 const struct krb5_encryption_class *ec = inkey->ks_class;
193 uint8_t *bytes, *p, *q;
198 * Expand the constant to blocklen bytes.
200 folded = malloc(ec->ec_blocklen, M_GSSAPI, M_WAITOK);
201 krb5_n_fold(folded, ec->ec_blocklen, constant, constantlen);
204 * Generate enough bytes for keybits rounded up to a multiple
207 randomlen = roundup(ec->ec_keybits / 8, ec->ec_blocklen);
208 bytes = malloc(randomlen, M_GSSAPI, M_WAITOK);
209 MGET(m, M_WAITOK, MT_DATA);
210 m->m_len = ec->ec_blocklen;
211 for (i = 0, p = bytes, q = folded; i < randomlen;
212 q = p, i += ec->ec_blocklen, p += ec->ec_blocklen) {
213 bcopy(q, m->m_data, ec->ec_blocklen);
214 krb5_encrypt(inkey, m, 0, ec->ec_blocklen, NULL, 0);
215 bcopy(m->m_data, p, ec->ec_blocklen);
219 dk = krb5_create_key(ec);
220 krb5_random_to_key(dk, bytes);
222 free(folded, M_GSSAPI);
223 free(bytes, M_GSSAPI);
228 static struct krb5_key_state *
229 krb5_get_usage_key(struct krb5_key_state *basekey, int usage, int which)
231 const struct krb5_encryption_class *ec = basekey->ks_class;
233 if (ec->ec_flags & EC_DERIVED_KEYS) {
236 constant[0] = usage >> 24;
237 constant[1] = usage >> 16;
238 constant[2] = usage >> 8;
241 return (krb5_derive_key(basekey, constant, 5));
243 refcount_acquire(&basekey->ks_refs);
248 struct krb5_key_state *
249 krb5_get_encryption_key(struct krb5_key_state *basekey, int usage)
252 return (krb5_get_usage_key(basekey, usage, 0xaa));
255 struct krb5_key_state *
256 krb5_get_integrity_key(struct krb5_key_state *basekey, int usage)
259 return (krb5_get_usage_key(basekey, usage, 0x55));
262 struct krb5_key_state *
263 krb5_get_checksum_key(struct krb5_key_state *basekey, int usage)
266 return (krb5_get_usage_key(basekey, usage, 0x99));