![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to rmd160.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [truecrypt] / truecrypt / crypto|
Return to rmd160.c CVS log | Up to [truecrypt] / truecrypt / crypto |
1.1 root 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:
1.1.1.2 ! root 30: #include "Rmd160.h"
! 31: #include "../Common/Endian.h"
1.1 root 32: #include <memory.h>
33:
34: #define PUT_64BIT_LE(cp, value) do { \
35: (cp)[7] = (unsigned char)((value) >> 56); \
36: (cp)[6] = (unsigned char)((value) >> 48); \
37: (cp)[5] = (unsigned char)((value) >> 40); \
38: (cp)[4] = (unsigned char)((value) >> 32); \
39: (cp)[3] = (unsigned char)((value) >> 24); \
40: (cp)[2] = (unsigned char)((value) >> 16); \
41: (cp)[1] = (unsigned char)((value) >> 8); \
42: (cp)[0] = (unsigned char)(value); } while (0)
43:
44: #define PUT_32BIT_LE(cp, value) do { \
45: (cp)[3] = (unsigned char)((value) >> 24); \
46: (cp)[2] = (unsigned char)((value) >> 16); \
47: (cp)[1] = (unsigned char)((value) >> 8); \
48: (cp)[0] = (unsigned char)(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_char PADDING[64] = {
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_char *input, u_int32_t len)
104: {
105: u_int32_t have, off, need;
106:
1.1.1.2 ! root 107: have = (unsigned __int32)((ctx->count/8) % 64);
1.1 root 108: need = 64 - 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 + 64 <= len) {
121: RMD160Transform(ctx->state, input+off);
122: off += 64;
123: }
124: }
125: if (off < len)
126: memcpy(ctx->buffer + have, input+off, len-off);
127: }
128:
129: void
130: RMD160Final(u_char digest[20], RMD160_CTX *ctx)
131: {
132: int i;
133: u_char size[8];
134: u_int32_t padlen;
135:
136: PUT_64BIT_LE(size, ctx->count);
137:
138: /*
139: * pad to 64 byte blocks, at least one byte from PADDING plus 8 bytes
140: * for the size
141: */
1.1.1.2 ! root 142: padlen = (unsigned __int32)(64 - ((ctx->count/8) % 64));
1.1 root 143: if (padlen < 1 + 8)
144: padlen += 64;
145: RMD160Update(ctx, PADDING, padlen - 8); /* padlen - 8 <= 64 */
146: RMD160Update(ctx, size, 8);
147:
148: if (digest != 0)
149: for (i = 0; i < 5; i++)
150: PUT_32BIT_LE(digest + i*4, ctx->state[i]);
151:
152: memset(ctx, 0, sizeof (*ctx));
153: }
154:
155: void
156: RMD160Transform(u_int32_t state[5], const u_char block[64])
157: {
158: u_int32_t a, b, c, d, e, aa, bb, cc, dd, ee, t, x[16];
159:
160: #if BYTE_ORDER == LITTLE_ENDIAN
161: memcpy(x, block, 64);
162: #else
163: int i;
164:
165: for (i = 0; i < 16; i++)
166: x[i] = (u_int32_t)(
167: (u_int32_t)(block[i*4 + 0]) |
168: (u_int32_t)(block[i*4 + 1]) << 8 |
169: (u_int32_t)(block[i*4 + 2]) << 16 |
170: (u_int32_t)(block[i*4 + 3]) << 24);
171: #endif
172:
173: a = state[0];
174: b = state[1];
175: c = state[2];
176: d = state[3];
177: e = state[4];
178:
179: /* Round 1 */
180: R(a, b, c, d, e, F0, K0, 11, 0);
181: R(e, a, b, c, d, F0, K0, 14, 1);
182: R(d, e, a, b, c, F0, K0, 15, 2);
183: R(c, d, e, a, b, F0, K0, 12, 3);
184: R(b, c, d, e, a, F0, K0, 5, 4);
185: R(a, b, c, d, e, F0, K0, 8, 5);
186: R(e, a, b, c, d, F0, K0, 7, 6);
187: R(d, e, a, b, c, F0, K0, 9, 7);
188: R(c, d, e, a, b, F0, K0, 11, 8);
189: R(b, c, d, e, a, F0, K0, 13, 9);
190: R(a, b, c, d, e, F0, K0, 14, 10);
191: R(e, a, b, c, d, F0, K0, 15, 11);
192: R(d, e, a, b, c, F0, K0, 6, 12);
193: R(c, d, e, a, b, F0, K0, 7, 13);
194: R(b, c, d, e, a, F0, K0, 9, 14);
195: R(a, b, c, d, e, F0, K0, 8, 15); /* #15 */
196: /* Round 2 */
197: R(e, a, b, c, d, F1, K1, 7, 7);
198: R(d, e, a, b, c, F1, K1, 6, 4);
199: R(c, d, e, a, b, F1, K1, 8, 13);
200: R(b, c, d, e, a, F1, K1, 13, 1);
201: R(a, b, c, d, e, F1, K1, 11, 10);
202: R(e, a, b, c, d, F1, K1, 9, 6);
203: R(d, e, a, b, c, F1, K1, 7, 15);
204: R(c, d, e, a, b, F1, K1, 15, 3);
205: R(b, c, d, e, a, F1, K1, 7, 12);
206: R(a, b, c, d, e, F1, K1, 12, 0);
207: R(e, a, b, c, d, F1, K1, 15, 9);
208: R(d, e, a, b, c, F1, K1, 9, 5);
209: R(c, d, e, a, b, F1, K1, 11, 2);
210: R(b, c, d, e, a, F1, K1, 7, 14);
211: R(a, b, c, d, e, F1, K1, 13, 11);
212: R(e, a, b, c, d, F1, K1, 12, 8); /* #31 */
213: /* Round 3 */
214: R(d, e, a, b, c, F2, K2, 11, 3);
215: R(c, d, e, a, b, F2, K2, 13, 10);
216: R(b, c, d, e, a, F2, K2, 6, 14);
217: R(a, b, c, d, e, F2, K2, 7, 4);
218: R(e, a, b, c, d, F2, K2, 14, 9);
219: R(d, e, a, b, c, F2, K2, 9, 15);
220: R(c, d, e, a, b, F2, K2, 13, 8);
221: R(b, c, d, e, a, F2, K2, 15, 1);
222: R(a, b, c, d, e, F2, K2, 14, 2);
223: R(e, a, b, c, d, F2, K2, 8, 7);
224: R(d, e, a, b, c, F2, K2, 13, 0);
225: R(c, d, e, a, b, F2, K2, 6, 6);
226: R(b, c, d, e, a, F2, K2, 5, 13);
227: R(a, b, c, d, e, F2, K2, 12, 11);
228: R(e, a, b, c, d, F2, K2, 7, 5);
229: R(d, e, a, b, c, F2, K2, 5, 12); /* #47 */
230: /* Round 4 */
231: R(c, d, e, a, b, F3, K3, 11, 1);
232: R(b, c, d, e, a, F3, K3, 12, 9);
233: R(a, b, c, d, e, F3, K3, 14, 11);
234: R(e, a, b, c, d, F3, K3, 15, 10);
235: R(d, e, a, b, c, F3, K3, 14, 0);
236: R(c, d, e, a, b, F3, K3, 15, 8);
237: R(b, c, d, e, a, F3, K3, 9, 12);
238: R(a, b, c, d, e, F3, K3, 8, 4);
239: R(e, a, b, c, d, F3, K3, 9, 13);
240: R(d, e, a, b, c, F3, K3, 14, 3);
241: R(c, d, e, a, b, F3, K3, 5, 7);
242: R(b, c, d, e, a, F3, K3, 6, 15);
243: R(a, b, c, d, e, F3, K3, 8, 14);
244: R(e, a, b, c, d, F3, K3, 6, 5);
245: R(d, e, a, b, c, F3, K3, 5, 6);
246: R(c, d, e, a, b, F3, K3, 12, 2); /* #63 */
247: /* Round 5 */
248: R(b, c, d, e, a, F4, K4, 9, 4);
249: R(a, b, c, d, e, F4, K4, 15, 0);
250: R(e, a, b, c, d, F4, K4, 5, 5);
251: R(d, e, a, b, c, F4, K4, 11, 9);
252: R(c, d, e, a, b, F4, K4, 6, 7);
253: R(b, c, d, e, a, F4, K4, 8, 12);
254: R(a, b, c, d, e, F4, K4, 13, 2);
255: R(e, a, b, c, d, F4, K4, 12, 10);
256: R(d, e, a, b, c, F4, K4, 5, 14);
257: R(c, d, e, a, b, F4, K4, 12, 1);
258: R(b, c, d, e, a, F4, K4, 13, 3);
259: R(a, b, c, d, e, F4, K4, 14, 8);
260: R(e, a, b, c, d, F4, K4, 11, 11);
261: R(d, e, a, b, c, F4, K4, 8, 6);
262: R(c, d, e, a, b, F4, K4, 5, 15);
263: R(b, c, d, e, a, F4, K4, 6, 13); /* #79 */
264:
265: aa = a ; bb = b; cc = c; dd = d; ee = e;
266:
267: a = state[0];
268: b = state[1];
269: c = state[2];
270: d = state[3];
271: e = state[4];
272:
273: /* Parallel round 1 */
274: R(a, b, c, d, e, F4, KK0, 8, 5);
275: R(e, a, b, c, d, F4, KK0, 9, 14);
276: R(d, e, a, b, c, F4, KK0, 9, 7);
277: R(c, d, e, a, b, F4, KK0, 11, 0);
278: R(b, c, d, e, a, F4, KK0, 13, 9);
279: R(a, b, c, d, e, F4, KK0, 15, 2);
280: R(e, a, b, c, d, F4, KK0, 15, 11);
281: R(d, e, a, b, c, F4, KK0, 5, 4);
282: R(c, d, e, a, b, F4, KK0, 7, 13);
283: R(b, c, d, e, a, F4, KK0, 7, 6);
284: R(a, b, c, d, e, F4, KK0, 8, 15);
285: R(e, a, b, c, d, F4, KK0, 11, 8);
286: R(d, e, a, b, c, F4, KK0, 14, 1);
287: R(c, d, e, a, b, F4, KK0, 14, 10);
288: R(b, c, d, e, a, F4, KK0, 12, 3);
289: R(a, b, c, d, e, F4, KK0, 6, 12); /* #15 */
290: /* Parallel round 2 */
291: R(e, a, b, c, d, F3, KK1, 9, 6);
292: R(d, e, a, b, c, F3, KK1, 13, 11);
293: R(c, d, e, a, b, F3, KK1, 15, 3);
294: R(b, c, d, e, a, F3, KK1, 7, 7);
295: R(a, b, c, d, e, F3, KK1, 12, 0);
296: R(e, a, b, c, d, F3, KK1, 8, 13);
297: R(d, e, a, b, c, F3, KK1, 9, 5);
298: R(c, d, e, a, b, F3, KK1, 11, 10);
299: R(b, c, d, e, a, F3, KK1, 7, 14);
300: R(a, b, c, d, e, F3, KK1, 7, 15);
301: R(e, a, b, c, d, F3, KK1, 12, 8);
302: R(d, e, a, b, c, F3, KK1, 7, 12);
303: R(c, d, e, a, b, F3, KK1, 6, 4);
304: R(b, c, d, e, a, F3, KK1, 15, 9);
305: R(a, b, c, d, e, F3, KK1, 13, 1);
306: R(e, a, b, c, d, F3, KK1, 11, 2); /* #31 */
307: /* Parallel round 3 */
308: R(d, e, a, b, c, F2, KK2, 9, 15);
309: R(c, d, e, a, b, F2, KK2, 7, 5);
310: R(b, c, d, e, a, F2, KK2, 15, 1);
311: R(a, b, c, d, e, F2, KK2, 11, 3);
312: R(e, a, b, c, d, F2, KK2, 8, 7);
313: R(d, e, a, b, c, F2, KK2, 6, 14);
314: R(c, d, e, a, b, F2, KK2, 6, 6);
315: R(b, c, d, e, a, F2, KK2, 14, 9);
316: R(a, b, c, d, e, F2, KK2, 12, 11);
317: R(e, a, b, c, d, F2, KK2, 13, 8);
318: R(d, e, a, b, c, F2, KK2, 5, 12);
319: R(c, d, e, a, b, F2, KK2, 14, 2);
320: R(b, c, d, e, a, F2, KK2, 13, 10);
321: R(a, b, c, d, e, F2, KK2, 13, 0);
322: R(e, a, b, c, d, F2, KK2, 7, 4);
323: R(d, e, a, b, c, F2, KK2, 5, 13); /* #47 */
324: /* Parallel round 4 */
325: R(c, d, e, a, b, F1, KK3, 15, 8);
326: R(b, c, d, e, a, F1, KK3, 5, 6);
327: R(a, b, c, d, e, F1, KK3, 8, 4);
328: R(e, a, b, c, d, F1, KK3, 11, 1);
329: R(d, e, a, b, c, F1, KK3, 14, 3);
330: R(c, d, e, a, b, F1, KK3, 14, 11);
331: R(b, c, d, e, a, F1, KK3, 6, 15);
332: R(a, b, c, d, e, F1, KK3, 14, 0);
333: R(e, a, b, c, d, F1, KK3, 6, 5);
334: R(d, e, a, b, c, F1, KK3, 9, 12);
335: R(c, d, e, a, b, F1, KK3, 12, 2);
336: R(b, c, d, e, a, F1, KK3, 9, 13);
337: R(a, b, c, d, e, F1, KK3, 12, 9);
338: R(e, a, b, c, d, F1, KK3, 5, 7);
339: R(d, e, a, b, c, F1, KK3, 15, 10);
340: R(c, d, e, a, b, F1, KK3, 8, 14); /* #63 */
341: /* Parallel round 5 */
342: R(b, c, d, e, a, F0, KK4, 8, 12);
343: R(a, b, c, d, e, F0, KK4, 5, 15);
344: R(e, a, b, c, d, F0, KK4, 12, 10);
345: R(d, e, a, b, c, F0, KK4, 9, 4);
346: R(c, d, e, a, b, F0, KK4, 12, 1);
347: R(b, c, d, e, a, F0, KK4, 5, 5);
348: R(a, b, c, d, e, F0, KK4, 14, 8);
349: R(e, a, b, c, d, F0, KK4, 6, 7);
350: R(d, e, a, b, c, F0, KK4, 8, 6);
351: R(c, d, e, a, b, F0, KK4, 13, 2);
352: R(b, c, d, e, a, F0, KK4, 6, 13);
353: R(a, b, c, d, e, F0, KK4, 5, 14);
354: R(e, a, b, c, d, F0, KK4, 15, 0);
355: R(d, e, a, b, c, F0, KK4, 13, 3);
356: R(c, d, e, a, b, F0, KK4, 11, 9);
357: R(b, c, d, e, a, F0, KK4, 11, 11); /* #79 */
358:
359: t = state[1] + cc + d;
360: state[1] = state[2] + dd + e;
361: state[2] = state[3] + ee + a;
362: state[3] = state[4] + aa + b;
363: state[4] = state[0] + bb + c;
364: state[0] = t;
365: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.