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-128 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 rmd128_desc =
32 { 1, 0, 10118, 3, 0, 50 },
42 /* the four 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)))
48 /* the eight basic operations FF() through III() */
49 #define FF(a, b, c, d, x, s) \
50 (a) += F((b), (c), (d)) + (x);\
53 #define GG(a, b, c, d, x, s) \
54 (a) += G((b), (c), (d)) + (x) + 0x5a827999UL;\
57 #define HH(a, b, c, d, x, s) \
58 (a) += H((b), (c), (d)) + (x) + 0x6ed9eba1UL;\
61 #define II(a, b, c, d, x, s) \
62 (a) += I((b), (c), (d)) + (x) + 0x8f1bbcdcUL;\
65 #define FFF(a, b, c, d, x, s) \
66 (a) += F((b), (c), (d)) + (x);\
69 #define GGG(a, b, c, d, x, s) \
70 (a) += G((b), (c), (d)) + (x) + 0x6d703ef3UL;\
73 #define HHH(a, b, c, d, x, s) \
74 (a) += H((b), (c), (d)) + (x) + 0x5c4dd124UL;\
77 #define III(a, b, c, d, x, s) \
78 (a) += I((b), (c), (d)) + (x) + 0x50a28be6UL;\
81 #ifdef LTC_CLEAN_STACK
82 static int _rmd128_compress(hash_state *md, unsigned char *buf)
84 static int rmd128_compress(hash_state *md, unsigned char *buf)
87 ulong32 aa,bb,cc,dd,aaa,bbb,ccc,ddd,X[16];
91 for (i = 0; i < 16; i++){
92 LOAD32L(X[i], buf + (4 * i));
96 aa = aaa = md->rmd128.state[0];
97 bb = bbb = md->rmd128.state[1];
98 cc = ccc = md->rmd128.state[2];
99 dd = ddd = md->rmd128.state[3];
102 FF(aa, bb, cc, dd, X[ 0], 11);
103 FF(dd, aa, bb, cc, X[ 1], 14);
104 FF(cc, dd, aa, bb, X[ 2], 15);
105 FF(bb, cc, dd, aa, X[ 3], 12);
106 FF(aa, bb, cc, dd, X[ 4], 5);
107 FF(dd, aa, bb, cc, X[ 5], 8);
108 FF(cc, dd, aa, bb, X[ 6], 7);
109 FF(bb, cc, dd, aa, X[ 7], 9);
110 FF(aa, bb, cc, dd, X[ 8], 11);
111 FF(dd, aa, bb, cc, X[ 9], 13);
112 FF(cc, dd, aa, bb, X[10], 14);
113 FF(bb, cc, dd, aa, X[11], 15);
114 FF(aa, bb, cc, dd, X[12], 6);
115 FF(dd, aa, bb, cc, X[13], 7);
116 FF(cc, dd, aa, bb, X[14], 9);
117 FF(bb, cc, dd, aa, X[15], 8);
120 GG(aa, bb, cc, dd, X[ 7], 7);
121 GG(dd, aa, bb, cc, X[ 4], 6);
122 GG(cc, dd, aa, bb, X[13], 8);
123 GG(bb, cc, dd, aa, X[ 1], 13);
124 GG(aa, bb, cc, dd, X[10], 11);
125 GG(dd, aa, bb, cc, X[ 6], 9);
126 GG(cc, dd, aa, bb, X[15], 7);
127 GG(bb, cc, dd, aa, X[ 3], 15);
128 GG(aa, bb, cc, dd, X[12], 7);
129 GG(dd, aa, bb, cc, X[ 0], 12);
130 GG(cc, dd, aa, bb, X[ 9], 15);
131 GG(bb, cc, dd, aa, X[ 5], 9);
132 GG(aa, bb, cc, dd, X[ 2], 11);
133 GG(dd, aa, bb, cc, X[14], 7);
134 GG(cc, dd, aa, bb, X[11], 13);
135 GG(bb, cc, dd, aa, X[ 8], 12);
138 HH(aa, bb, cc, dd, X[ 3], 11);
139 HH(dd, aa, bb, cc, X[10], 13);
140 HH(cc, dd, aa, bb, X[14], 6);
141 HH(bb, cc, dd, aa, X[ 4], 7);
142 HH(aa, bb, cc, dd, X[ 9], 14);
143 HH(dd, aa, bb, cc, X[15], 9);
144 HH(cc, dd, aa, bb, X[ 8], 13);
145 HH(bb, cc, dd, aa, X[ 1], 15);
146 HH(aa, bb, cc, dd, X[ 2], 14);
147 HH(dd, aa, bb, cc, X[ 7], 8);
148 HH(cc, dd, aa, bb, X[ 0], 13);
149 HH(bb, cc, dd, aa, X[ 6], 6);
150 HH(aa, bb, cc, dd, X[13], 5);
151 HH(dd, aa, bb, cc, X[11], 12);
152 HH(cc, dd, aa, bb, X[ 5], 7);
153 HH(bb, cc, dd, aa, X[12], 5);
156 II(aa, bb, cc, dd, X[ 1], 11);
157 II(dd, aa, bb, cc, X[ 9], 12);
158 II(cc, dd, aa, bb, X[11], 14);
159 II(bb, cc, dd, aa, X[10], 15);
160 II(aa, bb, cc, dd, X[ 0], 14);
161 II(dd, aa, bb, cc, X[ 8], 15);
162 II(cc, dd, aa, bb, X[12], 9);
163 II(bb, cc, dd, aa, X[ 4], 8);
164 II(aa, bb, cc, dd, X[13], 9);
165 II(dd, aa, bb, cc, X[ 3], 14);
166 II(cc, dd, aa, bb, X[ 7], 5);
167 II(bb, cc, dd, aa, X[15], 6);
168 II(aa, bb, cc, dd, X[14], 8);
169 II(dd, aa, bb, cc, X[ 5], 6);
170 II(cc, dd, aa, bb, X[ 6], 5);
171 II(bb, cc, dd, aa, X[ 2], 12);
173 /* parallel round 1 */
174 III(aaa, bbb, ccc, ddd, X[ 5], 8);
175 III(ddd, aaa, bbb, ccc, X[14], 9);
176 III(ccc, ddd, aaa, bbb, X[ 7], 9);
177 III(bbb, ccc, ddd, aaa, X[ 0], 11);
178 III(aaa, bbb, ccc, ddd, X[ 9], 13);
179 III(ddd, aaa, bbb, ccc, X[ 2], 15);
180 III(ccc, ddd, aaa, bbb, X[11], 15);
181 III(bbb, ccc, ddd, aaa, X[ 4], 5);
182 III(aaa, bbb, ccc, ddd, X[13], 7);
183 III(ddd, aaa, bbb, ccc, X[ 6], 7);
184 III(ccc, ddd, aaa, bbb, X[15], 8);
185 III(bbb, ccc, ddd, aaa, X[ 8], 11);
186 III(aaa, bbb, ccc, ddd, X[ 1], 14);
187 III(ddd, aaa, bbb, ccc, X[10], 14);
188 III(ccc, ddd, aaa, bbb, X[ 3], 12);
189 III(bbb, ccc, ddd, aaa, X[12], 6);
191 /* parallel round 2 */
192 HHH(aaa, bbb, ccc, ddd, X[ 6], 9);
193 HHH(ddd, aaa, bbb, ccc, X[11], 13);
194 HHH(ccc, ddd, aaa, bbb, X[ 3], 15);
195 HHH(bbb, ccc, ddd, aaa, X[ 7], 7);
196 HHH(aaa, bbb, ccc, ddd, X[ 0], 12);
197 HHH(ddd, aaa, bbb, ccc, X[13], 8);
198 HHH(ccc, ddd, aaa, bbb, X[ 5], 9);
199 HHH(bbb, ccc, ddd, aaa, X[10], 11);
200 HHH(aaa, bbb, ccc, ddd, X[14], 7);
201 HHH(ddd, aaa, bbb, ccc, X[15], 7);
202 HHH(ccc, ddd, aaa, bbb, X[ 8], 12);
203 HHH(bbb, ccc, ddd, aaa, X[12], 7);
204 HHH(aaa, bbb, ccc, ddd, X[ 4], 6);
205 HHH(ddd, aaa, bbb, ccc, X[ 9], 15);
206 HHH(ccc, ddd, aaa, bbb, X[ 1], 13);
207 HHH(bbb, ccc, ddd, aaa, X[ 2], 11);
209 /* parallel round 3 */
210 GGG(aaa, bbb, ccc, ddd, X[15], 9);
211 GGG(ddd, aaa, bbb, ccc, X[ 5], 7);
212 GGG(ccc, ddd, aaa, bbb, X[ 1], 15);
213 GGG(bbb, ccc, ddd, aaa, X[ 3], 11);
214 GGG(aaa, bbb, ccc, ddd, X[ 7], 8);
215 GGG(ddd, aaa, bbb, ccc, X[14], 6);
216 GGG(ccc, ddd, aaa, bbb, X[ 6], 6);
217 GGG(bbb, ccc, ddd, aaa, X[ 9], 14);
218 GGG(aaa, bbb, ccc, ddd, X[11], 12);
219 GGG(ddd, aaa, bbb, ccc, X[ 8], 13);
220 GGG(ccc, ddd, aaa, bbb, X[12], 5);
221 GGG(bbb, ccc, ddd, aaa, X[ 2], 14);
222 GGG(aaa, bbb, ccc, ddd, X[10], 13);
223 GGG(ddd, aaa, bbb, ccc, X[ 0], 13);
224 GGG(ccc, ddd, aaa, bbb, X[ 4], 7);
225 GGG(bbb, ccc, ddd, aaa, X[13], 5);
227 /* parallel round 4 */
228 FFF(aaa, bbb, ccc, ddd, X[ 8], 15);
229 FFF(ddd, aaa, bbb, ccc, X[ 6], 5);
230 FFF(ccc, ddd, aaa, bbb, X[ 4], 8);
231 FFF(bbb, ccc, ddd, aaa, X[ 1], 11);
232 FFF(aaa, bbb, ccc, ddd, X[ 3], 14);
233 FFF(ddd, aaa, bbb, ccc, X[11], 14);
234 FFF(ccc, ddd, aaa, bbb, X[15], 6);
235 FFF(bbb, ccc, ddd, aaa, X[ 0], 14);
236 FFF(aaa, bbb, ccc, ddd, X[ 5], 6);
237 FFF(ddd, aaa, bbb, ccc, X[12], 9);
238 FFF(ccc, ddd, aaa, bbb, X[ 2], 12);
239 FFF(bbb, ccc, ddd, aaa, X[13], 9);
240 FFF(aaa, bbb, ccc, ddd, X[ 9], 12);
241 FFF(ddd, aaa, bbb, ccc, X[ 7], 5);
242 FFF(ccc, ddd, aaa, bbb, X[10], 15);
243 FFF(bbb, ccc, ddd, aaa, X[14], 8);
245 /* combine results */
246 ddd += cc + md->rmd128.state[1]; /* final result for MDbuf[0] */
247 md->rmd128.state[1] = md->rmd128.state[2] + dd + aaa;
248 md->rmd128.state[2] = md->rmd128.state[3] + aa + bbb;
249 md->rmd128.state[3] = md->rmd128.state[0] + bb + ccc;
250 md->rmd128.state[0] = ddd;
255 #ifdef LTC_CLEAN_STACK
256 static int rmd128_compress(hash_state *md, unsigned char *buf)
259 err = _rmd128_compress(md, buf);
260 burn_stack(sizeof(ulong32) * 24 + sizeof(int));
266 Initialize the hash state
267 @param md The hash state you wish to initialize
268 @return CRYPT_OK if successful
270 int rmd128_init(hash_state * md)
272 LTC_ARGCHK(md != NULL);
273 md->rmd128.state[0] = 0x67452301UL;
274 md->rmd128.state[1] = 0xefcdab89UL;
275 md->rmd128.state[2] = 0x98badcfeUL;
276 md->rmd128.state[3] = 0x10325476UL;
277 md->rmd128.curlen = 0;
278 md->rmd128.length = 0;
283 Process a block of memory though the hash
284 @param md The hash state
285 @param in The data to hash
286 @param inlen The length of the data (octets)
287 @return CRYPT_OK if successful
289 HASH_PROCESS(rmd128_process, rmd128_compress, rmd128, 64)
292 Terminate the hash to get the digest
293 @param md The hash state
294 @param out [out] The destination of the hash (16 bytes)
295 @return CRYPT_OK if successful
297 int rmd128_done(hash_state * md, unsigned char *out)
301 LTC_ARGCHK(md != NULL);
302 LTC_ARGCHK(out != NULL);
304 if (md->rmd128.curlen >= sizeof(md->rmd128.buf)) {
305 return CRYPT_INVALID_ARG;
309 /* increase the length of the message */
310 md->rmd128.length += md->rmd128.curlen * 8;
312 /* append the '1' bit */
313 md->rmd128.buf[md->rmd128.curlen++] = (unsigned char)0x80;
315 /* if the length is currently above 56 bytes we append zeros
316 * then compress. Then we can fall back to padding zeros and length
317 * encoding like normal.
319 if (md->rmd128.curlen > 56) {
320 while (md->rmd128.curlen < 64) {
321 md->rmd128.buf[md->rmd128.curlen++] = (unsigned char)0;
323 rmd128_compress(md, md->rmd128.buf);
324 md->rmd128.curlen = 0;
327 /* pad upto 56 bytes of zeroes */
328 while (md->rmd128.curlen < 56) {
329 md->rmd128.buf[md->rmd128.curlen++] = (unsigned char)0;
333 STORE64L(md->rmd128.length, md->rmd128.buf+56);
334 rmd128_compress(md, md->rmd128.buf);
337 for (i = 0; i < 4; i++) {
338 STORE32L(md->rmd128.state[i], out+(4*i));
340 #ifdef LTC_CLEAN_STACK
341 zeromem(md, sizeof(hash_state));
348 @return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
350 int rmd128_test(void)
355 static const struct {
357 unsigned char hash[16];
360 { 0xcd, 0xf2, 0x62, 0x13, 0xa1, 0x50, 0xdc, 0x3e,
361 0xcb, 0x61, 0x0f, 0x18, 0xf6, 0xb3, 0x8b, 0x46 }
364 { 0x86, 0xbe, 0x7a, 0xfa, 0x33, 0x9d, 0x0f, 0xc7,
365 0xcf, 0xc7, 0x85, 0xe7, 0x2f, 0x57, 0x8d, 0x33 }
368 { 0xc1, 0x4a, 0x12, 0x19, 0x9c, 0x66, 0xe4, 0xba,
369 0x84, 0x63, 0x6b, 0x0f, 0x69, 0x14, 0x4c, 0x77 }
372 { 0x9e, 0x32, 0x7b, 0x3d, 0x6e, 0x52, 0x30, 0x62,
373 0xaf, 0xc1, 0x13, 0x2d, 0x7d, 0xf9, 0xd1, 0xb8 }
375 { "abcdefghijklmnopqrstuvwxyz",
376 { 0xfd, 0x2a, 0xa6, 0x07, 0xf7, 0x1d, 0xc8, 0xf5,
377 0x10, 0x71, 0x49, 0x22, 0xb3, 0x71, 0x83, 0x4e }
379 { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
380 { 0xd1, 0xe9, 0x59, 0xeb, 0x17, 0x9c, 0x91, 0x1f,
381 0xae, 0xa4, 0x62, 0x4c, 0x60, 0xc5, 0xc7, 0x02 }
386 unsigned char tmp[16];
389 for (i = 0; i < (int)(sizeof(tests)/sizeof(tests[0])); i++) {
391 rmd128_process(&md, (unsigned char *)tests[i].msg, strlen(tests[i].msg));
392 rmd128_done(&md, tmp);
393 if (compare_testvector(tmp, sizeof(tmp), tests[i].hash, sizeof(tests[i].hash), "RIPEMD128", i)) {
394 return CRYPT_FAIL_TESTVECTOR;
404 /* ref: $Format:%D$ */
405 /* git commit: $Format:%H$ */
406 /* commit time: $Format:%ai$ */