1/*	$NetBSD$	*/
2
3/*
4 * Copyright (c) 1995 - 2001 Kungliga Tekniska H��gskolan
5 * (Royal Institute of Technology, Stockholm, Sweden).
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 *    notice, this list of conditions and the following disclaimer.
14 *
15 * 2. Redistributions in binary form must reproduce the above copyright
16 *    notice, this list of conditions and the following disclaimer in the
17 *    documentation and/or other materials provided with the distribution.
18 *
19 * 3. Neither the name of the Institute nor the names of its contributors
20 *    may be used to endorse or promote products derived from this software
21 *    without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36#include "config.h"
37
38#include "hash.h"
39#include "md5.h"
40
41#define A m->counter[0]
42#define B m->counter[1]
43#define C m->counter[2]
44#define D m->counter[3]
45#define X data
46
47void
48MD5_Init (struct md5 *m)
49{
50  m->sz[0] = 0;
51  m->sz[1] = 0;
52  D = 0x10325476;
53  C = 0x98badcfe;
54  B = 0xefcdab89;
55  A = 0x67452301;
56}
57
58#define F(x,y,z) CRAYFIX((x & y) | (~x & z))
59#define G(x,y,z) CRAYFIX((x & z) | (y & ~z))
60#define H(x,y,z) (x ^ y ^ z)
61#define I(x,y,z) CRAYFIX(y ^ (x | ~z))
62
63#define DOIT(a,b,c,d,k,s,i,OP) \
64a = b + cshift(a + OP(b,c,d) + X[k] + (i), s)
65
66#define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
67#define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
68#define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
69#define DO4(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,I)
70
71static inline void
72calc (struct md5 *m, uint32_t *data)
73{
74  uint32_t AA, BB, CC, DD;
75
76  AA = A;
77  BB = B;
78  CC = C;
79  DD = D;
80
81  /* Round 1 */
82
83  DO1(A,B,C,D,0,7,0xd76aa478);
84  DO1(D,A,B,C,1,12,0xe8c7b756);
85  DO1(C,D,A,B,2,17,0x242070db);
86  DO1(B,C,D,A,3,22,0xc1bdceee);
87
88  DO1(A,B,C,D,4,7,0xf57c0faf);
89  DO1(D,A,B,C,5,12,0x4787c62a);
90  DO1(C,D,A,B,6,17,0xa8304613);
91  DO1(B,C,D,A,7,22,0xfd469501);
92
93  DO1(A,B,C,D,8,7,0x698098d8);
94  DO1(D,A,B,C,9,12,0x8b44f7af);
95  DO1(C,D,A,B,10,17,0xffff5bb1);
96  DO1(B,C,D,A,11,22,0x895cd7be);
97
98  DO1(A,B,C,D,12,7,0x6b901122);
99  DO1(D,A,B,C,13,12,0xfd987193);
100  DO1(C,D,A,B,14,17,0xa679438e);
101  DO1(B,C,D,A,15,22,0x49b40821);
102
103  /* Round 2 */
104
105  DO2(A,B,C,D,1,5,0xf61e2562);
106  DO2(D,A,B,C,6,9,0xc040b340);
107  DO2(C,D,A,B,11,14,0x265e5a51);
108  DO2(B,C,D,A,0,20,0xe9b6c7aa);
109
110  DO2(A,B,C,D,5,5,0xd62f105d);
111  DO2(D,A,B,C,10,9,0x2441453);
112  DO2(C,D,A,B,15,14,0xd8a1e681);
113  DO2(B,C,D,A,4,20,0xe7d3fbc8);
114
115  DO2(A,B,C,D,9,5,0x21e1cde6);
116  DO2(D,A,B,C,14,9,0xc33707d6);
117  DO2(C,D,A,B,3,14,0xf4d50d87);
118  DO2(B,C,D,A,8,20,0x455a14ed);
119
120  DO2(A,B,C,D,13,5,0xa9e3e905);
121  DO2(D,A,B,C,2,9,0xfcefa3f8);
122  DO2(C,D,A,B,7,14,0x676f02d9);
123  DO2(B,C,D,A,12,20,0x8d2a4c8a);
124
125  /* Round 3 */
126
127  DO3(A,B,C,D,5,4,0xfffa3942);
128  DO3(D,A,B,C,8,11,0x8771f681);
129  DO3(C,D,A,B,11,16,0x6d9d6122);
130  DO3(B,C,D,A,14,23,0xfde5380c);
131
132  DO3(A,B,C,D,1,4,0xa4beea44);
133  DO3(D,A,B,C,4,11,0x4bdecfa9);
134  DO3(C,D,A,B,7,16,0xf6bb4b60);
135  DO3(B,C,D,A,10,23,0xbebfbc70);
136
137  DO3(A,B,C,D,13,4,0x289b7ec6);
138  DO3(D,A,B,C,0,11,0xeaa127fa);
139  DO3(C,D,A,B,3,16,0xd4ef3085);
140  DO3(B,C,D,A,6,23,0x4881d05);
141
142  DO3(A,B,C,D,9,4,0xd9d4d039);
143  DO3(D,A,B,C,12,11,0xe6db99e5);
144  DO3(C,D,A,B,15,16,0x1fa27cf8);
145  DO3(B,C,D,A,2,23,0xc4ac5665);
146
147  /* Round 4 */
148
149  DO4(A,B,C,D,0,6,0xf4292244);
150  DO4(D,A,B,C,7,10,0x432aff97);
151  DO4(C,D,A,B,14,15,0xab9423a7);
152  DO4(B,C,D,A,5,21,0xfc93a039);
153
154  DO4(A,B,C,D,12,6,0x655b59c3);
155  DO4(D,A,B,C,3,10,0x8f0ccc92);
156  DO4(C,D,A,B,10,15,0xffeff47d);
157  DO4(B,C,D,A,1,21,0x85845dd1);
158
159  DO4(A,B,C,D,8,6,0x6fa87e4f);
160  DO4(D,A,B,C,15,10,0xfe2ce6e0);
161  DO4(C,D,A,B,6,15,0xa3014314);
162  DO4(B,C,D,A,13,21,0x4e0811a1);
163
164  DO4(A,B,C,D,4,6,0xf7537e82);
165  DO4(D,A,B,C,11,10,0xbd3af235);
166  DO4(C,D,A,B,2,15,0x2ad7d2bb);
167  DO4(B,C,D,A,9,21,0xeb86d391);
168
169  A += AA;
170  B += BB;
171  C += CC;
172  D += DD;
173}
174
175/*
176 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
177 */
178
179#if defined(WORDS_BIGENDIAN)
180static inline uint32_t
181swap_uint32_t (uint32_t t)
182{
183  uint32_t temp1, temp2;
184
185  temp1   = cshift(t, 16);
186  temp2   = temp1 >> 8;
187  temp1  &= 0x00ff00ff;
188  temp2  &= 0x00ff00ff;
189  temp1 <<= 8;
190  return temp1 | temp2;
191}
192#endif
193
194struct x32{
195  unsigned int a:32;
196  unsigned int b:32;
197};
198
199void
200MD5_Update (struct md5 *m, const void *v, size_t len)
201{
202  const unsigned char *p = v;
203  size_t old_sz = m->sz[0];
204  size_t offset;
205
206  m->sz[0] += len * 8;
207  if (m->sz[0] < old_sz)
208      ++m->sz[1];
209  offset = (old_sz / 8)  % 64;
210  while(len > 0){
211    size_t l = min(len, 64 - offset);
212    memcpy(m->save + offset, p, l);
213    offset += l;
214    p += l;
215    len -= l;
216    if(offset == 64){
217#if defined(WORDS_BIGENDIAN)
218      int i;
219      uint32_t current[16];
220      struct x32 *us = (struct x32*)m->save;
221      for(i = 0; i < 8; i++){
222	current[2*i+0] = swap_uint32_t(us[i].a);
223	current[2*i+1] = swap_uint32_t(us[i].b);
224      }
225      calc(m, current);
226#else
227      calc(m, (uint32_t*)m->save);
228#endif
229      offset = 0;
230    }
231  }
232}
233
234void
235MD5_Final (void *res, struct md5 *m)
236{
237  unsigned char zeros[72];
238  unsigned offset = (m->sz[0] / 8) % 64;
239  unsigned int dstart = (120 - offset - 1) % 64 + 1;
240
241  *zeros = 0x80;
242  memset (zeros + 1, 0, sizeof(zeros) - 1);
243  zeros[dstart+0] = (m->sz[0] >> 0) & 0xff;
244  zeros[dstart+1] = (m->sz[0] >> 8) & 0xff;
245  zeros[dstart+2] = (m->sz[0] >> 16) & 0xff;
246  zeros[dstart+3] = (m->sz[0] >> 24) & 0xff;
247  zeros[dstart+4] = (m->sz[1] >> 0) & 0xff;
248  zeros[dstart+5] = (m->sz[1] >> 8) & 0xff;
249  zeros[dstart+6] = (m->sz[1] >> 16) & 0xff;
250  zeros[dstart+7] = (m->sz[1] >> 24) & 0xff;
251  MD5_Update (m, zeros, dstart + 8);
252  {
253      int i;
254      unsigned char *r = (unsigned char *)res;
255
256      for (i = 0; i < 4; ++i) {
257	  r[4*i]   = m->counter[i] & 0xFF;
258	  r[4*i+1] = (m->counter[i] >> 8) & 0xFF;
259	  r[4*i+2] = (m->counter[i] >> 16) & 0xFF;
260	  r[4*i+3] = (m->counter[i] >> 24) & 0xFF;
261      }
262  }
263#if 0
264  {
265    int i;
266    uint32_t *r = (uint32_t *)res;
267
268    for (i = 0; i < 4; ++i)
269      r[i] = swap_uint32_t (m->counter[i]);
270  }
271#endif
272}
273