/* * COPYRIGHT (c) 2008 * The Regents of the University of Michigan * ALL RIGHTS RESERVED * * Permission is granted to use, copy, create derivative works * and redistribute this software and such derivative works * for any purpose, so long as the name of The University of * Michigan is not used in any advertising or publicity * pertaining to the use of distribution of this software * without specific, written prior authorization. If the * above copyright notice or any other identification of the * University of Michigan is included in any copy of any * portion of this software, then the disclaimer below must * also be included. * * THIS SOFTWARE IS PROVIDED AS IS, WITHOUT REPRESENTATION * FROM THE UNIVERSITY OF MICHIGAN AS TO ITS FITNESS FOR ANY * PURPOSE, AND WITHOUT WARRANTY BY THE UNIVERSITY OF * MICHIGAN OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING * WITHOUT LIMITATION THE IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE * REGENTS OF THE UNIVERSITY OF MICHIGAN SHALL NOT BE LIABLE * FOR ANY DAMAGES, INCLUDING SPECIAL, INDIRECT, INCIDENTAL, OR * CONSEQUENTIAL DAMAGES, WITH RESPECT TO ANY CLAIM ARISING * OUT OF OR IN CONNECTION WITH THE USE OF THE SOFTWARE, EVEN * IF IT HAS BEEN OR IS HEREAFTER ADVISED OF THE POSSIBILITY OF * SUCH DAMAGES. */ #include #include #include #include #include #include #ifdef RPC_DEBUG # define RPCDBG_FACILITY RPCDBG_AUTH #endif static inline int gss_krb5_padding(int blocksize, int length) { return blocksize - (length % blocksize); } static inline void gss_krb5_add_padding(struct xdr_buf *buf, int offset, int blocksize) { int padding = gss_krb5_padding(blocksize, buf->len - offset); char *p; struct kvec *iov; if (buf->page_len || buf->tail[0].iov_len) iov = &buf->tail[0]; else iov = &buf->head[0]; p = iov->iov_base + iov->iov_len; iov->iov_len += padding; buf->len += padding; memset(p, padding, padding); } static inline int gss_krb5_remove_padding(struct xdr_buf *buf, int blocksize) { u8 *ptr; u8 pad; size_t len = buf->len; if (len <= buf->head[0].iov_len) { pad = *(u8 *)(buf->head[0].iov_base + len - 1); if (pad > buf->head[0].iov_len) return -EINVAL; buf->head[0].iov_len -= pad; goto out; } else len -= buf->head[0].iov_len; if (len <= buf->page_len) { unsigned int last = (buf->page_base + len - 1) >>PAGE_CACHE_SHIFT; unsigned int offset = (buf->page_base + len - 1) & (PAGE_CACHE_SIZE - 1); ptr = kmap_atomic(buf->pages[last], KM_USER0); pad = *(ptr + offset); kunmap_atomic(ptr, KM_USER0); goto out; } else len -= buf->page_len; BUG_ON(len > buf->tail[0].iov_len); pad = *(u8 *)(buf->tail[0].iov_base + len - 1); out: /* XXX: NOTE: we do not adjust the page lengths--they represent * a range of data in the real filesystem page cache, and we need * to know that range so the xdr code can properly place read data. * However adjusting the head length, as we do above, is harmless. * In the case of a request that fits into a single page, the server * also uses length and head length together to determine the original * start of the request to copy the request for deferal; so it's * easier on the server if we adjust head and tail length in tandem. * It's not really a problem that we don't fool with the page and * tail lengths, though--at worst badly formed xdr might lead the * server to attempt to parse the padding. * XXX: Document all these weird requirements for gss mechanism * wrap/unwrap functions. */ if (pad > blocksize) return -EINVAL; if (buf->len > pad) buf->len -= pad; else return -EINVAL; return 0; } static void make_confounder(char *p, u32 conflen) { static u64 i = 0; u64 *q = (u64 *)p; /* rfc1964 claims this should be "random". But all that's really * necessary is that it be unique. And not even that is necessary in * our case since our "gssapi" implementation exists only to support * rpcsec_gss, so we know that the only buffers we will ever encrypt * already begin with a unique sequence number. Just to hedge my bets * I'll make a half-hearted attempt at something unique, but ensuring * uniqueness would mean worrying about atomicity and rollover, and I * don't care enough. */ /* initialize to random value */ if (i == 0) { i = random32(); i = (i << 32) | random32(); } switch (conflen) { case 16: *q++ = i++; /* fall through */ case 8: *q++ = i++; break; default: BUG(); } } /* Assumptions: the head and tail of inbuf are ours to play with. * The pages, however, may be real pages in the page cache and we replace * them with scratch pages from **pages before writing to them. */ /* XXX: obviously the above should be documentation of wrap interface, * and shouldn't be in this kerberos-specific file. */ /* XXX factor out common code with seal/unseal. */ static u32 gss_wrap_kerberos_v1(struct krb5_ctx *kctx, int offset, struct xdr_buf *buf, struct page **pages) { char cksumdata[GSS_KRB5_MAX_CKSUM_LEN]; struct xdr_netobj md5cksum = {.len = sizeof(cksumdata), .data = cksumdata}; int blocksize = 0, plainlen; unsigned char *ptr, *msg_start; s32 now; int headlen; struct page **tmp_pages; u32 seq_send; u8 *cksumkey; dprintk("RPC: %s\n", __func__); now = get_seconds(); blocksize = crypto_blkcipher_blocksize(kctx->enc); gss_krb5_add_padding(buf, offset, blocksize); BUG_ON((buf->len - offset) % blocksize); plainlen = blocksize + buf->len - offset; headlen = g_token_size(&kctx->mech_used, GSS_KRB5_TOK_HDR_LEN + kctx->gk5e->cksumlength + plainlen) - (buf->len - offset); ptr = buf->head[0].iov_base + offset; /* shift data to make room for header. */ xdr_extend_head(buf, offset, headlen); /* XXX Would be cleverer to encrypt while copying. */ BUG_ON((buf->len - offset - headlen) % blocksize); g_make_token_header(&kctx->mech_used, GSS_KRB5_TOK_HDR_LEN + kctx->gk5e->cksumlength + plainlen, &ptr); /* ptr now at header described in rfc 1964, section 1.2.1: */ ptr[0] = (unsigned char) ((KG_TOK_WRAP_MSG >> 8) & 0xff); ptr[1] = (unsigned char) (KG_TOK_WRAP_MSG & 0xff); msg_start = ptr + GSS_KRB5_TOK_HDR_LEN + kctx->gk5e->cksumlength; *(__be16 *)(ptr + 2) = cpu_to_le16(kctx->gk5e->signalg); memset(ptr + 4, 0xff, 4); *(__be16 *)(ptr + 4) = cpu_to_le16(kctx->gk5e->sealalg); make_confounder(msg_start, blocksize); if (kctx->gk5e->keyed_cksum) cksumkey = kctx->cksum; else cksumkey = NULL; /* XXXJBF: UGH!: */ tmp_pages = buf->pages; buf->pages = pages; if (make_checksum(kctx, ptr, 8, buf, offset + headlen - blocksize, cksumkey, &md5cksum)) return GSS_S_FAILURE; buf->pages = tmp_pages; memcpy(ptr + GSS_KRB5_TOK_HDR_LEN, md5cksum.data, md5cksum.len); spin_lock(&krb5_seq_lock); seq_send = kctx->seq_send++; spin_unlock(&krb5_seq_lock); /* XXX would probably be more efficient to compute checksum * and encrypt at the same time: */ if ((krb5_make_seq_num(kctx->seq, kctx->initiate ? 0 : 0xff, seq_send, ptr + GSS_KRB5_TOK_HDR_LEN, ptr + 8))) return GSS_S_FAILURE; if (gss_encrypt_xdr_buf(kctx->enc, buf, offset + headlen - blocksize, pages)) return GSS_S_FAILURE; return (kctx->endtime < now) ? GSS_S_CONTEXT_EXPIRED : GSS_S_COMPLETE; } static u32 gss_unwrap_kerberos_v1(struct krb5_ctx *kctx, int offset, struct xdr_buf *buf) { int signalg; int sealalg; char cksumdata[GSS_KRB5_MAX_CKSUM_LEN]; struct xdr_netobj md5cksum = {.len = sizeof(cksumdata), .data = cksumdata}; s32 now; int direction; s32 seqnum; unsigned char *ptr; int bodysize; void *data_start, *orig_start; int data_len; int blocksize; int crypt_offset; u8 *cksumkey; dprintk("RPC: gss_unwrap_kerberos\n"); ptr = (u8 *)buf->head[0].iov_base + offset; if (g_verify_token_header(&kctx->mech_used, &bodysize, &ptr, buf->len - offset)) return GSS_S_DEFECTIVE_TOKEN; if ((ptr[0] != ((KG_TOK_WRAP_MSG >> 8) & 0xff)) || (ptr[1] != (KG_TOK_WRAP_MSG & 0xff))) return GSS_S_DEFECTIVE_TOKEN; /* XXX sanity-check bodysize?? */ /* get the sign and seal algorithms */ signalg = ptr[2] + (ptr[3] << 8); if (signalg != kctx->gk5e->signalg) return GSS_S_DEFECTIVE_TOKEN; sealalg = ptr[4] + (ptr[5] << 8); if (sealalg != kctx->gk5e->sealalg) return GSS_S_DEFECTIVE_TOKEN; if ((ptr[6] != 0xff) || (ptr[7] != 0xff)) return GSS_S_DEFECTIVE_TOKEN; /* * Data starts after token header and checksum. ptr points * to the beginning of the token header */ crypt_offset = ptr + (GSS_KRB5_TOK_HDR_LEN + kctx->gk5e->cksumlength) - (unsigned char *)buf->head[0].iov_base; if (gss_decrypt_xdr_buf(kctx->enc, buf, crypt_offset)) return GSS_S_DEFECTIVE_TOKEN; if (kctx->gk5e->keyed_cksum) cksumkey = kctx->cksum; else cksumkey = NULL; if (make_checksum(kctx, ptr, 8, buf, crypt_offset, cksumkey, &md5cksum)) return GSS_S_FAILURE; if (memcmp(md5cksum.data, ptr + GSS_KRB5_TOK_HDR_LEN, kctx->gk5e->cksumlength)) return GSS_S_BAD_SIG; /* it got through unscathed. Make sure the context is unexpired */ now = get_seconds(); if (now > kctx->endtime) return GSS_S_CONTEXT_EXPIRED; /* do sequencing checks */ if (krb5_get_seq_num(kctx->seq, ptr + GSS_KRB5_TOK_HDR_LEN, ptr + 8, &direction, &seqnum)) return GSS_S_BAD_SIG; if ((kctx->initiate && direction != 0xff) || (!kctx->initiate && direction != 0)) return GSS_S_BAD_SIG; /* Copy the data back to the right position. XXX: Would probably be * better to copy and encrypt at the same time. */ blocksize = crypto_blkcipher_blocksize(kctx->enc); data_start = ptr + (GSS_KRB5_TOK_HDR_LEN + kctx->gk5e->cksumlength) + blocksize; orig_start = buf->head[0].iov_base + offset; data_len = (buf->head[0].iov_base + buf->head[0].iov_len) - data_start; memmove(orig_start, data_start, data_len); buf->head[0].iov_len -= (data_start - orig_start); buf->len -= (data_start - orig_start); if (gss_krb5_remove_padding(buf, blocksize)) return GSS_S_DEFECTIVE_TOKEN; return GSS_S_COMPLETE; } u32 gss_wrap_kerberos(struct gss_ctx *gctx, int offset, struct xdr_buf *buf, struct page **pages) { struct krb5_ctx *kctx = gctx->internal_ctx_id; switch (kctx->enctype) { default: BUG(); case ENCTYPE_DES_CBC_RAW: return gss_wrap_kerberos_v1(kctx, offset, buf, pages); } } u32 gss_unwrap_kerberos(struct gss_ctx *gctx, int offset, struct xdr_buf *buf) { struct krb5_ctx *kctx = gctx->internal_ctx_id; switch (kctx->enctype) { default: BUG(); case ENCTYPE_DES_CBC_RAW: return gss_unwrap_kerberos_v1(kctx, offset, buf); } }