Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
wine-mirror
GitHub Repository: wine-mirror/wine
Path: blob/master/libs/tomcrypt/src/hashes/rmd256.c
5971 views
1
/* LibTomCrypt, modular cryptographic library -- Tom St Denis
2
*
3
* LibTomCrypt is a library that provides various cryptographic
4
* algorithms in a highly modular and flexible manner.
5
*
6
* The library is free for all purposes without any express
7
* guarantee it works.
8
*/
9
#include "tomcrypt.h"
10
11
/**
12
@param rmd256.c
13
RLTC_MD256 Hash function
14
*/
15
16
#ifdef LTC_RIPEMD256
17
18
const struct ltc_hash_descriptor rmd256_desc =
19
{
20
"rmd256",
21
13,
22
32,
23
64,
24
25
/* OID */
26
{ 1, 3, 36, 3, 2, 3 },
27
6,
28
29
&rmd256_init,
30
&rmd256_process,
31
&rmd256_done,
32
&rmd256_test,
33
NULL
34
};
35
36
/* the four basic functions F(), G() and H() */
37
#define F(x, y, z) ((x) ^ (y) ^ (z))
38
#define G(x, y, z) (((x) & (y)) | (~(x) & (z)))
39
#define H(x, y, z) (((x) | ~(y)) ^ (z))
40
#define I(x, y, z) (((x) & (z)) | ((y) & ~(z)))
41
42
/* the eight basic operations FF() through III() */
43
#define FF(a, b, c, d, x, s) \
44
(a) += F((b), (c), (d)) + (x);\
45
(a) = ROLc((a), (s));
46
47
#define GG(a, b, c, d, x, s) \
48
(a) += G((b), (c), (d)) + (x) + 0x5a827999UL;\
49
(a) = ROLc((a), (s));
50
51
#define HH(a, b, c, d, x, s) \
52
(a) += H((b), (c), (d)) + (x) + 0x6ed9eba1UL;\
53
(a) = ROLc((a), (s));
54
55
#define II(a, b, c, d, x, s) \
56
(a) += I((b), (c), (d)) + (x) + 0x8f1bbcdcUL;\
57
(a) = ROLc((a), (s));
58
59
#define FFF(a, b, c, d, x, s) \
60
(a) += F((b), (c), (d)) + (x);\
61
(a) = ROLc((a), (s));
62
63
#define GGG(a, b, c, d, x, s) \
64
(a) += G((b), (c), (d)) + (x) + 0x6d703ef3UL;\
65
(a) = ROLc((a), (s));
66
67
#define HHH(a, b, c, d, x, s) \
68
(a) += H((b), (c), (d)) + (x) + 0x5c4dd124UL;\
69
(a) = ROLc((a), (s));
70
71
#define III(a, b, c, d, x, s) \
72
(a) += I((b), (c), (d)) + (x) + 0x50a28be6UL;\
73
(a) = ROLc((a), (s));
74
75
#ifdef LTC_CLEAN_STACK
76
static int _rmd256_compress(hash_state *md, unsigned char *buf)
77
#else
78
static int rmd256_compress(hash_state *md, unsigned char *buf)
79
#endif
80
{
81
ulong32 aa,bb,cc,dd,aaa,bbb,ccc,ddd,tmp,X[16];
82
int i;
83
84
/* load words X */
85
for (i = 0; i < 16; i++){
86
LOAD32L(X[i], buf + (4 * i));
87
}
88
89
/* load state */
90
aa = md->rmd256.state[0];
91
bb = md->rmd256.state[1];
92
cc = md->rmd256.state[2];
93
dd = md->rmd256.state[3];
94
aaa = md->rmd256.state[4];
95
bbb = md->rmd256.state[5];
96
ccc = md->rmd256.state[6];
97
ddd = md->rmd256.state[7];
98
99
/* round 1 */
100
FF(aa, bb, cc, dd, X[ 0], 11);
101
FF(dd, aa, bb, cc, X[ 1], 14);
102
FF(cc, dd, aa, bb, X[ 2], 15);
103
FF(bb, cc, dd, aa, X[ 3], 12);
104
FF(aa, bb, cc, dd, X[ 4], 5);
105
FF(dd, aa, bb, cc, X[ 5], 8);
106
FF(cc, dd, aa, bb, X[ 6], 7);
107
FF(bb, cc, dd, aa, X[ 7], 9);
108
FF(aa, bb, cc, dd, X[ 8], 11);
109
FF(dd, aa, bb, cc, X[ 9], 13);
110
FF(cc, dd, aa, bb, X[10], 14);
111
FF(bb, cc, dd, aa, X[11], 15);
112
FF(aa, bb, cc, dd, X[12], 6);
113
FF(dd, aa, bb, cc, X[13], 7);
114
FF(cc, dd, aa, bb, X[14], 9);
115
FF(bb, cc, dd, aa, X[15], 8);
116
117
/* parallel round 1 */
118
III(aaa, bbb, ccc, ddd, X[ 5], 8);
119
III(ddd, aaa, bbb, ccc, X[14], 9);
120
III(ccc, ddd, aaa, bbb, X[ 7], 9);
121
III(bbb, ccc, ddd, aaa, X[ 0], 11);
122
III(aaa, bbb, ccc, ddd, X[ 9], 13);
123
III(ddd, aaa, bbb, ccc, X[ 2], 15);
124
III(ccc, ddd, aaa, bbb, X[11], 15);
125
III(bbb, ccc, ddd, aaa, X[ 4], 5);
126
III(aaa, bbb, ccc, ddd, X[13], 7);
127
III(ddd, aaa, bbb, ccc, X[ 6], 7);
128
III(ccc, ddd, aaa, bbb, X[15], 8);
129
III(bbb, ccc, ddd, aaa, X[ 8], 11);
130
III(aaa, bbb, ccc, ddd, X[ 1], 14);
131
III(ddd, aaa, bbb, ccc, X[10], 14);
132
III(ccc, ddd, aaa, bbb, X[ 3], 12);
133
III(bbb, ccc, ddd, aaa, X[12], 6);
134
135
tmp = aa; aa = aaa; aaa = tmp;
136
137
/* round 2 */
138
GG(aa, bb, cc, dd, X[ 7], 7);
139
GG(dd, aa, bb, cc, X[ 4], 6);
140
GG(cc, dd, aa, bb, X[13], 8);
141
GG(bb, cc, dd, aa, X[ 1], 13);
142
GG(aa, bb, cc, dd, X[10], 11);
143
GG(dd, aa, bb, cc, X[ 6], 9);
144
GG(cc, dd, aa, bb, X[15], 7);
145
GG(bb, cc, dd, aa, X[ 3], 15);
146
GG(aa, bb, cc, dd, X[12], 7);
147
GG(dd, aa, bb, cc, X[ 0], 12);
148
GG(cc, dd, aa, bb, X[ 9], 15);
149
GG(bb, cc, dd, aa, X[ 5], 9);
150
GG(aa, bb, cc, dd, X[ 2], 11);
151
GG(dd, aa, bb, cc, X[14], 7);
152
GG(cc, dd, aa, bb, X[11], 13);
153
GG(bb, cc, dd, aa, X[ 8], 12);
154
155
/* parallel round 2 */
156
HHH(aaa, bbb, ccc, ddd, X[ 6], 9);
157
HHH(ddd, aaa, bbb, ccc, X[11], 13);
158
HHH(ccc, ddd, aaa, bbb, X[ 3], 15);
159
HHH(bbb, ccc, ddd, aaa, X[ 7], 7);
160
HHH(aaa, bbb, ccc, ddd, X[ 0], 12);
161
HHH(ddd, aaa, bbb, ccc, X[13], 8);
162
HHH(ccc, ddd, aaa, bbb, X[ 5], 9);
163
HHH(bbb, ccc, ddd, aaa, X[10], 11);
164
HHH(aaa, bbb, ccc, ddd, X[14], 7);
165
HHH(ddd, aaa, bbb, ccc, X[15], 7);
166
HHH(ccc, ddd, aaa, bbb, X[ 8], 12);
167
HHH(bbb, ccc, ddd, aaa, X[12], 7);
168
HHH(aaa, bbb, ccc, ddd, X[ 4], 6);
169
HHH(ddd, aaa, bbb, ccc, X[ 9], 15);
170
HHH(ccc, ddd, aaa, bbb, X[ 1], 13);
171
HHH(bbb, ccc, ddd, aaa, X[ 2], 11);
172
173
tmp = bb; bb = bbb; bbb = tmp;
174
175
/* round 3 */
176
HH(aa, bb, cc, dd, X[ 3], 11);
177
HH(dd, aa, bb, cc, X[10], 13);
178
HH(cc, dd, aa, bb, X[14], 6);
179
HH(bb, cc, dd, aa, X[ 4], 7);
180
HH(aa, bb, cc, dd, X[ 9], 14);
181
HH(dd, aa, bb, cc, X[15], 9);
182
HH(cc, dd, aa, bb, X[ 8], 13);
183
HH(bb, cc, dd, aa, X[ 1], 15);
184
HH(aa, bb, cc, dd, X[ 2], 14);
185
HH(dd, aa, bb, cc, X[ 7], 8);
186
HH(cc, dd, aa, bb, X[ 0], 13);
187
HH(bb, cc, dd, aa, X[ 6], 6);
188
HH(aa, bb, cc, dd, X[13], 5);
189
HH(dd, aa, bb, cc, X[11], 12);
190
HH(cc, dd, aa, bb, X[ 5], 7);
191
HH(bb, cc, dd, aa, X[12], 5);
192
193
/* parallel round 3 */
194
GGG(aaa, bbb, ccc, ddd, X[15], 9);
195
GGG(ddd, aaa, bbb, ccc, X[ 5], 7);
196
GGG(ccc, ddd, aaa, bbb, X[ 1], 15);
197
GGG(bbb, ccc, ddd, aaa, X[ 3], 11);
198
GGG(aaa, bbb, ccc, ddd, X[ 7], 8);
199
GGG(ddd, aaa, bbb, ccc, X[14], 6);
200
GGG(ccc, ddd, aaa, bbb, X[ 6], 6);
201
GGG(bbb, ccc, ddd, aaa, X[ 9], 14);
202
GGG(aaa, bbb, ccc, ddd, X[11], 12);
203
GGG(ddd, aaa, bbb, ccc, X[ 8], 13);
204
GGG(ccc, ddd, aaa, bbb, X[12], 5);
205
GGG(bbb, ccc, ddd, aaa, X[ 2], 14);
206
GGG(aaa, bbb, ccc, ddd, X[10], 13);
207
GGG(ddd, aaa, bbb, ccc, X[ 0], 13);
208
GGG(ccc, ddd, aaa, bbb, X[ 4], 7);
209
GGG(bbb, ccc, ddd, aaa, X[13], 5);
210
211
tmp = cc; cc = ccc; ccc = tmp;
212
213
/* round 4 */
214
II(aa, bb, cc, dd, X[ 1], 11);
215
II(dd, aa, bb, cc, X[ 9], 12);
216
II(cc, dd, aa, bb, X[11], 14);
217
II(bb, cc, dd, aa, X[10], 15);
218
II(aa, bb, cc, dd, X[ 0], 14);
219
II(dd, aa, bb, cc, X[ 8], 15);
220
II(cc, dd, aa, bb, X[12], 9);
221
II(bb, cc, dd, aa, X[ 4], 8);
222
II(aa, bb, cc, dd, X[13], 9);
223
II(dd, aa, bb, cc, X[ 3], 14);
224
II(cc, dd, aa, bb, X[ 7], 5);
225
II(bb, cc, dd, aa, X[15], 6);
226
II(aa, bb, cc, dd, X[14], 8);
227
II(dd, aa, bb, cc, X[ 5], 6);
228
II(cc, dd, aa, bb, X[ 6], 5);
229
II(bb, cc, dd, aa, X[ 2], 12);
230
231
/* parallel round 4 */
232
FFF(aaa, bbb, ccc, ddd, X[ 8], 15);
233
FFF(ddd, aaa, bbb, ccc, X[ 6], 5);
234
FFF(ccc, ddd, aaa, bbb, X[ 4], 8);
235
FFF(bbb, ccc, ddd, aaa, X[ 1], 11);
236
FFF(aaa, bbb, ccc, ddd, X[ 3], 14);
237
FFF(ddd, aaa, bbb, ccc, X[11], 14);
238
FFF(ccc, ddd, aaa, bbb, X[15], 6);
239
FFF(bbb, ccc, ddd, aaa, X[ 0], 14);
240
FFF(aaa, bbb, ccc, ddd, X[ 5], 6);
241
FFF(ddd, aaa, bbb, ccc, X[12], 9);
242
FFF(ccc, ddd, aaa, bbb, X[ 2], 12);
243
FFF(bbb, ccc, ddd, aaa, X[13], 9);
244
FFF(aaa, bbb, ccc, ddd, X[ 9], 12);
245
FFF(ddd, aaa, bbb, ccc, X[ 7], 5);
246
FFF(ccc, ddd, aaa, bbb, X[10], 15);
247
FFF(bbb, ccc, ddd, aaa, X[14], 8);
248
249
tmp = dd; dd = ddd; ddd = tmp;
250
251
/* combine results */
252
md->rmd256.state[0] += aa;
253
md->rmd256.state[1] += bb;
254
md->rmd256.state[2] += cc;
255
md->rmd256.state[3] += dd;
256
md->rmd256.state[4] += aaa;
257
md->rmd256.state[5] += bbb;
258
md->rmd256.state[6] += ccc;
259
md->rmd256.state[7] += ddd;
260
261
return CRYPT_OK;
262
}
263
264
#ifdef LTC_CLEAN_STACK
265
static int rmd256_compress(hash_state *md, unsigned char *buf)
266
{
267
int err;
268
err = _rmd256_compress(md, buf);
269
burn_stack(sizeof(ulong32) * 25 + sizeof(int));
270
return err;
271
}
272
#endif
273
274
/**
275
Initialize the hash state
276
@param md The hash state you wish to initialize
277
@return CRYPT_OK if successful
278
*/
279
int rmd256_init(hash_state * md)
280
{
281
LTC_ARGCHK(md != NULL);
282
md->rmd256.state[0] = 0x67452301UL;
283
md->rmd256.state[1] = 0xefcdab89UL;
284
md->rmd256.state[2] = 0x98badcfeUL;
285
md->rmd256.state[3] = 0x10325476UL;
286
md->rmd256.state[4] = 0x76543210UL;
287
md->rmd256.state[5] = 0xfedcba98UL;
288
md->rmd256.state[6] = 0x89abcdefUL;
289
md->rmd256.state[7] = 0x01234567UL;
290
md->rmd256.curlen = 0;
291
md->rmd256.length = 0;
292
return CRYPT_OK;
293
}
294
295
/**
296
Process a block of memory though the hash
297
@param md The hash state
298
@param in The data to hash
299
@param inlen The length of the data (octets)
300
@return CRYPT_OK if successful
301
*/
302
HASH_PROCESS(rmd256_process, rmd256_compress, rmd256, 64)
303
304
/**
305
Terminate the hash to get the digest
306
@param md The hash state
307
@param out [out] The destination of the hash (16 bytes)
308
@return CRYPT_OK if successful
309
*/
310
int rmd256_done(hash_state * md, unsigned char *out)
311
{
312
int i;
313
314
LTC_ARGCHK(md != NULL);
315
LTC_ARGCHK(out != NULL);
316
317
if (md->rmd256.curlen >= sizeof(md->rmd256.buf)) {
318
return CRYPT_INVALID_ARG;
319
}
320
321
322
/* increase the length of the message */
323
md->rmd256.length += md->rmd256.curlen * 8;
324
325
/* append the '1' bit */
326
md->rmd256.buf[md->rmd256.curlen++] = (unsigned char)0x80;
327
328
/* if the length is currently above 56 bytes we append zeros
329
* then compress. Then we can fall back to padding zeros and length
330
* encoding like normal.
331
*/
332
if (md->rmd256.curlen > 56) {
333
while (md->rmd256.curlen < 64) {
334
md->rmd256.buf[md->rmd256.curlen++] = (unsigned char)0;
335
}
336
rmd256_compress(md, md->rmd256.buf);
337
md->rmd256.curlen = 0;
338
}
339
340
/* pad upto 56 bytes of zeroes */
341
while (md->rmd256.curlen < 56) {
342
md->rmd256.buf[md->rmd256.curlen++] = (unsigned char)0;
343
}
344
345
/* store length */
346
STORE64L(md->rmd256.length, md->rmd256.buf+56);
347
rmd256_compress(md, md->rmd256.buf);
348
349
/* copy output */
350
for (i = 0; i < 8; i++) {
351
STORE32L(md->rmd256.state[i], out+(4*i));
352
}
353
#ifdef LTC_CLEAN_STACK
354
zeromem(md, sizeof(hash_state));
355
#endif
356
return CRYPT_OK;
357
}
358
359
/**
360
Self-test the hash
361
@return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
362
*/
363
int rmd256_test(void)
364
{
365
#ifndef LTC_TEST
366
return CRYPT_NOP;
367
#else
368
static const struct {
369
const char *msg;
370
unsigned char hash[32];
371
} tests[] = {
372
{ "",
373
{ 0x02, 0xba, 0x4c, 0x4e, 0x5f, 0x8e, 0xcd, 0x18,
374
0x77, 0xfc, 0x52, 0xd6, 0x4d, 0x30, 0xe3, 0x7a,
375
0x2d, 0x97, 0x74, 0xfb, 0x1e, 0x5d, 0x02, 0x63,
376
0x80, 0xae, 0x01, 0x68, 0xe3, 0xc5, 0x52, 0x2d }
377
},
378
{ "a",
379
{ 0xf9, 0x33, 0x3e, 0x45, 0xd8, 0x57, 0xf5, 0xd9,
380
0x0a, 0x91, 0xba, 0xb7, 0x0a, 0x1e, 0xba, 0x0c,
381
0xfb, 0x1b, 0xe4, 0xb0, 0x78, 0x3c, 0x9a, 0xcf,
382
0xcd, 0x88, 0x3a, 0x91, 0x34, 0x69, 0x29, 0x25 }
383
},
384
{ "abc",
385
{ 0xaf, 0xbd, 0x6e, 0x22, 0x8b, 0x9d, 0x8c, 0xbb,
386
0xce, 0xf5, 0xca, 0x2d, 0x03, 0xe6, 0xdb, 0xa1,
387
0x0a, 0xc0, 0xbc, 0x7d, 0xcb, 0xe4, 0x68, 0x0e,
388
0x1e, 0x42, 0xd2, 0xe9, 0x75, 0x45, 0x9b, 0x65 }
389
},
390
{ "message digest",
391
{ 0x87, 0xe9, 0x71, 0x75, 0x9a, 0x1c, 0xe4, 0x7a,
392
0x51, 0x4d, 0x5c, 0x91, 0x4c, 0x39, 0x2c, 0x90,
393
0x18, 0xc7, 0xc4, 0x6b, 0xc1, 0x44, 0x65, 0x55,
394
0x4a, 0xfc, 0xdf, 0x54, 0xa5, 0x07, 0x0c, 0x0e }
395
},
396
{ "abcdefghijklmnopqrstuvwxyz",
397
{ 0x64, 0x9d, 0x30, 0x34, 0x75, 0x1e, 0xa2, 0x16,
398
0x77, 0x6b, 0xf9, 0xa1, 0x8a, 0xcc, 0x81, 0xbc,
399
0x78, 0x96, 0x11, 0x8a, 0x51, 0x97, 0x96, 0x87,
400
0x82, 0xdd, 0x1f, 0xd9, 0x7d, 0x8d, 0x51, 0x33 }
401
},
402
{ "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
403
{ 0x57, 0x40, 0xa4, 0x08, 0xac, 0x16, 0xb7, 0x20,
404
0xb8, 0x44, 0x24, 0xae, 0x93, 0x1c, 0xbb, 0x1f,
405
0xe3, 0x63, 0xd1, 0xd0, 0xbf, 0x40, 0x17, 0xf1,
406
0xa8, 0x9f, 0x7e, 0xa6, 0xde, 0x77, 0xa0, 0xb8 }
407
}
408
};
409
410
int i;
411
unsigned char tmp[32];
412
hash_state md;
413
414
for (i = 0; i < (int)(sizeof(tests)/sizeof(tests[0])); i++) {
415
rmd256_init(&md);
416
rmd256_process(&md, (unsigned char *)tests[i].msg, strlen(tests[i].msg));
417
rmd256_done(&md, tmp);
418
if (compare_testvector(tmp, sizeof(tmp), tests[i].hash, sizeof(tests[i].hash), "RIPEMD256", i)) {
419
return CRYPT_FAIL_TESTVECTOR;
420
}
421
}
422
return CRYPT_OK;
423
#endif
424
}
425
426
#endif
427
428