--- /dev/null
+/*\r
+ * RFC 1321 compliant MD5 implementation,\r
+ * by Christophe Devine <devine@cr0.net>;\r
+ * this program is licensed under the GPL.\r
+ */\r
+\r
+/* Modified October 3, 2003, to remove testing code, and add\r
+ include of "types.h".\r
+ \r
+ Added simple MD5 to ASCII string conversion function.\r
+ -Xodnizel\r
+*/\r
+\r
+#include <string.h>\r
+#include "types.h"\r
+#include "md5.h"\r
+\r
+#define GET_UINT32(n,b,i) \\r
+{ \\r
+ (n) = ( (uint32) (b)[(i) + 3] << 24 ) \\r
+ | ( (uint32) (b)[(i) + 2] << 16 ) \\r
+ | ( (uint32) (b)[(i) + 1] << 8 ) \\r
+ | ( (uint32) (b)[(i) ] ); \\r
+}\r
+\r
+#define PUT_UINT32(n,b,i) \\r
+{ \\r
+ (b)[(i) ] = (uint8) ( (n) ); \\r
+ (b)[(i) + 1] = (uint8) ( (n) >> 8 ); \\r
+ (b)[(i) + 2] = (uint8) ( (n) >> 16 ); \\r
+ (b)[(i) + 3] = (uint8) ( (n) >> 24 ); \\r
+}\r
+\r
+void md5_starts( struct md5_context *ctx )\r
+{\r
+ ctx->total[0] = 0;\r
+ ctx->total[1] = 0;\r
+ ctx->state[0] = 0x67452301;\r
+ ctx->state[1] = 0xEFCDAB89;\r
+ ctx->state[2] = 0x98BADCFE;\r
+ ctx->state[3] = 0x10325476;\r
+}\r
+\r
+void md5_process( struct md5_context *ctx, uint8 data[64] )\r
+{\r
+ uint32 A, B, C, D, X[16];\r
+\r
+ GET_UINT32( X[0], data, 0 );\r
+ GET_UINT32( X[1], data, 4 );\r
+ GET_UINT32( X[2], data, 8 );\r
+ GET_UINT32( X[3], data, 12 );\r
+ GET_UINT32( X[4], data, 16 );\r
+ GET_UINT32( X[5], data, 20 );\r
+ GET_UINT32( X[6], data, 24 );\r
+ GET_UINT32( X[7], data, 28 );\r
+ GET_UINT32( X[8], data, 32 );\r
+ GET_UINT32( X[9], data, 36 );\r
+ GET_UINT32( X[10], data, 40 );\r
+ GET_UINT32( X[11], data, 44 );\r
+ GET_UINT32( X[12], data, 48 );\r
+ GET_UINT32( X[13], data, 52 );\r
+ GET_UINT32( X[14], data, 56 );\r
+ GET_UINT32( X[15], data, 60 );\r
+\r
+#define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))\r
+\r
+#define P(a,b,c,d,k,s,t) \\r
+{ \\r
+ a += F(b,c,d) + X[k] + t; a = S(a,s) + b; \\r
+}\r
+\r
+ A = ctx->state[0];\r
+ B = ctx->state[1];\r
+ C = ctx->state[2];\r
+ D = ctx->state[3];\r
+\r
+#define F(x,y,z) (z ^ (x & (y ^ z)))\r
+\r
+ P( A, B, C, D, 0, 7, 0xD76AA478 );\r
+ P( D, A, B, C, 1, 12, 0xE8C7B756 );\r
+ P( C, D, A, B, 2, 17, 0x242070DB );\r
+ P( B, C, D, A, 3, 22, 0xC1BDCEEE );\r
+ P( A, B, C, D, 4, 7, 0xF57C0FAF );\r
+ P( D, A, B, C, 5, 12, 0x4787C62A );\r
+ P( C, D, A, B, 6, 17, 0xA8304613 );\r
+ P( B, C, D, A, 7, 22, 0xFD469501 );\r
+ P( A, B, C, D, 8, 7, 0x698098D8 );\r
+ P( D, A, B, C, 9, 12, 0x8B44F7AF );\r
+ P( C, D, A, B, 10, 17, 0xFFFF5BB1 );\r
+ P( B, C, D, A, 11, 22, 0x895CD7BE );\r
+ P( A, B, C, D, 12, 7, 0x6B901122 );\r
+ P( D, A, B, C, 13, 12, 0xFD987193 );\r
+ P( C, D, A, B, 14, 17, 0xA679438E );\r
+ P( B, C, D, A, 15, 22, 0x49B40821 );\r
+\r
+#undef F\r
+\r
+#define F(x,y,z) (y ^ (z & (x ^ y)))\r
+\r
+ P( A, B, C, D, 1, 5, 0xF61E2562 );\r
+ P( D, A, B, C, 6, 9, 0xC040B340 );\r
+ P( C, D, A, B, 11, 14, 0x265E5A51 );\r
+ P( B, C, D, A, 0, 20, 0xE9B6C7AA );\r
+ P( A, B, C, D, 5, 5, 0xD62F105D );\r
+ P( D, A, B, C, 10, 9, 0x02441453 );\r
+ P( C, D, A, B, 15, 14, 0xD8A1E681 );\r
+ P( B, C, D, A, 4, 20, 0xE7D3FBC8 );\r
+ P( A, B, C, D, 9, 5, 0x21E1CDE6 );\r
+ P( D, A, B, C, 14, 9, 0xC33707D6 );\r
+ P( C, D, A, B, 3, 14, 0xF4D50D87 );\r
+ P( B, C, D, A, 8, 20, 0x455A14ED );\r
+ P( A, B, C, D, 13, 5, 0xA9E3E905 );\r
+ P( D, A, B, C, 2, 9, 0xFCEFA3F8 );\r
+ P( C, D, A, B, 7, 14, 0x676F02D9 );\r
+ P( B, C, D, A, 12, 20, 0x8D2A4C8A );\r
+\r
+#undef F\r
+ \r
+#define F(x,y,z) (x ^ y ^ z)\r
+\r
+ P( A, B, C, D, 5, 4, 0xFFFA3942 );\r
+ P( D, A, B, C, 8, 11, 0x8771F681 );\r
+ P( C, D, A, B, 11, 16, 0x6D9D6122 );\r
+ P( B, C, D, A, 14, 23, 0xFDE5380C );\r
+ P( A, B, C, D, 1, 4, 0xA4BEEA44 );\r
+ P( D, A, B, C, 4, 11, 0x4BDECFA9 );\r
+ P( C, D, A, B, 7, 16, 0xF6BB4B60 );\r
+ P( B, C, D, A, 10, 23, 0xBEBFBC70 );\r
+ P( A, B, C, D, 13, 4, 0x289B7EC6 );\r
+ P( D, A, B, C, 0, 11, 0xEAA127FA );\r
+ P( C, D, A, B, 3, 16, 0xD4EF3085 );\r
+ P( B, C, D, A, 6, 23, 0x04881D05 );\r
+ P( A, B, C, D, 9, 4, 0xD9D4D039 );\r
+ P( D, A, B, C, 12, 11, 0xE6DB99E5 );\r
+ P( C, D, A, B, 15, 16, 0x1FA27CF8 );\r
+ P( B, C, D, A, 2, 23, 0xC4AC5665 );\r
+\r
+#undef F\r
+\r
+#define F(x,y,z) (y ^ (x | ~z))\r
+\r
+ P( A, B, C, D, 0, 6, 0xF4292244 );\r
+ P( D, A, B, C, 7, 10, 0x432AFF97 );\r
+ P( C, D, A, B, 14, 15, 0xAB9423A7 );\r
+ P( B, C, D, A, 5, 21, 0xFC93A039 );\r
+ P( A, B, C, D, 12, 6, 0x655B59C3 );\r
+ P( D, A, B, C, 3, 10, 0x8F0CCC92 );\r
+ P( C, D, A, B, 10, 15, 0xFFEFF47D );\r
+ P( B, C, D, A, 1, 21, 0x85845DD1 );\r
+ P( A, B, C, D, 8, 6, 0x6FA87E4F );\r
+ P( D, A, B, C, 15, 10, 0xFE2CE6E0 );\r
+ P( C, D, A, B, 6, 15, 0xA3014314 );\r
+ P( B, C, D, A, 13, 21, 0x4E0811A1 );\r
+ P( A, B, C, D, 4, 6, 0xF7537E82 );\r
+ P( D, A, B, C, 11, 10, 0xBD3AF235 );\r
+ P( C, D, A, B, 2, 15, 0x2AD7D2BB );\r
+ P( B, C, D, A, 9, 21, 0xEB86D391 );\r
+\r
+#undef F\r
+\r
+ ctx->state[0] += A;\r
+ ctx->state[1] += B;\r
+ ctx->state[2] += C;\r
+ ctx->state[3] += D;\r
+}\r
+\r
+void md5_update( struct md5_context *ctx, uint8 *input, uint32 length )\r
+{\r
+ uint32 left, fill;\r
+\r
+ if( ! length ) return;\r
+\r
+ left = ( ctx->total[0] >> 3 ) & 0x3F;\r
+ fill = 64 - left;\r
+\r
+ ctx->total[0] += length << 3;\r
+ ctx->total[1] += length >> 29;\r
+\r
+ ctx->total[0] &= 0xFFFFFFFF;\r
+ ctx->total[1] += ctx->total[0] < ( length << 3 );\r
+\r
+ if( left && length >= fill )\r
+ {\r
+ memcpy( (void *) (ctx->buffer + left), (void *) input, fill );\r
+ md5_process( ctx, ctx->buffer );\r
+ length -= fill;\r
+ input += fill;\r
+ left = 0;\r
+ }\r
+\r
+ while( length >= 64 )\r
+ {\r
+ md5_process( ctx, input );\r
+ length -= 64;\r
+ input += 64;\r
+ }\r
+\r
+ if( length )\r
+ {\r
+ memcpy( (void *) (ctx->buffer + left), (void *) input, length );\r
+ }\r
+}\r
+\r
+static uint8 md5_padding[64] =\r
+{\r
+ 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\r
+};\r
+\r
+void md5_finish( struct md5_context *ctx, uint8 digest[16] )\r
+{\r
+ uint32 last, padn;\r
+ uint8 msglen[8];\r
+\r
+ PUT_UINT32( ctx->total[0], msglen, 0 );\r
+ PUT_UINT32( ctx->total[1], msglen, 4 );\r
+\r
+ last = ( ctx->total[0] >> 3 ) & 0x3F;\r
+ padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );\r
+\r
+ md5_update( ctx, md5_padding, padn );\r
+ md5_update( ctx, msglen, 8 );\r
+\r
+ PUT_UINT32( ctx->state[0], digest, 0 );\r
+ PUT_UINT32( ctx->state[1], digest, 4 );\r
+ PUT_UINT32( ctx->state[2], digest, 8 );\r
+ PUT_UINT32( ctx->state[3], digest, 12 );\r
+}\r
+\r
+\r
+/* Uses a static buffer, so beware of how it's used. */\r
+char *md5_asciistr(uint8 digest[16])\r
+{\r
+ static char str[33];\r
+ static char trans[16]={'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'};\r
+ int x;\r
+\r
+ for(x=0;x<16;x++)\r
+ {\r
+ str[x*2]=trans[digest[x]&0x0F];\r
+ str[x*2+1]=trans[digest[x]>>4];\r
+ }\r
+ return(str);\r
+}\r
notaz.gp2x.de / fceu.git / blobdiff