2
* Copyright (c) 1995 - 2001 Kungliga Tekniska Högskolan
3
* (Royal Institute of Technology, Stockholm, Sweden).
6
* Redistribution and use in source and binary forms, with or without
7
* modification, are permitted provided that the following conditions
10
* 1. Redistributions of source code must retain the above copyright
11
* notice, this list of conditions and the following disclaimer.
13
* 2. Redistributions in binary form must reproduce the above copyright
14
* notice, this list of conditions and the following disclaimer in the
15
* documentation and/or other materials provided with the distribution.
17
* 3. Neither the name of the Institute nor the names of its contributors
18
* may be used to endorse or promote products derived from this software
19
* without specific prior written permission.
21
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43
#define A m->counter[0]
44
#define B m->counter[1]
45
#define C m->counter[2]
46
#define D m->counter[3]
50
MD5_Init (struct md5 *m)
60
#define F(x,y,z) CRAYFIX((x & y) | (~x & z))
61
#define G(x,y,z) CRAYFIX((x & z) | (y & ~z))
62
#define H(x,y,z) (x ^ y ^ z)
63
#define I(x,y,z) CRAYFIX(y ^ (x | ~z))
65
#define DOIT(a,b,c,d,k,s,i,OP) \
66
a = b + cshift(a + OP(b,c,d) + X[k] + (i), s)
68
#define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
69
#define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
70
#define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
71
#define DO4(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,I)
74
calc (struct md5 *m, uint32_t *data)
76
uint32_t AA, BB, CC, DD;
85
DO1(A,B,C,D,0,7,0xd76aa478);
86
DO1(D,A,B,C,1,12,0xe8c7b756);
87
DO1(C,D,A,B,2,17,0x242070db);
88
DO1(B,C,D,A,3,22,0xc1bdceee);
90
DO1(A,B,C,D,4,7,0xf57c0faf);
91
DO1(D,A,B,C,5,12,0x4787c62a);
92
DO1(C,D,A,B,6,17,0xa8304613);
93
DO1(B,C,D,A,7,22,0xfd469501);
95
DO1(A,B,C,D,8,7,0x698098d8);
96
DO1(D,A,B,C,9,12,0x8b44f7af);
97
DO1(C,D,A,B,10,17,0xffff5bb1);
98
DO1(B,C,D,A,11,22,0x895cd7be);
100
DO1(A,B,C,D,12,7,0x6b901122);
101
DO1(D,A,B,C,13,12,0xfd987193);
102
DO1(C,D,A,B,14,17,0xa679438e);
103
DO1(B,C,D,A,15,22,0x49b40821);
107
DO2(A,B,C,D,1,5,0xf61e2562);
108
DO2(D,A,B,C,6,9,0xc040b340);
109
DO2(C,D,A,B,11,14,0x265e5a51);
110
DO2(B,C,D,A,0,20,0xe9b6c7aa);
112
DO2(A,B,C,D,5,5,0xd62f105d);
113
DO2(D,A,B,C,10,9,0x2441453);
114
DO2(C,D,A,B,15,14,0xd8a1e681);
115
DO2(B,C,D,A,4,20,0xe7d3fbc8);
117
DO2(A,B,C,D,9,5,0x21e1cde6);
118
DO2(D,A,B,C,14,9,0xc33707d6);
119
DO2(C,D,A,B,3,14,0xf4d50d87);
120
DO2(B,C,D,A,8,20,0x455a14ed);
122
DO2(A,B,C,D,13,5,0xa9e3e905);
123
DO2(D,A,B,C,2,9,0xfcefa3f8);
124
DO2(C,D,A,B,7,14,0x676f02d9);
125
DO2(B,C,D,A,12,20,0x8d2a4c8a);
129
DO3(A,B,C,D,5,4,0xfffa3942);
130
DO3(D,A,B,C,8,11,0x8771f681);
131
DO3(C,D,A,B,11,16,0x6d9d6122);
132
DO3(B,C,D,A,14,23,0xfde5380c);
134
DO3(A,B,C,D,1,4,0xa4beea44);
135
DO3(D,A,B,C,4,11,0x4bdecfa9);
136
DO3(C,D,A,B,7,16,0xf6bb4b60);
137
DO3(B,C,D,A,10,23,0xbebfbc70);
139
DO3(A,B,C,D,13,4,0x289b7ec6);
140
DO3(D,A,B,C,0,11,0xeaa127fa);
141
DO3(C,D,A,B,3,16,0xd4ef3085);
142
DO3(B,C,D,A,6,23,0x4881d05);
144
DO3(A,B,C,D,9,4,0xd9d4d039);
145
DO3(D,A,B,C,12,11,0xe6db99e5);
146
DO3(C,D,A,B,15,16,0x1fa27cf8);
147
DO3(B,C,D,A,2,23,0xc4ac5665);
151
DO4(A,B,C,D,0,6,0xf4292244);
152
DO4(D,A,B,C,7,10,0x432aff97);
153
DO4(C,D,A,B,14,15,0xab9423a7);
154
DO4(B,C,D,A,5,21,0xfc93a039);
156
DO4(A,B,C,D,12,6,0x655b59c3);
157
DO4(D,A,B,C,3,10,0x8f0ccc92);
158
DO4(C,D,A,B,10,15,0xffeff47d);
159
DO4(B,C,D,A,1,21,0x85845dd1);
161
DO4(A,B,C,D,8,6,0x6fa87e4f);
162
DO4(D,A,B,C,15,10,0xfe2ce6e0);
163
DO4(C,D,A,B,6,15,0xa3014314);
164
DO4(B,C,D,A,13,21,0x4e0811a1);
166
DO4(A,B,C,D,4,6,0xf7537e82);
167
DO4(D,A,B,C,11,10,0xbd3af235);
168
DO4(C,D,A,B,2,15,0x2ad7d2bb);
169
DO4(B,C,D,A,9,21,0xeb86d391);
178
* From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
181
#if defined(WORDS_BIGENDIAN)
182
static inline uint32_t
183
swap_uint32_t (uint32_t t)
185
uint32_t temp1, temp2;
187
temp1 = cshift(t, 16);
192
return temp1 | temp2;
202
MD5_Update (struct md5 *m, const void *v, size_t len)
204
const unsigned char *p = v;
205
size_t old_sz = m->sz[0];
209
if (m->sz[0] < old_sz)
211
offset = (old_sz / 8) % 64;
213
size_t l = min(len, 64 - offset);
214
memcpy(m->save + offset, p, l);
219
#if defined(WORDS_BIGENDIAN)
221
uint32_t current[16];
222
struct x32 *u = (struct x32*)m->save;
223
for(i = 0; i < 8; i++){
224
current[2*i+0] = swap_uint32_t(u[i].a);
225
current[2*i+1] = swap_uint32_t(u[i].b);
229
calc(m, (uint32_t*)m->save);
237
MD5_Final (void *res, struct md5 *m)
239
unsigned char zeros[72];
240
unsigned offset = (m->sz[0] / 8) % 64;
241
unsigned int dstart = (120 - offset - 1) % 64 + 1;
244
memset (zeros + 1, 0, sizeof(zeros) - 1);
245
zeros[dstart+0] = (m->sz[0] >> 0) & 0xff;
246
zeros[dstart+1] = (m->sz[0] >> 8) & 0xff;
247
zeros[dstart+2] = (m->sz[0] >> 16) & 0xff;
248
zeros[dstart+3] = (m->sz[0] >> 24) & 0xff;
249
zeros[dstart+4] = (m->sz[1] >> 0) & 0xff;
250
zeros[dstart+5] = (m->sz[1] >> 8) & 0xff;
251
zeros[dstart+6] = (m->sz[1] >> 16) & 0xff;
252
zeros[dstart+7] = (m->sz[1] >> 24) & 0xff;
253
MD5_Update (m, zeros, dstart + 8);
256
unsigned char *r = (unsigned char *)res;
258
for (i = 0; i < 4; ++i) {
259
r[4*i] = m->counter[i] & 0xFF;
260
r[4*i+1] = (m->counter[i] >> 8) & 0xFF;
261
r[4*i+2] = (m->counter[i] >> 16) & 0xFF;
262
r[4*i+3] = (m->counter[i] >> 24) & 0xFF;
268
uint32_t *r = (uint32_t *)res;
270
for (i = 0; i < 4; ++i)
271
r[i] = swap_uint32_t (m->counter[i]);