1/* rmd160.c - RIPE-MD160 2 * Copyright (C) 1998, 2001, 2002, 2003 Free Software Foundation, Inc. 3 * 4 * This file is part of Libgcrypt. 5 * 6 * Libgcrypt is free software; you can redistribute it and/or modify 7 * it under the terms of the GNU Lesser General Public License as 8 * published by the Free Software Foundation; either version 2.1 of 9 * the License, or (at your option) any later version. 10 * 11 * Libgcrypt is distributed in the hope that it will be useful, 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 * GNU Lesser General Public License for more details. 15 * 16 * You should have received a copy of the GNU Lesser General Public 17 * License along with this program; if not, write to the Free Software 18 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA 19 */ 20 21#include <config.h> 22#include <stdio.h> 23#include <stdlib.h> 24#include <string.h> 25 26#include "g10lib.h" 27#include "rmd.h" 28#include "cipher.h" /* Only used for the rmd160_hash_buffer() prototype. */ 29 30#include "bithelp.h" 31 32/********************************* 33 * RIPEMD-160 is not patented, see (as of 25.10.97) 34 * http://www.esat.kuleuven.ac.be/~bosselae/ripemd160.html 35 * Note that the code uses Little Endian byteorder, which is good for 36 * 386 etc, but we must add some conversion when used on a big endian box. 37 * 38 * 39 * Pseudo-code for RIPEMD-160 40 * 41 * RIPEMD-160 is an iterative hash function that operates on 32-bit words. 42 * The round function takes as input a 5-word chaining variable and a 16-word 43 * message block and maps this to a new chaining variable. All operations are 44 * defined on 32-bit words. Padding is identical to that of MD4. 45 * 46 * 47 * RIPEMD-160: definitions 48 * 49 * 50 * nonlinear functions at bit level: exor, mux, -, mux, - 51 * 52 * f(j, x, y, z) = x XOR y XOR z (0 <= j <= 15) 53 * f(j, x, y, z) = (x AND y) OR (NOT(x) AND z) (16 <= j <= 31) 54 * f(j, x, y, z) = (x OR NOT(y)) XOR z (32 <= j <= 47) 55 * f(j, x, y, z) = (x AND z) OR (y AND NOT(z)) (48 <= j <= 63) 56 * f(j, x, y, z) = x XOR (y OR NOT(z)) (64 <= j <= 79) 57 * 58 * 59 * added constants (hexadecimal) 60 * 61 * K(j) = 0x00000000 (0 <= j <= 15) 62 * K(j) = 0x5A827999 (16 <= j <= 31) int(2**30 x sqrt(2)) 63 * K(j) = 0x6ED9EBA1 (32 <= j <= 47) int(2**30 x sqrt(3)) 64 * K(j) = 0x8F1BBCDC (48 <= j <= 63) int(2**30 x sqrt(5)) 65 * K(j) = 0xA953FD4E (64 <= j <= 79) int(2**30 x sqrt(7)) 66 * K'(j) = 0x50A28BE6 (0 <= j <= 15) int(2**30 x cbrt(2)) 67 * K'(j) = 0x5C4DD124 (16 <= j <= 31) int(2**30 x cbrt(3)) 68 * K'(j) = 0x6D703EF3 (32 <= j <= 47) int(2**30 x cbrt(5)) 69 * K'(j) = 0x7A6D76E9 (48 <= j <= 63) int(2**30 x cbrt(7)) 70 * K'(j) = 0x00000000 (64 <= j <= 79) 71 * 72 * 73 * selection of message word 74 * 75 * r(j) = j (0 <= j <= 15) 76 * r(16..31) = 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8 77 * r(32..47) = 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12 78 * r(48..63) = 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2 79 * r(64..79) = 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13 80 * r0(0..15) = 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12 81 * r0(16..31)= 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2 82 * r0(32..47)= 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13 83 * r0(48..63)= 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14 84 * r0(64..79)= 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11 85 * 86 * 87 * amount for rotate left (rol) 88 * 89 * s(0..15) = 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8 90 * s(16..31) = 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12 91 * s(32..47) = 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5 92 * s(48..63) = 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12 93 * s(64..79) = 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 94 * s'(0..15) = 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6 95 * s'(16..31)= 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11 96 * s'(32..47)= 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5 97 * s'(48..63)= 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8 98 * s'(64..79)= 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 99 * 100 * 101 * initial value (hexadecimal) 102 * 103 * h0 = 0x67452301; h1 = 0xEFCDAB89; h2 = 0x98BADCFE; h3 = 0x10325476; 104 * h4 = 0xC3D2E1F0; 105 * 106 * 107 * RIPEMD-160: pseudo-code 108 * 109 * It is assumed that the message after padding consists of t 16-word blocks 110 * that will be denoted with X[i][j], with 0 <= i <= t-1 and 0 <= j <= 15. 111 * The symbol [+] denotes addition modulo 2**32 and rol_s denotes cyclic left 112 * shift (rotate) over s positions. 113 * 114 * 115 * for i := 0 to t-1 { 116 * A := h0; B := h1; C := h2; D = h3; E = h4; 117 * A' := h0; B' := h1; C' := h2; D' = h3; E' = h4; 118 * for j := 0 to 79 { 119 * T := rol_s(j)(A [+] f(j, B, C, D) [+] X[i][r(j)] [+] K(j)) [+] E; 120 * A := E; E := D; D := rol_10(C); C := B; B := T; 121 * T := rol_s'(j)(A' [+] f(79-j, B', C', D') [+] X[i][r'(j)] 122 [+] K'(j)) [+] E'; 123 * A' := E'; E' := D'; D' := rol_10(C'); C' := B'; B' := T; 124 * } 125 * T := h1 [+] C [+] D'; h1 := h2 [+] D [+] E'; h2 := h3 [+] E [+] A'; 126 * h3 := h4 [+] A [+] B'; h4 := h0 [+] B [+] C'; h0 := T; 127 * } 128 */ 129 130/* Some examples: 131 * "" 9c1185a5c5e9fc54612808977ee8f548b2258d31 132 * "a" 0bdc9d2d256b3ee9daae347be6f4dc835a467ffe 133 * "abc" 8eb208f7e05d987a9b044a8e98c6b087f15a0bfc 134 * "message digest" 5d0689ef49d2fae572b881b123a85ffa21595f36 135 * "a...z" f71c27109c692c1b56bbdceb5b9d2865b3708dbc 136 * "abcdbcde...nopq" 12a053384a9c0c88e405a06c27dcf49ada62eb2b 137 * "A...Za...z0...9" b0e20b6e3116640286ed3a87a5713079b21f5189 138 * 8 times "1234567890" 9b752e45573d4b39f4dbd3323cab82bf63326bfb 139 * 1 million times "a" 52783243c1697bdbe16d37f97f68f08325dc1528 140 */ 141 142 143void 144_gcry_rmd160_init (void *context) 145{ 146 RMD160_CONTEXT *hd = context; 147 148 hd->h0 = 0x67452301; 149 hd->h1 = 0xEFCDAB89; 150 hd->h2 = 0x98BADCFE; 151 hd->h3 = 0x10325476; 152 hd->h4 = 0xC3D2E1F0; 153 hd->nblocks = 0; 154 hd->count = 0; 155} 156 157 158 159/**************** 160 * Transform the message X which consists of 16 32-bit-words 161 */ 162static void 163transform ( RMD160_CONTEXT *hd, const unsigned char *data ) 164{ 165 register u32 a,b,c,d,e; 166 u32 aa,bb,cc,dd,ee,t; 167#ifdef WORDS_BIGENDIAN 168 u32 x[16]; 169 { 170 int i; 171 byte *p2, *p1; 172 for (i=0, p1=data, p2=(byte*)x; i < 16; i++, p2 += 4 ) 173 { 174 p2[3] = *p1++; 175 p2[2] = *p1++; 176 p2[1] = *p1++; 177 p2[0] = *p1++; 178 } 179 } 180#else 181 /* This version is better because it is always aligned; 182 * The performance penalty on a 586-100 is about 6% which 183 * is acceptable - because the data is more local it might 184 * also be possible that this is faster on some machines. 185 * This function (when compiled with -02 on gcc 2.7.2) 186 * executes on a 586-100 (39.73 bogomips) at about 1900kb/sec; 187 * [measured with a 4MB data and "gpgm --print-md rmd160"] */ 188 u32 x[16]; 189 memcpy( x, data, 64 ); 190#endif 191 192 193#define K0 0x00000000 194#define K1 0x5A827999 195#define K2 0x6ED9EBA1 196#define K3 0x8F1BBCDC 197#define K4 0xA953FD4E 198#define KK0 0x50A28BE6 199#define KK1 0x5C4DD124 200#define KK2 0x6D703EF3 201#define KK3 0x7A6D76E9 202#define KK4 0x00000000 203#define F0(x,y,z) ( (x) ^ (y) ^ (z) ) 204#define F1(x,y,z) ( ((x) & (y)) | (~(x) & (z)) ) 205#define F2(x,y,z) ( ((x) | ~(y)) ^ (z) ) 206#define F3(x,y,z) ( ((x) & (z)) | ((y) & ~(z)) ) 207#define F4(x,y,z) ( (x) ^ ((y) | ~(z)) ) 208#define R(a,b,c,d,e,f,k,r,s) do { t = a + f(b,c,d) + k + x[r]; \ 209 a = rol(t,s) + e; \ 210 c = rol(c,10); \ 211 } while(0) 212 213 /* left lane */ 214 a = hd->h0; 215 b = hd->h1; 216 c = hd->h2; 217 d = hd->h3; 218 e = hd->h4; 219 R( a, b, c, d, e, F0, K0, 0, 11 ); 220 R( e, a, b, c, d, F0, K0, 1, 14 ); 221 R( d, e, a, b, c, F0, K0, 2, 15 ); 222 R( c, d, e, a, b, F0, K0, 3, 12 ); 223 R( b, c, d, e, a, F0, K0, 4, 5 ); 224 R( a, b, c, d, e, F0, K0, 5, 8 ); 225 R( e, a, b, c, d, F0, K0, 6, 7 ); 226 R( d, e, a, b, c, F0, K0, 7, 9 ); 227 R( c, d, e, a, b, F0, K0, 8, 11 ); 228 R( b, c, d, e, a, F0, K0, 9, 13 ); 229 R( a, b, c, d, e, F0, K0, 10, 14 ); 230 R( e, a, b, c, d, F0, K0, 11, 15 ); 231 R( d, e, a, b, c, F0, K0, 12, 6 ); 232 R( c, d, e, a, b, F0, K0, 13, 7 ); 233 R( b, c, d, e, a, F0, K0, 14, 9 ); 234 R( a, b, c, d, e, F0, K0, 15, 8 ); 235 R( e, a, b, c, d, F1, K1, 7, 7 ); 236 R( d, e, a, b, c, F1, K1, 4, 6 ); 237 R( c, d, e, a, b, F1, K1, 13, 8 ); 238 R( b, c, d, e, a, F1, K1, 1, 13 ); 239 R( a, b, c, d, e, F1, K1, 10, 11 ); 240 R( e, a, b, c, d, F1, K1, 6, 9 ); 241 R( d, e, a, b, c, F1, K1, 15, 7 ); 242 R( c, d, e, a, b, F1, K1, 3, 15 ); 243 R( b, c, d, e, a, F1, K1, 12, 7 ); 244 R( a, b, c, d, e, F1, K1, 0, 12 ); 245 R( e, a, b, c, d, F1, K1, 9, 15 ); 246 R( d, e, a, b, c, F1, K1, 5, 9 ); 247 R( c, d, e, a, b, F1, K1, 2, 11 ); 248 R( b, c, d, e, a, F1, K1, 14, 7 ); 249 R( a, b, c, d, e, F1, K1, 11, 13 ); 250 R( e, a, b, c, d, F1, K1, 8, 12 ); 251 R( d, e, a, b, c, F2, K2, 3, 11 ); 252 R( c, d, e, a, b, F2, K2, 10, 13 ); 253 R( b, c, d, e, a, F2, K2, 14, 6 ); 254 R( a, b, c, d, e, F2, K2, 4, 7 ); 255 R( e, a, b, c, d, F2, K2, 9, 14 ); 256 R( d, e, a, b, c, F2, K2, 15, 9 ); 257 R( c, d, e, a, b, F2, K2, 8, 13 ); 258 R( b, c, d, e, a, F2, K2, 1, 15 ); 259 R( a, b, c, d, e, F2, K2, 2, 14 ); 260 R( e, a, b, c, d, F2, K2, 7, 8 ); 261 R( d, e, a, b, c, F2, K2, 0, 13 ); 262 R( c, d, e, a, b, F2, K2, 6, 6 ); 263 R( b, c, d, e, a, F2, K2, 13, 5 ); 264 R( a, b, c, d, e, F2, K2, 11, 12 ); 265 R( e, a, b, c, d, F2, K2, 5, 7 ); 266 R( d, e, a, b, c, F2, K2, 12, 5 ); 267 R( c, d, e, a, b, F3, K3, 1, 11 ); 268 R( b, c, d, e, a, F3, K3, 9, 12 ); 269 R( a, b, c, d, e, F3, K3, 11, 14 ); 270 R( e, a, b, c, d, F3, K3, 10, 15 ); 271 R( d, e, a, b, c, F3, K3, 0, 14 ); 272 R( c, d, e, a, b, F3, K3, 8, 15 ); 273 R( b, c, d, e, a, F3, K3, 12, 9 ); 274 R( a, b, c, d, e, F3, K3, 4, 8 ); 275 R( e, a, b, c, d, F3, K3, 13, 9 ); 276 R( d, e, a, b, c, F3, K3, 3, 14 ); 277 R( c, d, e, a, b, F3, K3, 7, 5 ); 278 R( b, c, d, e, a, F3, K3, 15, 6 ); 279 R( a, b, c, d, e, F3, K3, 14, 8 ); 280 R( e, a, b, c, d, F3, K3, 5, 6 ); 281 R( d, e, a, b, c, F3, K3, 6, 5 ); 282 R( c, d, e, a, b, F3, K3, 2, 12 ); 283 R( b, c, d, e, a, F4, K4, 4, 9 ); 284 R( a, b, c, d, e, F4, K4, 0, 15 ); 285 R( e, a, b, c, d, F4, K4, 5, 5 ); 286 R( d, e, a, b, c, F4, K4, 9, 11 ); 287 R( c, d, e, a, b, F4, K4, 7, 6 ); 288 R( b, c, d, e, a, F4, K4, 12, 8 ); 289 R( a, b, c, d, e, F4, K4, 2, 13 ); 290 R( e, a, b, c, d, F4, K4, 10, 12 ); 291 R( d, e, a, b, c, F4, K4, 14, 5 ); 292 R( c, d, e, a, b, F4, K4, 1, 12 ); 293 R( b, c, d, e, a, F4, K4, 3, 13 ); 294 R( a, b, c, d, e, F4, K4, 8, 14 ); 295 R( e, a, b, c, d, F4, K4, 11, 11 ); 296 R( d, e, a, b, c, F4, K4, 6, 8 ); 297 R( c, d, e, a, b, F4, K4, 15, 5 ); 298 R( b, c, d, e, a, F4, K4, 13, 6 ); 299 300 aa = a; bb = b; cc = c; dd = d; ee = e; 301 302 /* right lane */ 303 a = hd->h0; 304 b = hd->h1; 305 c = hd->h2; 306 d = hd->h3; 307 e = hd->h4; 308 R( a, b, c, d, e, F4, KK0, 5, 8); 309 R( e, a, b, c, d, F4, KK0, 14, 9); 310 R( d, e, a, b, c, F4, KK0, 7, 9); 311 R( c, d, e, a, b, F4, KK0, 0, 11); 312 R( b, c, d, e, a, F4, KK0, 9, 13); 313 R( a, b, c, d, e, F4, KK0, 2, 15); 314 R( e, a, b, c, d, F4, KK0, 11, 15); 315 R( d, e, a, b, c, F4, KK0, 4, 5); 316 R( c, d, e, a, b, F4, KK0, 13, 7); 317 R( b, c, d, e, a, F4, KK0, 6, 7); 318 R( a, b, c, d, e, F4, KK0, 15, 8); 319 R( e, a, b, c, d, F4, KK0, 8, 11); 320 R( d, e, a, b, c, F4, KK0, 1, 14); 321 R( c, d, e, a, b, F4, KK0, 10, 14); 322 R( b, c, d, e, a, F4, KK0, 3, 12); 323 R( a, b, c, d, e, F4, KK0, 12, 6); 324 R( e, a, b, c, d, F3, KK1, 6, 9); 325 R( d, e, a, b, c, F3, KK1, 11, 13); 326 R( c, d, e, a, b, F3, KK1, 3, 15); 327 R( b, c, d, e, a, F3, KK1, 7, 7); 328 R( a, b, c, d, e, F3, KK1, 0, 12); 329 R( e, a, b, c, d, F3, KK1, 13, 8); 330 R( d, e, a, b, c, F3, KK1, 5, 9); 331 R( c, d, e, a, b, F3, KK1, 10, 11); 332 R( b, c, d, e, a, F3, KK1, 14, 7); 333 R( a, b, c, d, e, F3, KK1, 15, 7); 334 R( e, a, b, c, d, F3, KK1, 8, 12); 335 R( d, e, a, b, c, F3, KK1, 12, 7); 336 R( c, d, e, a, b, F3, KK1, 4, 6); 337 R( b, c, d, e, a, F3, KK1, 9, 15); 338 R( a, b, c, d, e, F3, KK1, 1, 13); 339 R( e, a, b, c, d, F3, KK1, 2, 11); 340 R( d, e, a, b, c, F2, KK2, 15, 9); 341 R( c, d, e, a, b, F2, KK2, 5, 7); 342 R( b, c, d, e, a, F2, KK2, 1, 15); 343 R( a, b, c, d, e, F2, KK2, 3, 11); 344 R( e, a, b, c, d, F2, KK2, 7, 8); 345 R( d, e, a, b, c, F2, KK2, 14, 6); 346 R( c, d, e, a, b, F2, KK2, 6, 6); 347 R( b, c, d, e, a, F2, KK2, 9, 14); 348 R( a, b, c, d, e, F2, KK2, 11, 12); 349 R( e, a, b, c, d, F2, KK2, 8, 13); 350 R( d, e, a, b, c, F2, KK2, 12, 5); 351 R( c, d, e, a, b, F2, KK2, 2, 14); 352 R( b, c, d, e, a, F2, KK2, 10, 13); 353 R( a, b, c, d, e, F2, KK2, 0, 13); 354 R( e, a, b, c, d, F2, KK2, 4, 7); 355 R( d, e, a, b, c, F2, KK2, 13, 5); 356 R( c, d, e, a, b, F1, KK3, 8, 15); 357 R( b, c, d, e, a, F1, KK3, 6, 5); 358 R( a, b, c, d, e, F1, KK3, 4, 8); 359 R( e, a, b, c, d, F1, KK3, 1, 11); 360 R( d, e, a, b, c, F1, KK3, 3, 14); 361 R( c, d, e, a, b, F1, KK3, 11, 14); 362 R( b, c, d, e, a, F1, KK3, 15, 6); 363 R( a, b, c, d, e, F1, KK3, 0, 14); 364 R( e, a, b, c, d, F1, KK3, 5, 6); 365 R( d, e, a, b, c, F1, KK3, 12, 9); 366 R( c, d, e, a, b, F1, KK3, 2, 12); 367 R( b, c, d, e, a, F1, KK3, 13, 9); 368 R( a, b, c, d, e, F1, KK3, 9, 12); 369 R( e, a, b, c, d, F1, KK3, 7, 5); 370 R( d, e, a, b, c, F1, KK3, 10, 15); 371 R( c, d, e, a, b, F1, KK3, 14, 8); 372 R( b, c, d, e, a, F0, KK4, 12, 8); 373 R( a, b, c, d, e, F0, KK4, 15, 5); 374 R( e, a, b, c, d, F0, KK4, 10, 12); 375 R( d, e, a, b, c, F0, KK4, 4, 9); 376 R( c, d, e, a, b, F0, KK4, 1, 12); 377 R( b, c, d, e, a, F0, KK4, 5, 5); 378 R( a, b, c, d, e, F0, KK4, 8, 14); 379 R( e, a, b, c, d, F0, KK4, 7, 6); 380 R( d, e, a, b, c, F0, KK4, 6, 8); 381 R( c, d, e, a, b, F0, KK4, 2, 13); 382 R( b, c, d, e, a, F0, KK4, 13, 6); 383 R( a, b, c, d, e, F0, KK4, 14, 5); 384 R( e, a, b, c, d, F0, KK4, 0, 15); 385 R( d, e, a, b, c, F0, KK4, 3, 13); 386 R( c, d, e, a, b, F0, KK4, 9, 11); 387 R( b, c, d, e, a, F0, KK4, 11, 11); 388 389 390 t = hd->h1 + d + cc; 391 hd->h1 = hd->h2 + e + dd; 392 hd->h2 = hd->h3 + a + ee; 393 hd->h3 = hd->h4 + b + aa; 394 hd->h4 = hd->h0 + c + bb; 395 hd->h0 = t; 396} 397 398 399/* Update the message digest with the contents 400 * of INBUF with length INLEN. 401 */ 402static void 403rmd160_write ( void *context, const void *inbuf_arg, size_t inlen) 404{ 405 const unsigned char *inbuf = inbuf_arg; 406 RMD160_CONTEXT *hd = context; 407 408 if( hd->count == 64 ) /* flush the buffer */ 409 { 410 transform( hd, hd->buf ); 411 _gcry_burn_stack (108+5*sizeof(void*)); 412 hd->count = 0; 413 hd->nblocks++; 414 } 415 if( !inbuf ) 416 return; 417 if( hd->count ) 418 { 419 for( ; inlen && hd->count < 64; inlen-- ) 420 hd->buf[hd->count++] = *inbuf++; 421 rmd160_write( hd, NULL, 0 ); 422 if( !inlen ) 423 return; 424 } 425 426 while( inlen >= 64 ) 427 { 428 transform( hd, inbuf ); 429 hd->count = 0; 430 hd->nblocks++; 431 inlen -= 64; 432 inbuf += 64; 433 } 434 _gcry_burn_stack (108+5*sizeof(void*)); 435 for( ; inlen && hd->count < 64; inlen-- ) 436 hd->buf[hd->count++] = *inbuf++; 437} 438 439/**************** 440 * Apply the rmd160 transform function on the buffer which must have 441 * a length 64 bytes. Do not use this function together with the 442 * other functions, use rmd160_init to initialize internal variables. 443 * Returns: 16 bytes in buffer with the mixed contentes of buffer. 444 */ 445void 446_gcry_rmd160_mixblock ( RMD160_CONTEXT *hd, void *blockof64byte ) 447{ 448 char *p = blockof64byte; 449 450 transform ( hd, blockof64byte ); 451#define X(a) do { *(u32*)p = hd->h##a ; p += 4; } while(0) 452 X(0); 453 X(1); 454 X(2); 455 X(3); 456 X(4); 457#undef X 458} 459 460 461/* The routine terminates the computation 462 */ 463 464static void 465rmd160_final( void *context ) 466{ 467 RMD160_CONTEXT *hd = context; 468 u32 t, msb, lsb; 469 byte *p; 470 471 rmd160_write(hd, NULL, 0); /* flush */; 472 473 t = hd->nblocks; 474 /* multiply by 64 to make a byte count */ 475 lsb = t << 6; 476 msb = t >> 26; 477 /* add the count */ 478 t = lsb; 479 if( (lsb += hd->count) < t ) 480 msb++; 481 /* multiply by 8 to make a bit count */ 482 t = lsb; 483 lsb <<= 3; 484 msb <<= 3; 485 msb |= t >> 29; 486 487 if( hd->count < 56 ) /* enough room */ 488 { 489 hd->buf[hd->count++] = 0x80; /* pad */ 490 while( hd->count < 56 ) 491 hd->buf[hd->count++] = 0; /* pad */ 492 } 493 else /* need one extra block */ 494 { 495 hd->buf[hd->count++] = 0x80; /* pad character */ 496 while( hd->count < 64 ) 497 hd->buf[hd->count++] = 0; 498 rmd160_write(hd, NULL, 0); /* flush */; 499 memset(hd->buf, 0, 56 ); /* fill next block with zeroes */ 500 } 501 /* append the 64 bit count */ 502 hd->buf[56] = lsb ; 503 hd->buf[57] = lsb >> 8; 504 hd->buf[58] = lsb >> 16; 505 hd->buf[59] = lsb >> 24; 506 hd->buf[60] = msb ; 507 hd->buf[61] = msb >> 8; 508 hd->buf[62] = msb >> 16; 509 hd->buf[63] = msb >> 24; 510 transform( hd, hd->buf ); 511 _gcry_burn_stack (108+5*sizeof(void*)); 512 513 p = hd->buf; 514#ifdef WORDS_BIGENDIAN 515#define X(a) do { *p++ = hd->h##a ; *p++ = hd->h##a >> 8; \ 516 *p++ = hd->h##a >> 16; *p++ = hd->h##a >> 24; } while(0) 517#else /* little endian */ 518#define X(a) do { *(u32*)p = hd->h##a ; p += 4; } while(0) 519#endif 520 X(0); 521 X(1); 522 X(2); 523 X(3); 524 X(4); 525#undef X 526} 527 528static byte * 529rmd160_read( void *context ) 530{ 531 RMD160_CONTEXT *hd = context; 532 533 return hd->buf; 534} 535 536 537 538/**************** 539 * Shortcut functions which puts the hash value of the supplied buffer 540 * into outbuf which must have a size of 20 bytes. 541 */ 542void 543_gcry_rmd160_hash_buffer (void *outbuf, const void *buffer, size_t length ) 544{ 545 RMD160_CONTEXT hd; 546 547 _gcry_rmd160_init ( &hd ); 548 rmd160_write ( &hd, buffer, length ); 549 rmd160_final ( &hd ); 550 memcpy ( outbuf, hd.buf, 20 ); 551} 552 553static byte asn[15] = /* Object ID is 1.3.36.3.2.1 */ 554 { 0x30, 0x21, 0x30, 0x09, 0x06, 0x05, 0x2b, 0x24, 0x03, 555 0x02, 0x01, 0x05, 0x00, 0x04, 0x14 }; 556 557static gcry_md_oid_spec_t oid_spec_rmd160[] = 558 { 559 /* rsaSignatureWithripemd160 */ 560 { "1.3.36.3.3.1.2" }, 561 /* TeleTrust hash algorithm. */ 562 { "1.3.36.3.2.1" }, 563 { NULL } 564 }; 565 566gcry_md_spec_t _gcry_digest_spec_rmd160 = 567 { 568 "RIPEMD160", asn, DIM (asn), oid_spec_rmd160, 20, 569 _gcry_rmd160_init, rmd160_write, rmd160_final, rmd160_read, 570 sizeof (RMD160_CONTEXT) 571 }; 572