1 /* $NetBSD: md2.c,v 1.7 2012/06/25 22:32:44 abs Exp $ */ 2 3 /* 4 * Copyright (c) 2001 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Andrew Brown. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29 * POSSIBILITY OF SUCH DAMAGE. 30 */ 31 32 #include <sys/cdefs.h> 33 #if defined(LIBC_SCCS) && !defined(lint) 34 __RCSID("$NetBSD: md2.c,v 1.7 2012/06/25 22:32:44 abs Exp $"); 35 #endif /* LIBC_SCCS and not lint */ 36 37 #include "namespace.h" 38 39 #include <sys/types.h> 40 41 #include <assert.h> 42 #include <md2.h> 43 #include <string.h> 44 45 #if HAVE_NBTOOL_CONFIG_H 46 #include "nbtool_config.h" 47 #endif 48 49 #if !HAVE_MD2_H 50 51 /* cut-n-pasted from rfc1319 */ 52 static unsigned char S[256] = { 53 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6, 54 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188, 55 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24, 56 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251, 57 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63, 58 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50, 59 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165, 60 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210, 61 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157, 62 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27, 63 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15, 64 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197, 65 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65, 66 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123, 67 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233, 68 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228, 69 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237, 70 31, 26, 219, 153, 141, 51, 159, 17, 131, 20 71 }; 72 73 /* cut-n-pasted from rfc1319 */ 74 static const unsigned char *pad[] = { 75 (const unsigned char *)"", 76 (const unsigned char *)"\001", 77 (const unsigned char *)"\002\002", 78 (const unsigned char *)"\003\003\003", 79 (const unsigned char *)"\004\004\004\004", 80 (const unsigned char *)"\005\005\005\005\005", 81 (const unsigned char *)"\006\006\006\006\006\006", 82 (const unsigned char *)"\007\007\007\007\007\007\007", 83 (const unsigned char *)"\010\010\010\010\010\010\010\010", 84 (const unsigned char *)"\011\011\011\011\011\011\011\011\011", 85 (const unsigned char *)"\012\012\012\012\012\012\012\012\012\012", 86 (const unsigned char *)"\013\013\013\013\013\013\013\013\013\013\013", 87 (const unsigned char *) 88 "\014\014\014\014\014\014\014\014\014\014\014\014", 89 (const unsigned char *) 90 "\015\015\015\015\015\015\015\015\015\015\015\015\015", 91 (const unsigned char *) 92 "\016\016\016\016\016\016\016\016\016\016\016\016\016\016", 93 (const unsigned char *) 94 "\017\017\017\017\017\017\017\017\017\017\017\017\017\017\017", 95 (const unsigned char *) 96 "\020\020\020\020\020\020\020\020\020\020\020\020\020\020\020\020" 97 }; 98 99 /* 100 * XXX This should not be visible, but due to an accident, it is 101 * XXX so it must remain so. 102 */ 103 /*static*/ void MD2Transform __P((MD2_CTX *)); 104 105 #ifdef __weak_alias 106 __weak_alias(MD2Init,_MD2Init) 107 __weak_alias(MD2Update,_MD2Update) 108 __weak_alias(MD2Final,_MD2Final) 109 __weak_alias(MD2Transform,_MD2Transform) 110 #endif 111 112 void 113 MD2Init(MD2_CTX *context) 114 { 115 _DIAGASSERT(context != 0); 116 117 context->i = 16; 118 memset(&context->C[0], 0, sizeof(context->C)); 119 memset(&context->X[0], 0, sizeof(context->X)); 120 } 121 122 void 123 MD2Update(MD2_CTX *context, const unsigned char *input, unsigned int inputLen) 124 { 125 unsigned int idx, piece; 126 127 _DIAGASSERT(context != 0); 128 _DIAGASSERT(input != 0); 129 130 for (idx = 0; idx < inputLen; idx += piece) { 131 piece = 32 - context->i; 132 if ((inputLen - idx) < piece) 133 piece = inputLen - idx; 134 memcpy(&context->X[context->i], &input[idx], (size_t)piece); 135 if ((context->i += piece) == 32) 136 MD2Transform(context); /* resets i */ 137 } 138 } 139 140 void 141 MD2Final(unsigned char digest[16], MD2_CTX *context) 142 { 143 unsigned int padlen; 144 145 _DIAGASSERT(digest != 0); 146 _DIAGASSERT(context != 0); 147 148 /* padlen should be 1..16 */ 149 padlen = 32 - context->i; 150 151 /* add padding */ 152 MD2Update(context, pad[padlen], padlen); 153 154 /* add checksum */ 155 MD2Update(context, &context->C[0], (unsigned int) sizeof(context->C)); 156 157 /* copy out final digest */ 158 memcpy(digest, &context->X[0], (size_t)16); 159 160 /* reset the context */ 161 MD2Init(context); 162 } 163 164 /*static*/ void 165 MD2Transform(MD2_CTX *context) 166 { 167 uint32_t l, j, k, t; 168 169 /* set block "3" and update "checksum" */ 170 for (l = context->C[15], j = 0; j < 16; j++) { 171 context->X[32 + j] = context->X[j] ^ context->X[16 + j]; 172 l = context->C[j] ^= S[context->X[16 + j] ^ l]; 173 } 174 175 /* mangle input block */ 176 for (t = j = 0; j < 18; t = (t + j) % 256, j++) 177 for (k = 0; k < 48; k++) 178 t = context->X[k] = (context->X[k] ^ S[t]); 179 180 /* reset input pointer */ 181 context->i = 16; 182 } 183 184 #endif /* !HAVE_MD2_H */ 185