2 * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
3 * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2 of the License, or (at your option) any later version.
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
15 * You should have received a copy of the GNU Lesser General Public
16 * License along with this library; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 * IETF RFC 1321: The MD5 Message-Digest Algorithm
21 * Ron Rivest. IETF, April, 1992
23 * based on http://ubiqx.org/libcifs/source/Auth/MD5.c
24 * from Christopher R. Hertel (crh@ubiqx.mn.org)
25 * simplified, cleaned and IMO redundant comments removed by michael
27 * if you use gcc, then version 4.1 or later and -fomit-frame-pointer is
28 * strongly recommended
42 const int av_md5_size= sizeof(AVMD5);
44 static const uint8_t S[4][4] = {
45 { 7, 12, 17, 22 }, /* Round 1 */
46 { 5, 9, 14, 20 }, /* Round 2 */
47 { 4, 11, 16, 23 }, /* Round 3 */
48 { 6, 10, 15, 21 } /* Round 4 */
51 static const uint32_t T[64] = {
52 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, /* Round 1 */
53 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
54 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
55 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
57 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, /* Round 2 */
58 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
59 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
60 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
62 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, /* Round 3 */
63 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
64 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
65 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
67 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, /* Round 4 */
68 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
69 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
70 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
73 #define CORE(i, a, b, c, d) \
78 case 0: a += (d ^ (b&(c^d))) + X[ i &15 ]; break;\
79 case 1: a += (c ^ (d&(c^b))) + X[ (1+5*i)&15 ]; break;\
80 case 2: a += (b^c^d) + X[ (5+3*i)&15 ]; break;\
81 case 3: a += (c^(b|~d)) + X[ ( 7*i)&15 ]; break;\
83 a = b + (( a << t ) | ( a >> (32 - t) ));
85 static void body(uint32_t ABCD[4], uint32_t X[16]){
88 int i attribute_unused;
89 unsigned int a= ABCD[3];
90 unsigned int b= ABCD[2];
91 unsigned int c= ABCD[1];
92 unsigned int d= ABCD[0];
94 #ifdef WORDS_BIGENDIAN
100 for( i = 0; i < 64; i++ ){
102 t=d; d=c; c=b; b=a; a=t;
105 #define CORE2(i) CORE(i,a,b,c,d) CORE((i+1),d,a,b,c) CORE((i+2),c,d,a,b) CORE((i+3),b,c,d,a)
106 #define CORE4(i) CORE2(i) CORE2((i+4)) CORE2((i+8)) CORE2((i+12))
107 CORE4(0) CORE4(16) CORE4(32) CORE4(48)
116 void av_md5_init(AVMD5 *ctx){
120 ctx->ABCD[0] = 0x10325476;
121 ctx->ABCD[1] = 0x98badcfe;
122 ctx->ABCD[2] = 0xefcdab89;
123 ctx->ABCD[3] = 0x67452301;
126 void av_md5_update(AVMD5 *ctx, const uint8_t *src, const int len){
131 for( i = 0; i < len; i++ ){
132 ctx->block[ ctx->b_used++ ] = src[i];
133 if( 64 == ctx->b_used ){
134 body(ctx->ABCD, (uint32_t*) ctx->block);
140 void av_md5_final(AVMD5 *ctx, uint8_t *dst){
143 ctx->block[ctx->b_used++] = 0x80;
145 memset(&ctx->block[ctx->b_used], 0, 64 - ctx->b_used);
147 if( 56 < ctx->b_used ){
148 body( ctx->ABCD, (uint32_t*) ctx->block );
149 memset(ctx->block, 0, 64);
153 ctx->block[56+i] = (ctx->len << 3) >> (i<<3);
155 body(ctx->ABCD, (uint32_t*) ctx->block);
158 ((uint32_t*)dst)[i]= le2me_32(ctx->ABCD[3-i]);
161 void av_md5_sum(uint8_t *dst, const uint8_t *src, const int len){
165 av_md5_update(ctx, src, len);
166 av_md5_final(ctx, dst);
176 for(i=0; i<1000; i++) in[i]= i*i;
177 av_md5_sum( (uint8_t*)&md5val, in, 1000); printf("%lld\n", md5val);
178 av_md5_sum( (uint8_t*)&md5val, in, 63); printf("%lld\n", md5val);
179 av_md5_sum( (uint8_t*)&md5val, in, 64); printf("%lld\n", md5val);
180 av_md5_sum( (uint8_t*)&md5val, in, 65); printf("%lld\n", md5val);
181 for(i=0; i<1000; i++) in[i]= i % 127;
182 av_md5_sum( (uint8_t*)&md5val, in, 999); printf("%lld\n", md5val);