MD5.zip_md5

#include <stdio.h> #include <stdlib.h> #include <string.h> /* Performs the MD5 hash algorithm on a string. */ #define rol(x, n) ((x << n) | (x >> (32 - n))) #define nn(n) (32 - n) #define ror(x, n) ((x << nn(n)) | (x >>> (32 - nn(n)))) #define _f( x, y, z ) (( x & y ) | ( (~x) & z )) #define _g( x, y, z ) (( x & z ) | ( y & (~z) )) #define _h( x, y, z ) (x ^ y ^ z) #define _i( x, y, z ) (y ^ ( x | (~z) )) #define ff(a, b, c, d, x, s, t) \ transform( _f(b, c, d), a, b, c, d, x, s, t ) #define gg(a, b, c, d, x, s, t) \ transform( _g(b, c, d), a, b, c, d, x, s, t ) #define hh(a, b, c, d, x, s, t) \ transform( _h(b, c, d), a, b, c, d, x, s, t ) #define ii(a, b, c, d, x, s, t) \ transform( _i(b, c, d), a, b, c, d, x, s, t ) static char* toHex(int n, int bigEndian ) { char set[17] = "0123456789abcdef"; char s[9] = {0}; int i, x, v=0; if ( bigEndian ) { for (i = 0; i < 4; i++ ) { s[i+v++] = set[( ( n >> ( ( 3 - i ) * 8 + 4 ) ) & 0xF )]; s[i+v] = set[( ( n >> ( ( 3 - i ) * 8 ) ) & 0xF )]; } } else { for (x = 0; x < 4; x++ ) { s[x+v++] = set[( ( n >> ( x * 8 + 4 ) ) & 0xF )]; s[x+v] = set[( ( n >> ( x * 8 ) ) & 0xF )]; } } return s; } /** * Converts a string to a sequence of 16-word blocks * that we'll do the processing on. Appends padding * and length in the process. * * @param s The string to split into blocks * @return An array containing the blocks that s was * split into. */ static unsigned short* createBlocks( unsigned short* s ) //Array, s = byteArray { int i; unsigned short blocks[512] = {0}; //new Array(); int len = strlen((char*)s) * 8; int mask = 0xFF; // ignore hi byte of characters > 0xFF for(i = 0; i < len; i += 8 ) { blocks[(int)(i >> 5) ] |= ( s[ i / 8 ] & mask ) << ( i % 32 ); } // append padding and length blocks[(int)(len >> 5) ] |= 0x80 << ( len % 32 ); blocks[(int)(( ( ( len + 64 ) >> 9 ) << 4 ) + 14) ] = len; return blocks; } static int transform( int bcd, int a, int b, int c, int d, int x, int s, int t) { int tmp = a + bcd + x + t; return (int) rol( tmp, s ) + b; } static char* hash(unsigned short* s) { int i; char hv[33] ={0}; // initialize the md buffers int a = 1732584193; int b = -271733879; int c = -1732584194; int d = 271733878; // variables to store previous values int aa; int bb; int cc; int dd; // create the blocks from the string and // save the length as a local var to reduce // lookup in the loop below unsigned short* x = createBlocks( s ); // array int len = strlen((char*)x); // loop over all of the blocks for(i = 0; i < len; i+=16) { // save previous values aa = a; bb = b; cc = c; dd = d; // Round 1 a = ff( a, b, c, d, x[(i+ 0)], 7, -680876936 ); // 1 d = ff( d, a, b, c, x[(i+ 1)], 12, -389564586 ); // 2 c = ff( c, d, a, b, x[(i+ 2)], 17, 606105819 ); // 3 b = ff( b, c, d, a, x[(i+ 3)], 22, -1044525330 ); // 4 a = ff( a, b, c, d, x[(i+ 4)], 7, -176418897 ); // 5 d = ff( d, a, b, c, x[(i+ 5)], 12, 1200080426 ); // 6 c = ff( c, d, a, b, x[(i+ 6)], 17, -1473231341 ); // 7 b = ff( b, c, d, a, x[(i+ 7)], 22, -45705983 ); // 8 a = ff( a, b, c, d, x[(i+ 8)], 7, 1770035416 ); // 9 d = ff( d, a, b, c, x[(i+ 9)], 12, -1958414417 ); // 10 c = ff( c, d, a, b, x[(i+10)], 17, -42063 ); // 11 b = ff( b, c, d, a, x[(i+11)], 22, -1990404162 ); // 12 a = ff( a, b, c, d, x[(i+12)], 7, 1804603682 ); // 13 d = ff( d, a, b, c, x[(i+13)], 12, -40341101 ); // 14 c = ff( c, d, a, b, x[(i+14)], 17, -1502002290 ); // 15 b = ff( b, c, d, a, x[(i+15)], 22, 1236535329 ); // 16 // Round 2 a = gg( a, b, c, d, x[(i+ 1)], 5, -165796510 ); // 17 d = gg( d, a, b, c, x[(i+ 6)], 9, -1069501632 ); // 18 c = gg( c, d, a, b, x[(i+11)], 14, 643717713 ); // 19 b = gg( b, c, d, a, x[(i+ 0)], 20, -373897302 ); // 20 a = gg( a, b, c, d, x[(i+ 5)], 5, -701558691 ); // 21 d = gg( d, a, b, c, x[(i+10)], 9, 38016083 ); // 22 c = gg( c, d, a, b, x[(i+15)], 14, -660478335 ); // 23 b = gg( b, c, d, a, x[(i+ 4)], 20, -405537848 ); // 24 a = gg( a, b, c, d, x[(i+ 9)], 5, 568446438 ); // 25 d = gg( d, a, b, c, x[(i+14)], 9, -1019803690 ); // 26 c = gg( c, d, a, b, x[(i+ 3)], 14, -187363961 ); // 27 b = gg( b, c, d, a, x[(i+ 8)], 20, 1163531501 ); // 28 a = gg( a, b, c, d, x[(i+13)], 5, -1444681467 ); // 29 d = gg( d, a, b, c, x[(i+ 2)], 9, -51403784 ); // 30 c = gg( c, d, a, b, x[(i+ 7)], 14, 1735328473 ); // 31 b = gg( b, c, d, a, x[(i+12)], 20, -1926607734 ); // 32 // Round 3 a = hh( a, b, c, d, x[(i+ 5)], 4, -378558 ); // 33 d = hh( d, a, b, c, x[(i+ 8)], 11, -2022574463 ); // 34 c = hh( c, d, a, b, x[(i+11)], 16, 1839030562 ); // 35 b = hh( b, c, d, a, x[(i+14)], 23, -35309556 ); // 36 a = hh( a, b, c, d, x[(i+ 1)], 4, -1530992060 ); // 37 d = hh( d, a, b, c, x[(i+ 4)], 11, 1272893353 ); // 38 c = hh( c, d, a, b, x[(i+ 7)], 16, -155497632 ); // 39 b = hh( b, c, d, a, x[(i+10)], 23, -1094730640 ); // 40 a = hh( a, b, c, d, x[(i+13)], 4, 681279174 ); // 41 d = hh( d, a, b, c, x[(i+ 0)], 11, -358537222 ); // 42 c = hh( c, d, a, b, x[(i+ 3)], 16, -722521979 ); // 43 b = hh( b, c, d, a, x[(i+ 6)], 23, 76029189 ); // 44 a = hh( a, b, c, d, x[(i+ 9)], 4, -640364487 ); // 45 d = hh( d, a, b, c, x[(i+12)], 11, -421815835 ); // 46 c = hh( c, d, a, b, x[(i+15)], 16, 530742520 ); // 47 b = hh( b, c, d, a, x[(i+ 2)], 23, -995338651 ); // 48 // Round 4 a = ii( a, b, c, d, x[(i+ 0)], 6, -198630844 ); // 49 d = ii( d, a, b, c, x[(i+ 7)], 10, 1126891415 ); // 50 c = ii( c, d, a, b, x[(i+14)], 15, -1416354905 ); // 51 b = ii( b, c, d, a, x[(i+ 5)], 21, -57434055 ); // 52 a = ii( a, b, c, d, x[(i+12)], 6, 1700485571 ); // 53 d = ii( d, a, b, c, x[(i+ 3)], 10, -1894986606 ); // 54 c = ii( c, d, a, b, x[(i+10)], 15, -1051523 ); // 55 b = ii( b, c, d, a, x[(i+ 1)], 21, -2054922799 ); // 56 a = ii( a, b, c, d, x[(i+ 8)], 6, 1873313359 ); // 57 d = ii( d, a, b, c, x[(i+15)], 10, -30611744 ); // 58 c = ii( c, d, a, b, x[(i+ 6)], 15, -1560198380 ); // 59 b = ii( b, c, d, a, x[(i+13)], 21, 1309151649 ); // 60 a = ii( a, b, c, d, x[(i+ 4)], 6, -145523070 ); // 61 d = ii( d, a, b, c, x[(i+11)], 10, -1120210379 ); // 62 c = ii( c, d, a, b,