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