michael@0: /*-
michael@0:  * Copyright (c) 2001-2007, by Cisco Systems, Inc. All rights reserved.
michael@0:  * Copyright (c) 2008-2012, by Randall Stewart. All rights reserved.
michael@0:  * Copyright (c) 2008-2013, by Michael Tuexen. All rights reserved.
michael@0:  * Copyright (c) 2013,      by Lally Singh. All rights reserved.
michael@0:  *
michael@0:  * Redistribution and use in source and binary forms, with or without
michael@0:  * modification, are permitted provided that the following conditions are met:
michael@0:  *
michael@0:  * a) Redistributions of source code must retain the above copyright notice,
michael@0:  *   this list of conditions and the following disclaimer.
michael@0:  *
michael@0:  * b) Redistributions in binary form must reproduce the above copyright
michael@0:  *    notice, this list of conditions and the following disclaimer in
michael@0:  *   the documentation and/or other materials provided with the distribution.
michael@0:  *
michael@0:  * c) Neither the name of Cisco Systems, Inc. nor the names of its
michael@0:  *    contributors may be used to endorse or promote products derived
michael@0:  *    from this software without specific prior written permission.
michael@0:  *
michael@0:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
michael@0:  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
michael@0:  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
michael@0:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
michael@0:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
michael@0:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
michael@0:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
michael@0:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
michael@0:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
michael@0:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
michael@0:  * THE POSSIBILITY OF SUCH DAMAGE.
michael@0:  */
michael@0: 
michael@0: #include <netinet/sctp_sha1.h>
michael@0: 
michael@0: #if defined(SCTP_USE_NSS_SHA1)
michael@0: /* A SHA-1 Digest is 160 bits, or 20 bytes */
michael@0: #define SHA_DIGEST_LENGTH (20)
michael@0: 
michael@0: void
michael@0: sctp_sha1_init(struct sctp_sha1_context *ctx)
michael@0: {
michael@0: 	ctx->pk11_ctx = PK11_CreateDigestContext(SEC_OID_SHA1);
michael@0: 	PK11_DigestBegin(ctx->pk11_ctx);
michael@0: }
michael@0: 
michael@0: void
michael@0: sctp_sha1_update(struct sctp_sha1_context *ctx, const unsigned char *ptr, unsigned int siz)
michael@0: {
michael@0: 	PK11_DigestOp(ctx->pk11_ctx, ptr, siz);
michael@0: }
michael@0: 
michael@0: void
michael@0: sctp_sha1_final(unsigned char *digest, struct sctp_sha1_context *ctx)
michael@0: {
michael@0: 	unsigned int output_len = 0;
michael@0: 
michael@0: 	PK11_DigestFinal(ctx->pk11_ctx, digest, &output_len, SHA_DIGEST_LENGTH);
michael@0: 	PK11_DestroyContext(ctx->pk11_ctx, PR_TRUE);
michael@0: }
michael@0: 
michael@0: #elif defined(SCTP_USE_OPENSSL_SHA1)
michael@0: 
michael@0: void
michael@0: sctp_sha1_init(struct sctp_sha1_context *ctx)
michael@0: {
michael@0: 	SHA1_Init(&ctx->sha_ctx);
michael@0: }
michael@0: 
michael@0: void
michael@0: sctp_sha1_update(struct sctp_sha1_context *ctx, const unsigned char *ptr, unsigned int siz)
michael@0: {
michael@0: 	SHA1_Update(&ctx->sha_ctx, ptr, (unsigned long)siz);
michael@0: }
michael@0: 
michael@0: void
michael@0: sctp_sha1_final(unsigned char *digest, struct sctp_sha1_context *ctx)
michael@0: {
michael@0: 	SHA1_Final(digest, &ctx->sha_ctx);
michael@0: }
michael@0: 
michael@0: #else
michael@0: 
michael@0: #include <string.h>
michael@0: #if defined(__Userspace_os_Windows)
michael@0: #include <winsock2.h>
michael@0: #elif !defined(__Windows__)
michael@0: #include <arpa/inet.h>
michael@0: #endif
michael@0: 
michael@0: #define F1(B,C,D) (((B & C) | ((~B) & D)))	/* 0  <= t <= 19 */
michael@0: #define F2(B,C,D) (B ^ C ^ D)	/* 20 <= t <= 39 */
michael@0: #define F3(B,C,D) ((B & C) | (B & D) | (C & D))	/* 40 <= t <= 59 */
michael@0: #define F4(B,C,D) (B ^ C ^ D)	/* 600 <= t <= 79 */
michael@0: 
michael@0: /* circular shift */
michael@0: #define CSHIFT(A,B) ((B << A) | (B >> (32-A)))
michael@0: 
michael@0: #define K1 0x5a827999		/* 0  <= t <= 19 */
michael@0: #define K2 0x6ed9eba1		/* 20 <= t <= 39 */
michael@0: #define K3 0x8f1bbcdc		/* 40 <= t <= 59 */
michael@0: #define K4 0xca62c1d6		/* 60 <= t <= 79 */
michael@0: 
michael@0: #define H0INIT 0x67452301
michael@0: #define H1INIT 0xefcdab89
michael@0: #define H2INIT 0x98badcfe
michael@0: #define H3INIT 0x10325476
michael@0: #define H4INIT 0xc3d2e1f0
michael@0: 
michael@0: void
michael@0: sctp_sha1_init(struct sctp_sha1_context *ctx)
michael@0: {
michael@0: 	/* Init the SHA-1 context structure */
michael@0: 	ctx->A = 0;
michael@0: 	ctx->B = 0;
michael@0: 	ctx->C = 0;
michael@0: 	ctx->D = 0;
michael@0: 	ctx->E = 0;
michael@0: 	ctx->H0 = H0INIT;
michael@0: 	ctx->H1 = H1INIT;
michael@0: 	ctx->H2 = H2INIT;
michael@0: 	ctx->H3 = H3INIT;
michael@0: 	ctx->H4 = H4INIT;
michael@0: 	ctx->TEMP = 0;
michael@0: 	memset(ctx->words, 0, sizeof(ctx->words));
michael@0: 	ctx->how_many_in_block = 0;
michael@0: 	ctx->running_total = 0;
michael@0: }
michael@0: 
michael@0: static void
michael@0: sctp_sha1_process_a_block(struct sctp_sha1_context *ctx, unsigned int *block)
michael@0: {
michael@0: 	int i;
michael@0: 
michael@0: 	/* init the W0-W15 to the block of words being hashed. */
michael@0: 	/* step a) */
michael@0: 	for (i = 0; i < 16; i++) {
michael@0: 		ctx->words[i] = ntohl(block[i]);
michael@0: 	}
michael@0: 	/* now init the rest based on the SHA-1 formula, step b) */
michael@0: 	for (i = 16; i < 80; i++) {
michael@0: 		ctx->words[i] = CSHIFT(1, ((ctx->words[(i - 3)]) ^
michael@0: 		    (ctx->words[(i - 8)]) ^
michael@0: 		    (ctx->words[(i - 14)]) ^
michael@0: 		    (ctx->words[(i - 16)])));
michael@0: 	}
michael@0: 	/* step c) */
michael@0: 	ctx->A = ctx->H0;
michael@0: 	ctx->B = ctx->H1;
michael@0: 	ctx->C = ctx->H2;
michael@0: 	ctx->D = ctx->H3;
michael@0: 	ctx->E = ctx->H4;
michael@0: 
michael@0: 	/* step d) */
michael@0: 	for (i = 0; i < 80; i++) {
michael@0: 		if (i < 20) {
michael@0: 			ctx->TEMP = ((CSHIFT(5, ctx->A)) +
michael@0: 			    (F1(ctx->B, ctx->C, ctx->D)) +
michael@0: 			    (ctx->E) +
michael@0: 			    ctx->words[i] +
michael@0: 			    K1);
michael@0: 		} else if (i < 40) {
michael@0: 			ctx->TEMP = ((CSHIFT(5, ctx->A)) +
michael@0: 			    (F2(ctx->B, ctx->C, ctx->D)) +
michael@0: 			    (ctx->E) +
michael@0: 			    (ctx->words[i]) +
michael@0: 			    K2);
michael@0: 		} else if (i < 60) {
michael@0: 			ctx->TEMP = ((CSHIFT(5, ctx->A)) +
michael@0: 			    (F3(ctx->B, ctx->C, ctx->D)) +
michael@0: 			    (ctx->E) +
michael@0: 			    (ctx->words[i]) +
michael@0: 			    K3);
michael@0: 		} else {
michael@0: 			ctx->TEMP = ((CSHIFT(5, ctx->A)) +
michael@0: 			    (F4(ctx->B, ctx->C, ctx->D)) +
michael@0: 			    (ctx->E) +
michael@0: 			    (ctx->words[i]) +
michael@0: 			    K4);
michael@0: 		}
michael@0: 		ctx->E = ctx->D;
michael@0: 		ctx->D = ctx->C;
michael@0: 		ctx->C = CSHIFT(30, ctx->B);
michael@0: 		ctx->B = ctx->A;
michael@0: 		ctx->A = ctx->TEMP;
michael@0: 	}
michael@0: 	/* step e) */
michael@0: 	ctx->H0 = (ctx->H0) + (ctx->A);
michael@0: 	ctx->H1 = (ctx->H1) + (ctx->B);
michael@0: 	ctx->H2 = (ctx->H2) + (ctx->C);
michael@0: 	ctx->H3 = (ctx->H3) + (ctx->D);
michael@0: 	ctx->H4 = (ctx->H4) + (ctx->E);
michael@0: }
michael@0: 
michael@0: void
michael@0: sctp_sha1_update(struct sctp_sha1_context *ctx, const unsigned char *ptr, unsigned int siz)
michael@0: {
michael@0: 	unsigned int number_left, left_to_fill;
michael@0: 
michael@0: 	number_left = siz;
michael@0: 	while (number_left > 0) {
michael@0: 		left_to_fill = sizeof(ctx->sha_block) - ctx->how_many_in_block;
michael@0: 		if (left_to_fill > number_left) {
michael@0: 			/* can only partially fill up this one */
michael@0: 			memcpy(&ctx->sha_block[ctx->how_many_in_block],
michael@0: 			    ptr, number_left);
michael@0: 			ctx->how_many_in_block += number_left;
michael@0: 			ctx->running_total += number_left;
michael@0: 			number_left = 0;
michael@0: 			break;
michael@0: 		} else {
michael@0: 			/* block is now full, process it */
michael@0: 			memcpy(&ctx->sha_block[ctx->how_many_in_block],
michael@0: 			    ptr, left_to_fill);
michael@0: 			sctp_sha1_process_a_block(ctx,
michael@0: 			    (unsigned int *)ctx->sha_block);
michael@0: 			number_left -= left_to_fill;
michael@0: 			ctx->running_total += left_to_fill;
michael@0: 			ctx->how_many_in_block = 0;
michael@0: 			ptr = (const unsigned char *)(ptr + left_to_fill);
michael@0: 		}
michael@0: 	}
michael@0: }
michael@0: 
michael@0: void
michael@0: sctp_sha1_final(unsigned char *digest, struct sctp_sha1_context *ctx)
michael@0: {
michael@0: 	/*
michael@0: 	 * if any left in block fill with padding and process. Then transfer
michael@0: 	 * the digest to the pointer. At the last block some special rules
michael@0: 	 * need to apply. We must add a 1 bit following the message, then we
michael@0: 	 * pad with 0's. The total size is encoded as a 64 bit number at the
michael@0: 	 * end. Now if the last buffer has more than 55 octets in it we
michael@0: 	 * cannot fit the 64 bit number + 10000000 pad on the end and must
michael@0: 	 * add the 10000000 pad, pad the rest of the message with 0's and
michael@0: 	 * then create an all 0 message with just the 64 bit size at the end
michael@0: 	 * and run this block through by itself.  Also the 64 bit int must
michael@0: 	 * be in network byte order.
michael@0: 	 */
michael@0: 	int left_to_fill;
michael@0: 	unsigned int i, *ptr;
michael@0: 
michael@0: 	if (ctx->how_many_in_block > 55) {
michael@0: 		/*
michael@0: 		 * special case, we need to process two blocks here. One for
michael@0: 		 * the current stuff plus possibly the pad. The other for
michael@0: 		 * the size.
michael@0: 		 */
michael@0: 		left_to_fill = sizeof(ctx->sha_block) - ctx->how_many_in_block;
michael@0: 		if (left_to_fill == 0) {
michael@0: 			/* Should not really happen but I am paranoid */
michael@0: 			sctp_sha1_process_a_block(ctx,
michael@0: 			    (unsigned int *)ctx->sha_block);
michael@0: 			/* init last block, a bit different than the rest */
michael@0: 			ctx->sha_block[0] = '\x80';
michael@0: 			for (i = 1; i < sizeof(ctx->sha_block); i++) {
michael@0: 				ctx->sha_block[i] = 0x0;
michael@0: 			}
michael@0: 		} else if (left_to_fill == 1) {
michael@0: 			ctx->sha_block[ctx->how_many_in_block] = '\x80';
michael@0: 			sctp_sha1_process_a_block(ctx,
michael@0: 			    (unsigned int *)ctx->sha_block);
michael@0: 			/* init last block */
michael@0: 			memset(ctx->sha_block, 0, sizeof(ctx->sha_block));
michael@0: 		} else {
michael@0: 			ctx->sha_block[ctx->how_many_in_block] = '\x80';
michael@0: 			for (i = (ctx->how_many_in_block + 1);
michael@0: 			    i < sizeof(ctx->sha_block);
michael@0: 			    i++) {
michael@0: 				ctx->sha_block[i] = 0x0;
michael@0: 			}
michael@0: 			sctp_sha1_process_a_block(ctx,
michael@0: 			    (unsigned int *)ctx->sha_block);
michael@0: 			/* init last block */
michael@0: 			memset(ctx->sha_block, 0, sizeof(ctx->sha_block));
michael@0: 		}
michael@0: 		/* This is in bits so multiply by 8 */
michael@0: 		ctx->running_total *= 8;
michael@0: 		ptr = (unsigned int *)&ctx->sha_block[60];
michael@0: 		*ptr = htonl(ctx->running_total);
michael@0: 		sctp_sha1_process_a_block(ctx, (unsigned int *)ctx->sha_block);
michael@0: 	} else {
michael@0: 		/*
michael@0: 		 * easy case, we just pad this message to size - end with 0
michael@0: 		 * add the magic 0x80 to the next word and then put the
michael@0: 		 * network byte order size in the last spot and process the
michael@0: 		 * block.
michael@0: 		 */
michael@0: 		ctx->sha_block[ctx->how_many_in_block] = '\x80';
michael@0: 		for (i = (ctx->how_many_in_block + 1);
michael@0: 		    i < sizeof(ctx->sha_block);
michael@0: 		    i++) {
michael@0: 			ctx->sha_block[i] = 0x0;
michael@0: 		}
michael@0: 		/* get last int spot */
michael@0: 		ctx->running_total *= 8;
michael@0: 		ptr = (unsigned int *)&ctx->sha_block[60];
michael@0: 		*ptr = htonl(ctx->running_total);
michael@0: 		sctp_sha1_process_a_block(ctx, (unsigned int *)ctx->sha_block);
michael@0: 	}
michael@0: 	/* transfer the digest back to the user */
michael@0: 	digest[3] = (ctx->H0 & 0xff);
michael@0: 	digest[2] = ((ctx->H0 >> 8) & 0xff);
michael@0: 	digest[1] = ((ctx->H0 >> 16) & 0xff);
michael@0: 	digest[0] = ((ctx->H0 >> 24) & 0xff);
michael@0: 
michael@0: 	digest[7] = (ctx->H1 & 0xff);
michael@0: 	digest[6] = ((ctx->H1 >> 8) & 0xff);
michael@0: 	digest[5] = ((ctx->H1 >> 16) & 0xff);
michael@0: 	digest[4] = ((ctx->H1 >> 24) & 0xff);
michael@0: 
michael@0: 	digest[11] = (ctx->H2 & 0xff);
michael@0: 	digest[10] = ((ctx->H2 >> 8) & 0xff);
michael@0: 	digest[9] = ((ctx->H2 >> 16) & 0xff);
michael@0: 	digest[8] = ((ctx->H2 >> 24) & 0xff);
michael@0: 
michael@0: 	digest[15] = (ctx->H3 & 0xff);
michael@0: 	digest[14] = ((ctx->H3 >> 8) & 0xff);
michael@0: 	digest[13] = ((ctx->H3 >> 16) & 0xff);
michael@0: 	digest[12] = ((ctx->H3 >> 24) & 0xff);
michael@0: 
michael@0: 	digest[19] = (ctx->H4 & 0xff);
michael@0: 	digest[18] = ((ctx->H4 >> 8) & 0xff);
michael@0: 	digest[17] = ((ctx->H4 >> 16) & 0xff);
michael@0: 	digest[16] = ((ctx->H4 >> 24) & 0xff);
michael@0: }
michael@0: 
michael@0: #endif