1 /* LibTomCrypt, modular cryptographic library -- Tom St Denis
3 * LibTomCrypt is a library that provides various cryptographic
4 * algorithms in a highly modular and flexible manner.
6 * The library is free for all purposes without any express
16 /* Implementation of LTC_RIPEMD-160 based on the source by Antoon Bosselaers, ESAT-COSIC
18 * This source has been radically overhauled to be portable and work within
19 * the LibTomCrypt API by Tom St Denis
24 const struct ltc_hash_descriptor rmd160_desc =
32 { 1, 3, 36, 3, 2, 1, },
42 /* the five basic functions F(), G() and H() */
43 #define F(x, y, z) ((x) ^ (y) ^ (z))
44 #define G(x, y, z) (((x) & (y)) | (~(x) & (z)))
45 #define H(x, y, z) (((x) | ~(y)) ^ (z))
46 #define I(x, y, z) (((x) & (z)) | ((y) & ~(z)))
47 #define J(x, y, z) ((x) ^ ((y) | ~(z)))
49 /* the ten basic operations FF() through III() */
50 #define FF(a, b, c, d, e, x, s) \
51 (a) += F((b), (c), (d)) + (x);\
52 (a) = ROLc((a), (s)) + (e);\
55 #define GG(a, b, c, d, e, x, s) \
56 (a) += G((b), (c), (d)) + (x) + 0x5a827999UL;\
57 (a) = ROLc((a), (s)) + (e);\
60 #define HH(a, b, c, d, e, x, s) \
61 (a) += H((b), (c), (d)) + (x) + 0x6ed9eba1UL;\
62 (a) = ROLc((a), (s)) + (e);\
65 #define II(a, b, c, d, e, x, s) \
66 (a) += I((b), (c), (d)) + (x) + 0x8f1bbcdcUL;\
67 (a) = ROLc((a), (s)) + (e);\
70 #define JJ(a, b, c, d, e, x, s) \
71 (a) += J((b), (c), (d)) + (x) + 0xa953fd4eUL;\
72 (a) = ROLc((a), (s)) + (e);\
75 #define FFF(a, b, c, d, e, x, s) \
76 (a) += F((b), (c), (d)) + (x);\
77 (a) = ROLc((a), (s)) + (e);\
80 #define GGG(a, b, c, d, e, x, s) \
81 (a) += G((b), (c), (d)) + (x) + 0x7a6d76e9UL;\
82 (a) = ROLc((a), (s)) + (e);\
85 #define HHH(a, b, c, d, e, x, s) \
86 (a) += H((b), (c), (d)) + (x) + 0x6d703ef3UL;\
87 (a) = ROLc((a), (s)) + (e);\
90 #define III(a, b, c, d, e, x, s) \
91 (a) += I((b), (c), (d)) + (x) + 0x5c4dd124UL;\
92 (a) = ROLc((a), (s)) + (e);\
95 #define JJJ(a, b, c, d, e, x, s) \
96 (a) += J((b), (c), (d)) + (x) + 0x50a28be6UL;\
97 (a) = ROLc((a), (s)) + (e);\
101 #ifdef LTC_CLEAN_STACK
102 static int _rmd160_compress(hash_state *md, unsigned char *buf)
104 static int rmd160_compress(hash_state *md, unsigned char *buf)
107 ulong32 aa,bb,cc,dd,ee,aaa,bbb,ccc,ddd,eee,X[16];
111 for (i = 0; i < 16; i++){
112 LOAD32L(X[i], buf + (4 * i));
116 aa = aaa = md->rmd160.state[0];
117 bb = bbb = md->rmd160.state[1];
118 cc = ccc = md->rmd160.state[2];
119 dd = ddd = md->rmd160.state[3];
120 ee = eee = md->rmd160.state[4];
123 FF(aa, bb, cc, dd, ee, X[ 0], 11);
124 FF(ee, aa, bb, cc, dd, X[ 1], 14);
125 FF(dd, ee, aa, bb, cc, X[ 2], 15);
126 FF(cc, dd, ee, aa, bb, X[ 3], 12);
127 FF(bb, cc, dd, ee, aa, X[ 4], 5);
128 FF(aa, bb, cc, dd, ee, X[ 5], 8);
129 FF(ee, aa, bb, cc, dd, X[ 6], 7);
130 FF(dd, ee, aa, bb, cc, X[ 7], 9);
131 FF(cc, dd, ee, aa, bb, X[ 8], 11);
132 FF(bb, cc, dd, ee, aa, X[ 9], 13);
133 FF(aa, bb, cc, dd, ee, X[10], 14);
134 FF(ee, aa, bb, cc, dd, X[11], 15);
135 FF(dd, ee, aa, bb, cc, X[12], 6);
136 FF(cc, dd, ee, aa, bb, X[13], 7);
137 FF(bb, cc, dd, ee, aa, X[14], 9);
138 FF(aa, bb, cc, dd, ee, X[15], 8);
141 GG(ee, aa, bb, cc, dd, X[ 7], 7);
142 GG(dd, ee, aa, bb, cc, X[ 4], 6);
143 GG(cc, dd, ee, aa, bb, X[13], 8);
144 GG(bb, cc, dd, ee, aa, X[ 1], 13);
145 GG(aa, bb, cc, dd, ee, X[10], 11);
146 GG(ee, aa, bb, cc, dd, X[ 6], 9);
147 GG(dd, ee, aa, bb, cc, X[15], 7);
148 GG(cc, dd, ee, aa, bb, X[ 3], 15);
149 GG(bb, cc, dd, ee, aa, X[12], 7);
150 GG(aa, bb, cc, dd, ee, X[ 0], 12);
151 GG(ee, aa, bb, cc, dd, X[ 9], 15);
152 GG(dd, ee, aa, bb, cc, X[ 5], 9);
153 GG(cc, dd, ee, aa, bb, X[ 2], 11);
154 GG(bb, cc, dd, ee, aa, X[14], 7);
155 GG(aa, bb, cc, dd, ee, X[11], 13);
156 GG(ee, aa, bb, cc, dd, X[ 8], 12);
159 HH(dd, ee, aa, bb, cc, X[ 3], 11);
160 HH(cc, dd, ee, aa, bb, X[10], 13);
161 HH(bb, cc, dd, ee, aa, X[14], 6);
162 HH(aa, bb, cc, dd, ee, X[ 4], 7);
163 HH(ee, aa, bb, cc, dd, X[ 9], 14);
164 HH(dd, ee, aa, bb, cc, X[15], 9);
165 HH(cc, dd, ee, aa, bb, X[ 8], 13);
166 HH(bb, cc, dd, ee, aa, X[ 1], 15);
167 HH(aa, bb, cc, dd, ee, X[ 2], 14);
168 HH(ee, aa, bb, cc, dd, X[ 7], 8);
169 HH(dd, ee, aa, bb, cc, X[ 0], 13);
170 HH(cc, dd, ee, aa, bb, X[ 6], 6);
171 HH(bb, cc, dd, ee, aa, X[13], 5);
172 HH(aa, bb, cc, dd, ee, X[11], 12);
173 HH(ee, aa, bb, cc, dd, X[ 5], 7);
174 HH(dd, ee, aa, bb, cc, X[12], 5);
177 II(cc, dd, ee, aa, bb, X[ 1], 11);
178 II(bb, cc, dd, ee, aa, X[ 9], 12);
179 II(aa, bb, cc, dd, ee, X[11], 14);
180 II(ee, aa, bb, cc, dd, X[10], 15);
181 II(dd, ee, aa, bb, cc, X[ 0], 14);
182 II(cc, dd, ee, aa, bb, X[ 8], 15);
183 II(bb, cc, dd, ee, aa, X[12], 9);
184 II(aa, bb, cc, dd, ee, X[ 4], 8);
185 II(ee, aa, bb, cc, dd, X[13], 9);
186 II(dd, ee, aa, bb, cc, X[ 3], 14);
187 II(cc, dd, ee, aa, bb, X[ 7], 5);
188 II(bb, cc, dd, ee, aa, X[15], 6);
189 II(aa, bb, cc, dd, ee, X[14], 8);
190 II(ee, aa, bb, cc, dd, X[ 5], 6);
191 II(dd, ee, aa, bb, cc, X[ 6], 5);
192 II(cc, dd, ee, aa, bb, X[ 2], 12);
195 JJ(bb, cc, dd, ee, aa, X[ 4], 9);
196 JJ(aa, bb, cc, dd, ee, X[ 0], 15);
197 JJ(ee, aa, bb, cc, dd, X[ 5], 5);
198 JJ(dd, ee, aa, bb, cc, X[ 9], 11);
199 JJ(cc, dd, ee, aa, bb, X[ 7], 6);
200 JJ(bb, cc, dd, ee, aa, X[12], 8);
201 JJ(aa, bb, cc, dd, ee, X[ 2], 13);
202 JJ(ee, aa, bb, cc, dd, X[10], 12);
203 JJ(dd, ee, aa, bb, cc, X[14], 5);
204 JJ(cc, dd, ee, aa, bb, X[ 1], 12);
205 JJ(bb, cc, dd, ee, aa, X[ 3], 13);
206 JJ(aa, bb, cc, dd, ee, X[ 8], 14);
207 JJ(ee, aa, bb, cc, dd, X[11], 11);
208 JJ(dd, ee, aa, bb, cc, X[ 6], 8);
209 JJ(cc, dd, ee, aa, bb, X[15], 5);
210 JJ(bb, cc, dd, ee, aa, X[13], 6);
212 /* parallel round 1 */
213 JJJ(aaa, bbb, ccc, ddd, eee, X[ 5], 8);
214 JJJ(eee, aaa, bbb, ccc, ddd, X[14], 9);
215 JJJ(ddd, eee, aaa, bbb, ccc, X[ 7], 9);
216 JJJ(ccc, ddd, eee, aaa, bbb, X[ 0], 11);
217 JJJ(bbb, ccc, ddd, eee, aaa, X[ 9], 13);
218 JJJ(aaa, bbb, ccc, ddd, eee, X[ 2], 15);
219 JJJ(eee, aaa, bbb, ccc, ddd, X[11], 15);
220 JJJ(ddd, eee, aaa, bbb, ccc, X[ 4], 5);
221 JJJ(ccc, ddd, eee, aaa, bbb, X[13], 7);
222 JJJ(bbb, ccc, ddd, eee, aaa, X[ 6], 7);
223 JJJ(aaa, bbb, ccc, ddd, eee, X[15], 8);
224 JJJ(eee, aaa, bbb, ccc, ddd, X[ 8], 11);
225 JJJ(ddd, eee, aaa, bbb, ccc, X[ 1], 14);
226 JJJ(ccc, ddd, eee, aaa, bbb, X[10], 14);
227 JJJ(bbb, ccc, ddd, eee, aaa, X[ 3], 12);
228 JJJ(aaa, bbb, ccc, ddd, eee, X[12], 6);
230 /* parallel round 2 */
231 III(eee, aaa, bbb, ccc, ddd, X[ 6], 9);
232 III(ddd, eee, aaa, bbb, ccc, X[11], 13);
233 III(ccc, ddd, eee, aaa, bbb, X[ 3], 15);
234 III(bbb, ccc, ddd, eee, aaa, X[ 7], 7);
235 III(aaa, bbb, ccc, ddd, eee, X[ 0], 12);
236 III(eee, aaa, bbb, ccc, ddd, X[13], 8);
237 III(ddd, eee, aaa, bbb, ccc, X[ 5], 9);
238 III(ccc, ddd, eee, aaa, bbb, X[10], 11);
239 III(bbb, ccc, ddd, eee, aaa, X[14], 7);
240 III(aaa, bbb, ccc, ddd, eee, X[15], 7);
241 III(eee, aaa, bbb, ccc, ddd, X[ 8], 12);
242 III(ddd, eee, aaa, bbb, ccc, X[12], 7);
243 III(ccc, ddd, eee, aaa, bbb, X[ 4], 6);
244 III(bbb, ccc, ddd, eee, aaa, X[ 9], 15);
245 III(aaa, bbb, ccc, ddd, eee, X[ 1], 13);
246 III(eee, aaa, bbb, ccc, ddd, X[ 2], 11);
248 /* parallel round 3 */
249 HHH(ddd, eee, aaa, bbb, ccc, X[15], 9);
250 HHH(ccc, ddd, eee, aaa, bbb, X[ 5], 7);
251 HHH(bbb, ccc, ddd, eee, aaa, X[ 1], 15);
252 HHH(aaa, bbb, ccc, ddd, eee, X[ 3], 11);
253 HHH(eee, aaa, bbb, ccc, ddd, X[ 7], 8);
254 HHH(ddd, eee, aaa, bbb, ccc, X[14], 6);
255 HHH(ccc, ddd, eee, aaa, bbb, X[ 6], 6);
256 HHH(bbb, ccc, ddd, eee, aaa, X[ 9], 14);
257 HHH(aaa, bbb, ccc, ddd, eee, X[11], 12);
258 HHH(eee, aaa, bbb, ccc, ddd, X[ 8], 13);
259 HHH(ddd, eee, aaa, bbb, ccc, X[12], 5);
260 HHH(ccc, ddd, eee, aaa, bbb, X[ 2], 14);
261 HHH(bbb, ccc, ddd, eee, aaa, X[10], 13);
262 HHH(aaa, bbb, ccc, ddd, eee, X[ 0], 13);
263 HHH(eee, aaa, bbb, ccc, ddd, X[ 4], 7);
264 HHH(ddd, eee, aaa, bbb, ccc, X[13], 5);
266 /* parallel round 4 */
267 GGG(ccc, ddd, eee, aaa, bbb, X[ 8], 15);
268 GGG(bbb, ccc, ddd, eee, aaa, X[ 6], 5);
269 GGG(aaa, bbb, ccc, ddd, eee, X[ 4], 8);
270 GGG(eee, aaa, bbb, ccc, ddd, X[ 1], 11);
271 GGG(ddd, eee, aaa, bbb, ccc, X[ 3], 14);
272 GGG(ccc, ddd, eee, aaa, bbb, X[11], 14);
273 GGG(bbb, ccc, ddd, eee, aaa, X[15], 6);
274 GGG(aaa, bbb, ccc, ddd, eee, X[ 0], 14);
275 GGG(eee, aaa, bbb, ccc, ddd, X[ 5], 6);
276 GGG(ddd, eee, aaa, bbb, ccc, X[12], 9);
277 GGG(ccc, ddd, eee, aaa, bbb, X[ 2], 12);
278 GGG(bbb, ccc, ddd, eee, aaa, X[13], 9);
279 GGG(aaa, bbb, ccc, ddd, eee, X[ 9], 12);
280 GGG(eee, aaa, bbb, ccc, ddd, X[ 7], 5);
281 GGG(ddd, eee, aaa, bbb, ccc, X[10], 15);
282 GGG(ccc, ddd, eee, aaa, bbb, X[14], 8);
284 /* parallel round 5 */
285 FFF(bbb, ccc, ddd, eee, aaa, X[12] , 8);
286 FFF(aaa, bbb, ccc, ddd, eee, X[15] , 5);
287 FFF(eee, aaa, bbb, ccc, ddd, X[10] , 12);
288 FFF(ddd, eee, aaa, bbb, ccc, X[ 4] , 9);
289 FFF(ccc, ddd, eee, aaa, bbb, X[ 1] , 12);
290 FFF(bbb, ccc, ddd, eee, aaa, X[ 5] , 5);
291 FFF(aaa, bbb, ccc, ddd, eee, X[ 8] , 14);
292 FFF(eee, aaa, bbb, ccc, ddd, X[ 7] , 6);
293 FFF(ddd, eee, aaa, bbb, ccc, X[ 6] , 8);
294 FFF(ccc, ddd, eee, aaa, bbb, X[ 2] , 13);
295 FFF(bbb, ccc, ddd, eee, aaa, X[13] , 6);
296 FFF(aaa, bbb, ccc, ddd, eee, X[14] , 5);
297 FFF(eee, aaa, bbb, ccc, ddd, X[ 0] , 15);
298 FFF(ddd, eee, aaa, bbb, ccc, X[ 3] , 13);
299 FFF(ccc, ddd, eee, aaa, bbb, X[ 9] , 11);
300 FFF(bbb, ccc, ddd, eee, aaa, X[11] , 11);
302 /* combine results */
303 ddd += cc + md->rmd160.state[1]; /* final result for md->rmd160.state[0] */
304 md->rmd160.state[1] = md->rmd160.state[2] + dd + eee;
305 md->rmd160.state[2] = md->rmd160.state[3] + ee + aaa;
306 md->rmd160.state[3] = md->rmd160.state[4] + aa + bbb;
307 md->rmd160.state[4] = md->rmd160.state[0] + bb + ccc;
308 md->rmd160.state[0] = ddd;
313 #ifdef LTC_CLEAN_STACK
314 static int rmd160_compress(hash_state *md, unsigned char *buf)
317 err = _rmd160_compress(md, buf);
318 burn_stack(sizeof(ulong32) * 26 + sizeof(int));
324 Initialize the hash state
325 @param md The hash state you wish to initialize
326 @return CRYPT_OK if successful
328 int rmd160_init(hash_state * md)
330 LTC_ARGCHK(md != NULL);
331 md->rmd160.state[0] = 0x67452301UL;
332 md->rmd160.state[1] = 0xefcdab89UL;
333 md->rmd160.state[2] = 0x98badcfeUL;
334 md->rmd160.state[3] = 0x10325476UL;
335 md->rmd160.state[4] = 0xc3d2e1f0UL;
336 md->rmd160.curlen = 0;
337 md->rmd160.length = 0;
342 Process a block of memory though the hash
343 @param md The hash state
344 @param in The data to hash
345 @param inlen The length of the data (octets)
346 @return CRYPT_OK if successful
348 HASH_PROCESS(rmd160_process, rmd160_compress, rmd160, 64)
351 Terminate the hash to get the digest
352 @param md The hash state
353 @param out [out] The destination of the hash (20 bytes)
354 @return CRYPT_OK if successful
356 int rmd160_done(hash_state * md, unsigned char *out)
360 LTC_ARGCHK(md != NULL);
361 LTC_ARGCHK(out != NULL);
363 if (md->rmd160.curlen >= sizeof(md->rmd160.buf)) {
364 return CRYPT_INVALID_ARG;
368 /* increase the length of the message */
369 md->rmd160.length += md->rmd160.curlen * 8;
371 /* append the '1' bit */
372 md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0x80;
374 /* if the length is currently above 56 bytes we append zeros
375 * then compress. Then we can fall back to padding zeros and length
376 * encoding like normal.
378 if (md->rmd160.curlen > 56) {
379 while (md->rmd160.curlen < 64) {
380 md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0;
382 rmd160_compress(md, md->rmd160.buf);
383 md->rmd160.curlen = 0;
386 /* pad upto 56 bytes of zeroes */
387 while (md->rmd160.curlen < 56) {
388 md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0;
392 STORE64L(md->rmd160.length, md->rmd160.buf+56);
393 rmd160_compress(md, md->rmd160.buf);
396 for (i = 0; i < 5; i++) {
397 STORE32L(md->rmd160.state[i], out+(4*i));
399 #ifdef LTC_CLEAN_STACK
400 zeromem(md, sizeof(hash_state));
407 @return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
409 int rmd160_test(void)
414 static const struct {
416 unsigned char hash[20];
419 { 0x9c, 0x11, 0x85, 0xa5, 0xc5, 0xe9, 0xfc, 0x54, 0x61, 0x28,
420 0x08, 0x97, 0x7e, 0xe8, 0xf5, 0x48, 0xb2, 0x25, 0x8d, 0x31 }
423 { 0x0b, 0xdc, 0x9d, 0x2d, 0x25, 0x6b, 0x3e, 0xe9, 0xda, 0xae,
424 0x34, 0x7b, 0xe6, 0xf4, 0xdc, 0x83, 0x5a, 0x46, 0x7f, 0xfe }
427 { 0x8e, 0xb2, 0x08, 0xf7, 0xe0, 0x5d, 0x98, 0x7a, 0x9b, 0x04,
428 0x4a, 0x8e, 0x98, 0xc6, 0xb0, 0x87, 0xf1, 0x5a, 0x0b, 0xfc }
431 { 0x5d, 0x06, 0x89, 0xef, 0x49, 0xd2, 0xfa, 0xe5, 0x72, 0xb8,
432 0x81, 0xb1, 0x23, 0xa8, 0x5f, 0xfa, 0x21, 0x59, 0x5f, 0x36 }
434 { "abcdefghijklmnopqrstuvwxyz",
435 { 0xf7, 0x1c, 0x27, 0x10, 0x9c, 0x69, 0x2c, 0x1b, 0x56, 0xbb,
436 0xdc, 0xeb, 0x5b, 0x9d, 0x28, 0x65, 0xb3, 0x70, 0x8d, 0xbc }
438 { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq",
439 { 0x12, 0xa0, 0x53, 0x38, 0x4a, 0x9c, 0x0c, 0x88, 0xe4, 0x05,
440 0xa0, 0x6c, 0x27, 0xdc, 0xf4, 0x9a, 0xda, 0x62, 0xeb, 0x2b }
445 unsigned char tmp[20];
448 for (i = 0; i < (int)(sizeof(tests)/sizeof(tests[0])); i++) {
450 rmd160_process(&md, (unsigned char *)tests[i].msg, strlen(tests[i].msg));
451 rmd160_done(&md, tmp);
452 if (compare_testvector(tmp, sizeof(tmp), tests[i].hash, sizeof(tests[i].hash), "RIPEMD160", i)) {
453 return CRYPT_FAIL_TESTVECTOR;
463 /* ref: $Format:%D$ */
464 /* git commit: $Format:%H$ */
465 /* commit time: $Format:%ai$ */