| /* LibTomCrypt, modular cryptographic library -- Tom St Denis |
| * |
| * LibTomCrypt is a library that provides various cryptographic |
| * algorithms in a highly modular and flexible manner. |
| * |
| * The library is free for all purposes without any express |
| * guarantee it works. |
| * |
| * Tom St Denis, tomstdenis@iahu.ca, http://libtomcrypt.org |
| */ |
| |
| /* Implementation of RIPEMD-160 based on the source by Antoon Bosselaers, ESAT-COSIC |
| * |
| * This source has been radically overhauled to be portable and work within |
| * the LibTomCrypt API by Tom St Denis |
| */ |
| #include "mycrypt.h" |
| |
| #ifdef RIPEMD160 |
| |
| const struct _hash_descriptor rmd160_desc = |
| { |
| "rmd160", |
| 9, |
| 20, |
| 64, |
| |
| /* DER identifier */ |
| { 0x30, 0x21, 0x30, 0x09, 0x06, 0x05, 0x2B, 0x24, |
| 0x03, 0x02, 0x01, 0x05, 0x00, 0x04, 0x14 }, |
| 15, |
| |
| &rmd160_init, |
| &rmd160_process, |
| &rmd160_done, |
| &rmd160_test |
| }; |
| |
| /* the five basic functions F(), G() and H() */ |
| #define F(x, y, z) ((x) ^ (y) ^ (z)) |
| #define G(x, y, z) (((x) & (y)) | (~(x) & (z))) |
| #define H(x, y, z) (((x) | ~(y)) ^ (z)) |
| #define I(x, y, z) (((x) & (z)) | ((y) & ~(z))) |
| #define J(x, y, z) ((x) ^ ((y) | ~(z))) |
| |
| /* the ten basic operations FF() through III() */ |
| #define FF(a, b, c, d, e, x, s) \ |
| (a) += F((b), (c), (d)) + (x);\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define GG(a, b, c, d, e, x, s) \ |
| (a) += G((b), (c), (d)) + (x) + 0x5a827999UL;\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define HH(a, b, c, d, e, x, s) \ |
| (a) += H((b), (c), (d)) + (x) + 0x6ed9eba1UL;\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define II(a, b, c, d, e, x, s) \ |
| (a) += I((b), (c), (d)) + (x) + 0x8f1bbcdcUL;\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define JJ(a, b, c, d, e, x, s) \ |
| (a) += J((b), (c), (d)) + (x) + 0xa953fd4eUL;\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define FFF(a, b, c, d, e, x, s) \ |
| (a) += F((b), (c), (d)) + (x);\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define GGG(a, b, c, d, e, x, s) \ |
| (a) += G((b), (c), (d)) + (x) + 0x7a6d76e9UL;\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define HHH(a, b, c, d, e, x, s) \ |
| (a) += H((b), (c), (d)) + (x) + 0x6d703ef3UL;\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define III(a, b, c, d, e, x, s) \ |
| (a) += I((b), (c), (d)) + (x) + 0x5c4dd124UL;\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| #define JJJ(a, b, c, d, e, x, s) \ |
| (a) += J((b), (c), (d)) + (x) + 0x50a28be6UL;\ |
| (a) = ROL((a), (s)) + (e);\ |
| (c) = ROL((c), 10); |
| |
| |
| #ifdef CLEAN_STACK |
| static int _rmd160_compress(hash_state *md, unsigned char *buf) |
| #else |
| static int rmd160_compress(hash_state *md, unsigned char *buf) |
| #endif |
| { |
| ulong32 aa,bb,cc,dd,ee,aaa,bbb,ccc,ddd,eee,X[16]; |
| int i; |
| |
| /* load words X */ |
| for (i = 0; i < 16; i++){ |
| LOAD32L(X[i], buf + (4 * i)); |
| } |
| |
| /* load state */ |
| aa = aaa = md->rmd160.state[0]; |
| bb = bbb = md->rmd160.state[1]; |
| cc = ccc = md->rmd160.state[2]; |
| dd = ddd = md->rmd160.state[3]; |
| ee = eee = md->rmd160.state[4]; |
| |
| /* round 1 */ |
| FF(aa, bb, cc, dd, ee, X[ 0], 11); |
| FF(ee, aa, bb, cc, dd, X[ 1], 14); |
| FF(dd, ee, aa, bb, cc, X[ 2], 15); |
| FF(cc, dd, ee, aa, bb, X[ 3], 12); |
| FF(bb, cc, dd, ee, aa, X[ 4], 5); |
| FF(aa, bb, cc, dd, ee, X[ 5], 8); |
| FF(ee, aa, bb, cc, dd, X[ 6], 7); |
| FF(dd, ee, aa, bb, cc, X[ 7], 9); |
| FF(cc, dd, ee, aa, bb, X[ 8], 11); |
| FF(bb, cc, dd, ee, aa, X[ 9], 13); |
| FF(aa, bb, cc, dd, ee, X[10], 14); |
| FF(ee, aa, bb, cc, dd, X[11], 15); |
| FF(dd, ee, aa, bb, cc, X[12], 6); |
| FF(cc, dd, ee, aa, bb, X[13], 7); |
| FF(bb, cc, dd, ee, aa, X[14], 9); |
| FF(aa, bb, cc, dd, ee, X[15], 8); |
| |
| /* round 2 */ |
| GG(ee, aa, bb, cc, dd, X[ 7], 7); |
| GG(dd, ee, aa, bb, cc, X[ 4], 6); |
| GG(cc, dd, ee, aa, bb, X[13], 8); |
| GG(bb, cc, dd, ee, aa, X[ 1], 13); |
| GG(aa, bb, cc, dd, ee, X[10], 11); |
| GG(ee, aa, bb, cc, dd, X[ 6], 9); |
| GG(dd, ee, aa, bb, cc, X[15], 7); |
| GG(cc, dd, ee, aa, bb, X[ 3], 15); |
| GG(bb, cc, dd, ee, aa, X[12], 7); |
| GG(aa, bb, cc, dd, ee, X[ 0], 12); |
| GG(ee, aa, bb, cc, dd, X[ 9], 15); |
| GG(dd, ee, aa, bb, cc, X[ 5], 9); |
| GG(cc, dd, ee, aa, bb, X[ 2], 11); |
| GG(bb, cc, dd, ee, aa, X[14], 7); |
| GG(aa, bb, cc, dd, ee, X[11], 13); |
| GG(ee, aa, bb, cc, dd, X[ 8], 12); |
| |
| /* round 3 */ |
| HH(dd, ee, aa, bb, cc, X[ 3], 11); |
| HH(cc, dd, ee, aa, bb, X[10], 13); |
| HH(bb, cc, dd, ee, aa, X[14], 6); |
| HH(aa, bb, cc, dd, ee, X[ 4], 7); |
| HH(ee, aa, bb, cc, dd, X[ 9], 14); |
| HH(dd, ee, aa, bb, cc, X[15], 9); |
| HH(cc, dd, ee, aa, bb, X[ 8], 13); |
| HH(bb, cc, dd, ee, aa, X[ 1], 15); |
| HH(aa, bb, cc, dd, ee, X[ 2], 14); |
| HH(ee, aa, bb, cc, dd, X[ 7], 8); |
| HH(dd, ee, aa, bb, cc, X[ 0], 13); |
| HH(cc, dd, ee, aa, bb, X[ 6], 6); |
| HH(bb, cc, dd, ee, aa, X[13], 5); |
| HH(aa, bb, cc, dd, ee, X[11], 12); |
| HH(ee, aa, bb, cc, dd, X[ 5], 7); |
| HH(dd, ee, aa, bb, cc, X[12], 5); |
| |
| /* round 4 */ |
| II(cc, dd, ee, aa, bb, X[ 1], 11); |
| II(bb, cc, dd, ee, aa, X[ 9], 12); |
| II(aa, bb, cc, dd, ee, X[11], 14); |
| II(ee, aa, bb, cc, dd, X[10], 15); |
| II(dd, ee, aa, bb, cc, X[ 0], 14); |
| II(cc, dd, ee, aa, bb, X[ 8], 15); |
| II(bb, cc, dd, ee, aa, X[12], 9); |
| II(aa, bb, cc, dd, ee, X[ 4], 8); |
| II(ee, aa, bb, cc, dd, X[13], 9); |
| II(dd, ee, aa, bb, cc, X[ 3], 14); |
| II(cc, dd, ee, aa, bb, X[ 7], 5); |
| II(bb, cc, dd, ee, aa, X[15], 6); |
| II(aa, bb, cc, dd, ee, X[14], 8); |
| II(ee, aa, bb, cc, dd, X[ 5], 6); |
| II(dd, ee, aa, bb, cc, X[ 6], 5); |
| II(cc, dd, ee, aa, bb, X[ 2], 12); |
| |
| /* round 5 */ |
| JJ(bb, cc, dd, ee, aa, X[ 4], 9); |
| JJ(aa, bb, cc, dd, ee, X[ 0], 15); |
| JJ(ee, aa, bb, cc, dd, X[ 5], 5); |
| JJ(dd, ee, aa, bb, cc, X[ 9], 11); |
| JJ(cc, dd, ee, aa, bb, X[ 7], 6); |
| JJ(bb, cc, dd, ee, aa, X[12], 8); |
| JJ(aa, bb, cc, dd, ee, X[ 2], 13); |
| JJ(ee, aa, bb, cc, dd, X[10], 12); |
| JJ(dd, ee, aa, bb, cc, X[14], 5); |
| JJ(cc, dd, ee, aa, bb, X[ 1], 12); |
| JJ(bb, cc, dd, ee, aa, X[ 3], 13); |
| JJ(aa, bb, cc, dd, ee, X[ 8], 14); |
| JJ(ee, aa, bb, cc, dd, X[11], 11); |
| JJ(dd, ee, aa, bb, cc, X[ 6], 8); |
| JJ(cc, dd, ee, aa, bb, X[15], 5); |
| JJ(bb, cc, dd, ee, aa, X[13], 6); |
| |
| /* parallel round 1 */ |
| JJJ(aaa, bbb, ccc, ddd, eee, X[ 5], 8); |
| JJJ(eee, aaa, bbb, ccc, ddd, X[14], 9); |
| JJJ(ddd, eee, aaa, bbb, ccc, X[ 7], 9); |
| JJJ(ccc, ddd, eee, aaa, bbb, X[ 0], 11); |
| JJJ(bbb, ccc, ddd, eee, aaa, X[ 9], 13); |
| JJJ(aaa, bbb, ccc, ddd, eee, X[ 2], 15); |
| JJJ(eee, aaa, bbb, ccc, ddd, X[11], 15); |
| JJJ(ddd, eee, aaa, bbb, ccc, X[ 4], 5); |
| JJJ(ccc, ddd, eee, aaa, bbb, X[13], 7); |
| JJJ(bbb, ccc, ddd, eee, aaa, X[ 6], 7); |
| JJJ(aaa, bbb, ccc, ddd, eee, X[15], 8); |
| JJJ(eee, aaa, bbb, ccc, ddd, X[ 8], 11); |
| JJJ(ddd, eee, aaa, bbb, ccc, X[ 1], 14); |
| JJJ(ccc, ddd, eee, aaa, bbb, X[10], 14); |
| JJJ(bbb, ccc, ddd, eee, aaa, X[ 3], 12); |
| JJJ(aaa, bbb, ccc, ddd, eee, X[12], 6); |
| |
| /* parallel round 2 */ |
| III(eee, aaa, bbb, ccc, ddd, X[ 6], 9); |
| III(ddd, eee, aaa, bbb, ccc, X[11], 13); |
| III(ccc, ddd, eee, aaa, bbb, X[ 3], 15); |
| III(bbb, ccc, ddd, eee, aaa, X[ 7], 7); |
| III(aaa, bbb, ccc, ddd, eee, X[ 0], 12); |
| III(eee, aaa, bbb, ccc, ddd, X[13], 8); |
| III(ddd, eee, aaa, bbb, ccc, X[ 5], 9); |
| III(ccc, ddd, eee, aaa, bbb, X[10], 11); |
| III(bbb, ccc, ddd, eee, aaa, X[14], 7); |
| III(aaa, bbb, ccc, ddd, eee, X[15], 7); |
| III(eee, aaa, bbb, ccc, ddd, X[ 8], 12); |
| III(ddd, eee, aaa, bbb, ccc, X[12], 7); |
| III(ccc, ddd, eee, aaa, bbb, X[ 4], 6); |
| III(bbb, ccc, ddd, eee, aaa, X[ 9], 15); |
| III(aaa, bbb, ccc, ddd, eee, X[ 1], 13); |
| III(eee, aaa, bbb, ccc, ddd, X[ 2], 11); |
| |
| /* parallel round 3 */ |
| HHH(ddd, eee, aaa, bbb, ccc, X[15], 9); |
| HHH(ccc, ddd, eee, aaa, bbb, X[ 5], 7); |
| HHH(bbb, ccc, ddd, eee, aaa, X[ 1], 15); |
| HHH(aaa, bbb, ccc, ddd, eee, X[ 3], 11); |
| HHH(eee, aaa, bbb, ccc, ddd, X[ 7], 8); |
| HHH(ddd, eee, aaa, bbb, ccc, X[14], 6); |
| HHH(ccc, ddd, eee, aaa, bbb, X[ 6], 6); |
| HHH(bbb, ccc, ddd, eee, aaa, X[ 9], 14); |
| HHH(aaa, bbb, ccc, ddd, eee, X[11], 12); |
| HHH(eee, aaa, bbb, ccc, ddd, X[ 8], 13); |
| HHH(ddd, eee, aaa, bbb, ccc, X[12], 5); |
| HHH(ccc, ddd, eee, aaa, bbb, X[ 2], 14); |
| HHH(bbb, ccc, ddd, eee, aaa, X[10], 13); |
| HHH(aaa, bbb, ccc, ddd, eee, X[ 0], 13); |
| HHH(eee, aaa, bbb, ccc, ddd, X[ 4], 7); |
| HHH(ddd, eee, aaa, bbb, ccc, X[13], 5); |
| |
| /* parallel round 4 */ |
| GGG(ccc, ddd, eee, aaa, bbb, X[ 8], 15); |
| GGG(bbb, ccc, ddd, eee, aaa, X[ 6], 5); |
| GGG(aaa, bbb, ccc, ddd, eee, X[ 4], 8); |
| GGG(eee, aaa, bbb, ccc, ddd, X[ 1], 11); |
| GGG(ddd, eee, aaa, bbb, ccc, X[ 3], 14); |
| GGG(ccc, ddd, eee, aaa, bbb, X[11], 14); |
| GGG(bbb, ccc, ddd, eee, aaa, X[15], 6); |
| GGG(aaa, bbb, ccc, ddd, eee, X[ 0], 14); |
| GGG(eee, aaa, bbb, ccc, ddd, X[ 5], 6); |
| GGG(ddd, eee, aaa, bbb, ccc, X[12], 9); |
| GGG(ccc, ddd, eee, aaa, bbb, X[ 2], 12); |
| GGG(bbb, ccc, ddd, eee, aaa, X[13], 9); |
| GGG(aaa, bbb, ccc, ddd, eee, X[ 9], 12); |
| GGG(eee, aaa, bbb, ccc, ddd, X[ 7], 5); |
| GGG(ddd, eee, aaa, bbb, ccc, X[10], 15); |
| GGG(ccc, ddd, eee, aaa, bbb, X[14], 8); |
| |
| /* parallel round 5 */ |
| FFF(bbb, ccc, ddd, eee, aaa, X[12] , 8); |
| FFF(aaa, bbb, ccc, ddd, eee, X[15] , 5); |
| FFF(eee, aaa, bbb, ccc, ddd, X[10] , 12); |
| FFF(ddd, eee, aaa, bbb, ccc, X[ 4] , 9); |
| FFF(ccc, ddd, eee, aaa, bbb, X[ 1] , 12); |
| FFF(bbb, ccc, ddd, eee, aaa, X[ 5] , 5); |
| FFF(aaa, bbb, ccc, ddd, eee, X[ 8] , 14); |
| FFF(eee, aaa, bbb, ccc, ddd, X[ 7] , 6); |
| FFF(ddd, eee, aaa, bbb, ccc, X[ 6] , 8); |
| FFF(ccc, ddd, eee, aaa, bbb, X[ 2] , 13); |
| FFF(bbb, ccc, ddd, eee, aaa, X[13] , 6); |
| FFF(aaa, bbb, ccc, ddd, eee, X[14] , 5); |
| FFF(eee, aaa, bbb, ccc, ddd, X[ 0] , 15); |
| FFF(ddd, eee, aaa, bbb, ccc, X[ 3] , 13); |
| FFF(ccc, ddd, eee, aaa, bbb, X[ 9] , 11); |
| FFF(bbb, ccc, ddd, eee, aaa, X[11] , 11); |
| |
| /* combine results */ |
| ddd += cc + md->rmd160.state[1]; /* final result for md->rmd160.state[0] */ |
| md->rmd160.state[1] = md->rmd160.state[2] + dd + eee; |
| md->rmd160.state[2] = md->rmd160.state[3] + ee + aaa; |
| md->rmd160.state[3] = md->rmd160.state[4] + aa + bbb; |
| md->rmd160.state[4] = md->rmd160.state[0] + bb + ccc; |
| md->rmd160.state[0] = ddd; |
| |
| return CRYPT_OK; |
| } |
| |
| #ifdef CLEAN_STACK |
| static int rmd160_compress(hash_state *md, unsigned char *buf) |
| { |
| int err; |
| err = _rmd160_compress(md, buf); |
| burn_stack(sizeof(ulong32) * 26 + sizeof(int)); |
| return err; |
| } |
| #endif |
| |
| int rmd160_init(hash_state * md) |
| { |
| _ARGCHK(md != NULL); |
| md->rmd160.state[0] = 0x67452301UL; |
| md->rmd160.state[1] = 0xefcdab89UL; |
| md->rmd160.state[2] = 0x98badcfeUL; |
| md->rmd160.state[3] = 0x10325476UL; |
| md->rmd160.state[4] = 0xc3d2e1f0UL; |
| md->rmd160.curlen = 0; |
| md->rmd160.length = 0; |
| return CRYPT_OK; |
| } |
| |
| HASH_PROCESS(rmd160_process, rmd160_compress, rmd160, 64) |
| |
| int rmd160_done(hash_state * md, unsigned char *hash) |
| { |
| int i; |
| |
| _ARGCHK(md != NULL); |
| _ARGCHK(hash != NULL); |
| |
| if (md->rmd160.curlen >= sizeof(md->rmd160.buf)) { |
| return CRYPT_INVALID_ARG; |
| } |
| |
| |
| /* increase the length of the message */ |
| md->rmd160.length += md->rmd160.curlen * 8; |
| |
| /* append the '1' bit */ |
| md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0x80; |
| |
| /* if the length is currently above 56 bytes we append zeros |
| * then compress. Then we can fall back to padding zeros and length |
| * encoding like normal. |
| */ |
| if (md->rmd160.curlen > 56) { |
| while (md->rmd160.curlen < 64) { |
| md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0; |
| } |
| rmd160_compress(md, md->rmd160.buf); |
| md->rmd160.curlen = 0; |
| } |
| |
| /* pad upto 56 bytes of zeroes */ |
| while (md->rmd160.curlen < 56) { |
| md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0; |
| } |
| |
| /* store length */ |
| STORE64L(md->rmd160.length, md->rmd160.buf+56); |
| rmd160_compress(md, md->rmd160.buf); |
| |
| /* copy output */ |
| for (i = 0; i < 5; i++) { |
| STORE32L(md->rmd160.state[i], hash+(4*i)); |
| } |
| #ifdef CLEAN_STACK |
| zeromem(md, sizeof(hash_state)); |
| #endif |
| return CRYPT_OK; |
| } |
| |
| int rmd160_test(void) |
| { |
| #ifndef LTC_TEST |
| return CRYPT_NOP; |
| #else |
| static const struct { |
| char *msg; |
| unsigned char md[20]; |
| } tests[] = { |
| { "", |
| { 0x9c, 0x11, 0x85, 0xa5, 0xc5, 0xe9, 0xfc, 0x54, 0x61, 0x28, |
| 0x08, 0x97, 0x7e, 0xe8, 0xf5, 0x48, 0xb2, 0x25, 0x8d, 0x31 } |
| }, |
| { "a", |
| { 0x0b, 0xdc, 0x9d, 0x2d, 0x25, 0x6b, 0x3e, 0xe9, 0xda, 0xae, |
| 0x34, 0x7b, 0xe6, 0xf4, 0xdc, 0x83, 0x5a, 0x46, 0x7f, 0xfe } |
| }, |
| { "abc", |
| { 0x8e, 0xb2, 0x08, 0xf7, 0xe0, 0x5d, 0x98, 0x7a, 0x9b, 0x04, |
| 0x4a, 0x8e, 0x98, 0xc6, 0xb0, 0x87, 0xf1, 0x5a, 0x0b, 0xfc } |
| }, |
| { "message digest", |
| { 0x5d, 0x06, 0x89, 0xef, 0x49, 0xd2, 0xfa, 0xe5, 0x72, 0xb8, |
| 0x81, 0xb1, 0x23, 0xa8, 0x5f, 0xfa, 0x21, 0x59, 0x5f, 0x36 } |
| }, |
| { "abcdefghijklmnopqrstuvwxyz", |
| { 0xf7, 0x1c, 0x27, 0x10, 0x9c, 0x69, 0x2c, 0x1b, 0x56, 0xbb, |
| 0xdc, 0xeb, 0x5b, 0x9d, 0x28, 0x65, 0xb3, 0x70, 0x8d, 0xbc } |
| }, |
| { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", |
| { 0x12, 0xa0, 0x53, 0x38, 0x4a, 0x9c, 0x0c, 0x88, 0xe4, 0x05, |
| 0xa0, 0x6c, 0x27, 0xdc, 0xf4, 0x9a, 0xda, 0x62, 0xeb, 0x2b } |
| } |
| }; |
| int x; |
| unsigned char buf[20]; |
| hash_state md; |
| |
| for (x = 0; x < (int)(sizeof(tests)/sizeof(tests[0])); x++) { |
| rmd160_init(&md); |
| rmd160_process(&md, (unsigned char *)tests[x].msg, strlen(tests[x].msg)); |
| rmd160_done(&md, buf); |
| if (memcmp(buf, tests[x].md, 20) != 0) { |
| #if 0 |
| printf("Failed test %d\n", x); |
| #endif |
| return CRYPT_FAIL_TESTVECTOR; |
| } |
| } |
| return CRYPT_OK; |
| #endif |
| } |
| |
| #endif |
| |