1 /* 2 * Copyright (c) 2001 Markus Friedl. All rights reserved. 3 * 4 * Redistribution and use in source and binary forms, with or without 5 * modification, are permitted provided that the following conditions 6 * are met: 7 * 1. Redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer. 9 * 2. Redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution. 12 * 13 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 14 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 15 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 16 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 17 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 18 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 19 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 20 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 21 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 22 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 23 */ 24 /* 25 * Preneel, Bosselaers, Dobbertin, "The Cryptographic Hash Function RIPEMD-160", 26 * RSA Laboratories, CryptoBytes, Volume 3, Number 2, Autumn 1997, 27 * ftp://ftp.rsasecurity.com/pub/cryptobytes/crypto3n2.pdf 28 */ 29 #include <sys/types.h> 30 #include <endian.h> 31 #include <string.h> 32 #include <rmd160.h> 33 34 #define PUT_64BIT_LE(cp, value) do { \ 35 (cp)[7] = (value) >> 56; \ 36 (cp)[6] = (value) >> 48; \ 37 (cp)[5] = (value) >> 40; \ 38 (cp)[4] = (value) >> 32; \ 39 (cp)[3] = (value) >> 24; \ 40 (cp)[2] = (value) >> 16; \ 41 (cp)[1] = (value) >> 8; \ 42 (cp)[0] = (value); } while (0) 43 44 #define PUT_32BIT_LE(cp, value) do { \ 45 (cp)[3] = (value) >> 24; \ 46 (cp)[2] = (value) >> 16; \ 47 (cp)[1] = (value) >> 8; \ 48 (cp)[0] = (value); } while (0) 49 50 #define H0 0x67452301U 51 #define H1 0xEFCDAB89U 52 #define H2 0x98BADCFEU 53 #define H3 0x10325476U 54 #define H4 0xC3D2E1F0U 55 56 #define K0 0x00000000U 57 #define K1 0x5A827999U 58 #define K2 0x6ED9EBA1U 59 #define K3 0x8F1BBCDCU 60 #define K4 0xA953FD4EU 61 62 #define KK0 0x50A28BE6U 63 #define KK1 0x5C4DD124U 64 #define KK2 0x6D703EF3U 65 #define KK3 0x7A6D76E9U 66 #define KK4 0x00000000U 67 68 /* rotate x left n bits. */ 69 #define ROL(n, x) (((x) << (n)) | ((x) >> (32-(n)))) 70 71 #define F0(x, y, z) ((x) ^ (y) ^ (z)) 72 #define F1(x, y, z) (((x) & (y)) | ((~x) & (z))) 73 #define F2(x, y, z) (((x) | (~y)) ^ (z)) 74 #define F3(x, y, z) (((x) & (z)) | ((y) & (~z))) 75 #define F4(x, y, z) ((x) ^ ((y) | (~z))) 76 77 #define R(a, b, c, d, e, Fj, Kj, sj, rj) \ 78 do { \ 79 a = ROL(sj, a + Fj(b,c,d) + X(rj) + Kj) + e; \ 80 c = ROL(10, c); \ 81 } while(0) 82 83 #define X(i) x[i] 84 85 static u_int8_t PADDING[RMD160_BLOCK_LENGTH] = { 86 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 87 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 88 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 89 }; 90 91 void 92 RMD160Init(RMD160_CTX *ctx) 93 { 94 ctx->count = 0; 95 ctx->state[0] = H0; 96 ctx->state[1] = H1; 97 ctx->state[2] = H2; 98 ctx->state[3] = H3; 99 ctx->state[4] = H4; 100 } 101 102 void 103 RMD160Update(RMD160_CTX *ctx, const u_int8_t *input, size_t len) 104 { 105 size_t have, off, need; 106 107 have = (ctx->count / 8) % RMD160_BLOCK_LENGTH; 108 need = RMD160_BLOCK_LENGTH - have; 109 ctx->count += 8 * len; 110 off = 0; 111 112 if (len >= need) { 113 if (have) { 114 memcpy(ctx->buffer + have, input, need); 115 RMD160Transform(ctx->state, ctx->buffer); 116 off = need; 117 have = 0; 118 } 119 /* now the buffer is empty */ 120 while (off + RMD160_BLOCK_LENGTH <= len) { 121 RMD160Transform(ctx->state, input+off); 122 off += RMD160_BLOCK_LENGTH; 123 } 124 } 125 if (off < len) 126 memcpy(ctx->buffer + have, input+off, len-off); 127 } 128 129 void 130 RMD160Pad(RMD160_CTX *ctx) 131 { 132 u_int8_t size[8]; 133 size_t padlen; 134 135 PUT_64BIT_LE(size, ctx->count); 136 137 /* 138 * pad to RMD160_BLOCK_LENGTH byte blocks, at least one byte from 139 * PADDING plus 8 bytes for the size 140 */ 141 padlen = RMD160_BLOCK_LENGTH - ((ctx->count / 8) % RMD160_BLOCK_LENGTH); 142 if (padlen < 1 + 8) 143 padlen += RMD160_BLOCK_LENGTH; 144 RMD160Update(ctx, PADDING, padlen - 8); /* padlen - 8 <= 64 */ 145 RMD160Update(ctx, size, 8); 146 } 147 148 void 149 RMD160Final(u_int8_t digest[RMD160_DIGEST_LENGTH], RMD160_CTX *ctx) 150 { 151 int i; 152 153 RMD160Pad(ctx); 154 for (i = 0; i < 5; i++) 155 PUT_32BIT_LE(digest + i*4, ctx->state[i]); 156 explicit_bzero(ctx, sizeof (*ctx)); 157 } 158 159 void 160 RMD160Transform(u_int32_t state[5], const u_int8_t block[RMD160_BLOCK_LENGTH]) 161 { 162 u_int32_t a, b, c, d, e, aa, bb, cc, dd, ee, t, x[16]; 163 164 #if BYTE_ORDER == LITTLE_ENDIAN 165 memcpy(x, block, RMD160_BLOCK_LENGTH); 166 #else 167 int i; 168 169 for (i = 0; i < 16; i++) 170 x[i] = (u_int32_t)( 171 (u_int32_t)(block[i*4 + 0]) | 172 (u_int32_t)(block[i*4 + 1]) << 8 | 173 (u_int32_t)(block[i*4 + 2]) << 16 | 174 (u_int32_t)(block[i*4 + 3]) << 24); 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