1 /* $NetBSD: rmd160.c,v 1.1 2014/03/09 00:15:45 agc Exp $ */ 2 /* $KAME: rmd160.c,v 1.2 2003/07/25 09:37:55 itojun Exp $ */ 3 /* $OpenBSD: rmd160.c,v 1.3 2001/09/26 21:40:13 markus Exp $ */ 4 /* 5 * Copyright (c) 2001 Markus Friedl. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 */ 27 /* 28 * Preneel, Bosselaers, Dobbertin, "The Cryptographic Hash Function RIPEMD-160", 29 * RSA Laboratories, CryptoBytes, Volume 3, Number 2, Autumn 1997, 30 * ftp://ftp.rsasecurity.com/pub/cryptobytes/crypto3n2.pdf 31 */ 32 33 #include <sys/cdefs.h> 34 35 #include <string.h> 36 37 #include <sys/types.h> 38 #include <sys/param.h> 39 40 #include "rmd160.h" 41 42 #define PUT_64BIT_LE(cp, value) do { \ 43 (cp)[7] = (u_char)((value) >> 56); \ 44 (cp)[6] = (u_char)((value) >> 48); \ 45 (cp)[5] = (u_char)((value) >> 40); \ 46 (cp)[4] = (u_char)((value) >> 32); \ 47 (cp)[3] = (u_char)((value) >> 24); \ 48 (cp)[2] = (u_char)((value) >> 16); \ 49 (cp)[1] = (u_char)((value) >> 8); \ 50 (cp)[0] = (u_char)((value)); } while (/*CONSTCOND*/0) 51 52 #define PUT_32BIT_LE(cp, value) do { \ 53 (cp)[3] = (value) >> 24; \ 54 (cp)[2] = (value) >> 16; \ 55 (cp)[1] = (value) >> 8; \ 56 (cp)[0] = (value); } while (/*CONSTCOND*/0) 57 58 #define H0 0x67452301U 59 #define H1 0xEFCDAB89U 60 #define H2 0x98BADCFEU 61 #define H3 0x10325476U 62 #define H4 0xC3D2E1F0U 63 64 #define K0 0x00000000U 65 #define K1 0x5A827999U 66 #define K2 0x6ED9EBA1U 67 #define K3 0x8F1BBCDCU 68 #define K4 0xA953FD4EU 69 70 #define KK0 0x50A28BE6U 71 #define KK1 0x5C4DD124U 72 #define KK2 0x6D703EF3U 73 #define KK3 0x7A6D76E9U 74 #define KK4 0x00000000U 75 76 /* rotate x left n bits. */ 77 #define ROL(n, x) (((x) << (n)) | ((x) >> (32-(n)))) 78 79 #define F0(x, y, z) ((x) ^ (y) ^ (z)) 80 #define F1(x, y, z) (((x) & (y)) | ((~x) & (z))) 81 #define F2(x, y, z) (((x) | (~y)) ^ (z)) 82 #define F3(x, y, z) (((x) & (z)) | ((y) & (~z))) 83 #define F4(x, y, z) ((x) ^ ((y) | (~z))) 84 85 #define R(a, b, c, d, e, Fj, Kj, sj, rj) \ 86 do { \ 87 a = ROL(sj, a + Fj(b,c,d) + X(rj) + Kj) + e; \ 88 c = ROL(10, c); \ 89 } while(/*CONSTCOND*/0) 90 91 #define X(i) x[i] 92 93 static const u_char PADDING[64] = { 94 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 96 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 97 }; 98 99 void 100 RMD160Init(RMD160_CTX *ctx) 101 { 102 ctx->count = 0; 103 ctx->state[0] = H0; 104 ctx->state[1] = H1; 105 ctx->state[2] = H2; 106 ctx->state[3] = H3; 107 ctx->state[4] = H4; 108 } 109 110 void 111 RMD160Update(RMD160_CTX *ctx, const u_char *input, uint32_t len) 112 { 113 uint32_t have, off, need; 114 115 have = (uint32_t)((ctx->count/8) % 64); 116 need = 64 - have; 117 ctx->count += 8 * len; 118 off = 0; 119 120 if (len >= need) { 121 if (have) { 122 memcpy(ctx->buffer + have, input, (size_t)need); 123 RMD160Transform(ctx->state, ctx->buffer); 124 off = need; 125 have = 0; 126 } 127 /* now the buffer is empty */ 128 while (off + 64 <= len) { 129 RMD160Transform(ctx->state, input+off); 130 off += 64; 131 } 132 } 133 if (off < len) 134 memcpy(ctx->buffer + have, input+off, (size_t)len-off); 135 } 136 137 void 138 RMD160Final(u_char digest[20], RMD160_CTX *ctx) 139 { 140 int i; 141 u_char size[8]; 142 uint32_t padlen; 143 144 PUT_64BIT_LE(size, ctx->count); 145 146 /* 147 * pad to 64 byte blocks, at least one byte from PADDING plus 8 bytes 148 * for the size 149 */ 150 padlen = (uint32_t)(64 - ((ctx->count/8) % 64)); 151 if (padlen < 1 + 8) 152 padlen += 64; 153 RMD160Update(ctx, PADDING, padlen - 8); /* padlen - 8 <= 64 */ 154 RMD160Update(ctx, size, 8); 155 156 if (digest != NULL) 157 for (i = 0; i < 5; i++) 158 PUT_32BIT_LE(digest + i*4, ctx->state[i]); 159 160 memset(ctx, 0, sizeof (*ctx)); 161 } 162 163 void 164 RMD160Transform(uint32_t state[5], const u_char block[64]) 165 { 166 uint32_t a, b, c, d, e, aa, bb, cc, dd, ee, t, x[16]; 167 168 #if BYTE_ORDER == LITTLE_ENDIAN 169 memcpy(x, block, (size_t)64); 170 #else 171 int i; 172 173 for (i = 0; i < 16; i++) 174 x[i] = le32dec(block+i*4); 175 #endif 176 177 a = state[0]; 178 b = state[1]; 179 c = state[2]; 180 d = state[3]; 181 e = state[4]; 182 183 /* Round 1 */ 184 R(a, b, c, d, e, F0, K0, 11, 0); 185 R(e, a, b, c, d, F0, K0, 14, 1); 186 R(d, e, a, b, c, F0, K0, 15, 2); 187 R(c, d, e, a, b, F0, K0, 12, 3); 188 R(b, c, d, e, a, F0, K0, 5, 4); 189 R(a, b, c, d, e, F0, K0, 8, 5); 190 R(e, a, b, c, d, F0, K0, 7, 6); 191 R(d, e, a, b, c, F0, K0, 9, 7); 192 R(c, d, e, a, b, F0, K0, 11, 8); 193 R(b, c, d, e, a, F0, K0, 13, 9); 194 R(a, b, c, d, e, F0, K0, 14, 10); 195 R(e, a, b, c, d, F0, K0, 15, 11); 196 R(d, e, a, b, c, F0, K0, 6, 12); 197 R(c, d, e, a, b, F0, K0, 7, 13); 198 R(b, c, d, e, a, F0, K0, 9, 14); 199 R(a, b, c, d, e, F0, K0, 8, 15); /* #15 */ 200 /* Round 2 */ 201 R(e, a, b, c, d, F1, K1, 7, 7); 202 R(d, e, a, b, c, F1, K1, 6, 4); 203 R(c, d, e, a, b, F1, K1, 8, 13); 204 R(b, c, d, e, a, F1, K1, 13, 1); 205 R(a, b, c, d, e, F1, K1, 11, 10); 206 R(e, a, b, c, d, F1, K1, 9, 6); 207 R(d, e, a, b, c, F1, K1, 7, 15); 208 R(c, d, e, a, b, F1, K1, 15, 3); 209 R(b, c, d, e, a, F1, K1, 7, 12); 210 R(a, b, c, d, e, F1, K1, 12, 0); 211 R(e, a, b, c, d, F1, K1, 15, 9); 212 R(d, e, a, b, c, F1, K1, 9, 5); 213 R(c, d, e, a, b, F1, K1, 11, 2); 214 R(b, c, d, e, a, F1, K1, 7, 14); 215 R(a, b, c, d, e, F1, K1, 13, 11); 216 R(e, a, b, c, d, F1, K1, 12, 8); /* #31 */ 217 /* Round 3 */ 218 R(d, e, a, b, c, F2, K2, 11, 3); 219 R(c, d, e, a, b, F2, K2, 13, 10); 220 R(b, c, d, e, a, F2, K2, 6, 14); 221 R(a, b, c, d, e, F2, K2, 7, 4); 222 R(e, a, b, c, d, F2, K2, 14, 9); 223 R(d, e, a, b, c, F2, K2, 9, 15); 224 R(c, d, e, a, b, F2, K2, 13, 8); 225 R(b, c, d, e, a, F2, K2, 15, 1); 226 R(a, b, c, d, e, F2, K2, 14, 2); 227 R(e, a, b, c, d, F2, K2, 8, 7); 228 R(d, e, a, b, c, F2, K2, 13, 0); 229 R(c, d, e, a, b, F2, K2, 6, 6); 230 R(b, c, d, e, a, F2, K2, 5, 13); 231 R(a, b, c, d, e, F2, K2, 12, 11); 232 R(e, a, b, c, d, F2, K2, 7, 5); 233 R(d, e, a, b, c, F2, K2, 5, 12); /* #47 */ 234 /* Round 4 */ 235 R(c, d, e, a, b, F3, K3, 11, 1); 236 R(b, c, d, e, a, F3, K3, 12, 9); 237 R(a, b, c, d, e, F3, K3, 14, 11); 238 R(e, a, b, c, d, F3, K3, 15, 10); 239 R(d, e, a, b, c, F3, K3, 14, 0); 240 R(c, d, e, a, b, F3, K3, 15, 8); 241 R(b, c, d, e, a, F3, K3, 9, 12); 242 R(a, b, c, d, e, F3, K3, 8, 4); 243 R(e, a, b, c, d, F3, K3, 9, 13); 244 R(d, e, a, b, c, F3, K3, 14, 3); 245 R(c, d, e, a, b, F3, K3, 5, 7); 246 R(b, c, d, e, a, F3, K3, 6, 15); 247 R(a, b, c, d, e, F3, K3, 8, 14); 248 R(e, a, b, c, d, F3, K3, 6, 5); 249 R(d, e, a, b, c, F3, K3, 5, 6); 250 R(c, d, e, a, b, F3, K3, 12, 2); /* #63 */ 251 /* Round 5 */ 252 R(b, c, d, e, a, F4, K4, 9, 4); 253 R(a, b, c, d, e, F4, K4, 15, 0); 254 R(e, a, b, c, d, F4, K4, 5, 5); 255 R(d, e, a, b, c, F4, K4, 11, 9); 256 R(c, d, e, a, b, F4, K4, 6, 7); 257 R(b, c, d, e, a, F4, K4, 8, 12); 258 R(a, b, c, d, e, F4, K4, 13, 2); 259 R(e, a, b, c, d, F4, K4, 12, 10); 260 R(d, e, a, b, c, F4, K4, 5, 14); 261 R(c, d, e, a, b, F4, K4, 12, 1); 262 R(b, c, d, e, a, F4, K4, 13, 3); 263 R(a, b, c, d, e, F4, K4, 14, 8); 264 R(e, a, b, c, d, F4, K4, 11, 11); 265 R(d, e, a, b, c, F4, K4, 8, 6); 266 R(c, d, e, a, b, F4, K4, 5, 15); 267 R(b, c, d, e, a, F4, K4, 6, 13); /* #79 */ 268 269 aa = a ; bb = b; cc = c; dd = d; ee = e; 270 271 a = state[0]; 272 b = state[1]; 273 c = state[2]; 274 d = state[3]; 275 e = state[4]; 276 277 /* Parallel round 1 */ 278 R(a, b, c, d, e, F4, KK0, 8, 5); 279 R(e, a, b, c, d, F4, KK0, 9, 14); 280 R(d, e, a, b, c, F4, KK0, 9, 7); 281 R(c, d, e, a, b, F4, KK0, 11, 0); 282 R(b, c, d, e, a, F4, KK0, 13, 9); 283 R(a, b, c, d, e, F4, KK0, 15, 2); 284 R(e, a, b, c, d, F4, KK0, 15, 11); 285 R(d, e, a, b, c, F4, KK0, 5, 4); 286 R(c, d, e, a, b, F4, KK0, 7, 13); 287 R(b, c, d, e, a, F4, KK0, 7, 6); 288 R(a, b, c, d, e, F4, KK0, 8, 15); 289 R(e, a, b, c, d, F4, KK0, 11, 8); 290 R(d, e, a, b, c, F4, KK0, 14, 1); 291 R(c, d, e, a, b, F4, KK0, 14, 10); 292 R(b, c, d, e, a, F4, KK0, 12, 3); 293 R(a, b, c, d, e, F4, KK0, 6, 12); /* #15 */ 294 /* Parallel round 2 */ 295 R(e, a, b, c, d, F3, KK1, 9, 6); 296 R(d, e, a, b, c, F3, KK1, 13, 11); 297 R(c, d, e, a, b, F3, KK1, 15, 3); 298 R(b, c, d, e, a, F3, KK1, 7, 7); 299 R(a, b, c, d, e, F3, KK1, 12, 0); 300 R(e, a, b, c, d, F3, KK1, 8, 13); 301 R(d, e, a, b, c, F3, KK1, 9, 5); 302 R(c, d, e, a, b, F3, KK1, 11, 10); 303 R(b, c, d, e, a, F3, KK1, 7, 14); 304 R(a, b, c, d, e, F3, KK1, 7, 15); 305 R(e, a, b, c, d, F3, KK1, 12, 8); 306 R(d, e, a, b, c, F3, KK1, 7, 12); 307 R(c, d, e, a, b, F3, KK1, 6, 4); 308 R(b, c, d, e, a, F3, KK1, 15, 9); 309 R(a, b, c, d, e, F3, KK1, 13, 1); 310 R(e, a, b, c, d, F3, KK1, 11, 2); /* #31 */ 311 /* Parallel round 3 */ 312 R(d, e, a, b, c, F2, KK2, 9, 15); 313 R(c, d, e, a, b, F2, KK2, 7, 5); 314 R(b, c, d, e, a, F2, KK2, 15, 1); 315 R(a, b, c, d, e, F2, KK2, 11, 3); 316 R(e, a, b, c, d, F2, KK2, 8, 7); 317 R(d, e, a, b, c, F2, KK2, 6, 14); 318 R(c, d, e, a, b, F2, KK2, 6, 6); 319 R(b, c, d, e, a, F2, KK2, 14, 9); 320 R(a, b, c, d, e, F2, KK2, 12, 11); 321 R(e, a, b, c, d, F2, KK2, 13, 8); 322 R(d, e, a, b, c, F2, KK2, 5, 12); 323 R(c, d, e, a, b, F2, KK2, 14, 2); 324 R(b, c, d, e, a, F2, KK2, 13, 10); 325 R(a, b, c, d, e, F2, KK2, 13, 0); 326 R(e, a, b, c, d, F2, KK2, 7, 4); 327 R(d, e, a, b, c, F2, KK2, 5, 13); /* #47 */ 328 /* Parallel round 4 */ 329 R(c, d, e, a, b, F1, KK3, 15, 8); 330 R(b, c, d, e, a, F1, KK3, 5, 6); 331 R(a, b, c, d, e, F1, KK3, 8, 4); 332 R(e, a, b, c, d, F1, KK3, 11, 1); 333 R(d, e, a, b, c, F1, KK3, 14, 3); 334 R(c, d, e, a, b, F1, KK3, 14, 11); 335 R(b, c, d, e, a, F1, KK3, 6, 15); 336 R(a, b, c, d, e, F1, KK3, 14, 0); 337 R(e, a, b, c, d, F1, KK3, 6, 5); 338 R(d, e, a, b, c, F1, KK3, 9, 12); 339 R(c, d, e, a, b, F1, KK3, 12, 2); 340 R(b, c, d, e, a, F1, KK3, 9, 13); 341 R(a, b, c, d, e, F1, KK3, 12, 9); 342 R(e, a, b, c, d, F1, KK3, 5, 7); 343 R(d, e, a, b, c, F1, KK3, 15, 10); 344 R(c, d, e, a, b, F1, KK3, 8, 14); /* #63 */ 345 /* Parallel round 5 */ 346 R(b, c, d, e, a, F0, KK4, 8, 12); 347 R(a, b, c, d, e, F0, KK4, 5, 15); 348 R(e, a, b, c, d, F0, KK4, 12, 10); 349 R(d, e, a, b, c, F0, KK4, 9, 4); 350 R(c, d, e, a, b, F0, KK4, 12, 1); 351 R(b, c, d, e, a, F0, KK4, 5, 5); 352 R(a, b, c, d, e, F0, KK4, 14, 8); 353 R(e, a, b, c, d, F0, KK4, 6, 7); 354 R(d, e, a, b, c, F0, KK4, 8, 6); 355 R(c, d, e, a, b, F0, KK4, 13, 2); 356 R(b, c, d, e, a, F0, KK4, 6, 13); 357 R(a, b, c, d, e, F0, KK4, 5, 14); 358 R(e, a, b, c, d, F0, KK4, 15, 0); 359 R(d, e, a, b, c, F0, KK4, 13, 3); 360 R(c, d, e, a, b, F0, KK4, 11, 9); 361 R(b, c, d, e, a, F0, KK4, 11, 11); /* #79 */ 362 363 t = state[1] + cc + d; 364 state[1] = state[2] + dd + e; 365 state[2] = state[3] + ee + a; 366 state[3] = state[4] + aa + b; 367 state[4] = state[0] + bb + c; 368 state[0] = t; 369 } 370