[u/mdw/putty] / sshmd5.c

/* This code has been heavily hacked by Tatu Ylonen <ylo@cs.hut.fi> to
   make it compile on machines like Cray that don't have a 32 bit integer
   type. */
/*
 * This code implements the MD5 message-digest algorithm.
 * The algorithm is due to Ron Rivest.  This code was
 * written by Colin Plumb in 1993, no copyright is claimed.
 * This code is in the public domain; do with it what you wish.
 *
 * Equivalent code is available from RSA Data Security, Inc.
 * This code has been tested against that, and is equivalent,
 * except that you don't need to include two pages of legalese
 * with every copy.
 *
 * To compute the message digest of a chunk of bytes, declare an
 * MD5Context structure, pass it to MD5Init, call MD5Update as
 * needed on buffers full of bytes, and then call MD5Final, which
 * will fill a supplied 16-byte array with the digest.
 */

#include "ssh.h"

#define GET_32BIT_LSB_FIRST(cp) \
  (((unsigned long)(unsigned char)(cp)[0]) | \
  ((unsigned long)(unsigned char)(cp)[1] << 8) | \
  ((unsigned long)(unsigned char)(cp)[2] << 16) | \
  ((unsigned long)(unsigned char)(cp)[3] << 24))

#define PUT_32BIT_LSB_FIRST(cp, value) do { \
  (cp)[0] = (value); \
  (cp)[1] = (value) >> 8; \
  (cp)[2] = (value) >> 16; \
  (cp)[3] = (value) >> 24; } while (0)

void MD5Transform(uint32 buf[4], const unsigned char in[64]);

/*
 * Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious
 * initialization constants.
 */
void MD5Init(struct MD5Context *ctx)
{
    ctx->buf[0] = 0x67452301;
    ctx->buf[1] = 0xefcdab89;
    ctx->buf[2] = 0x98badcfe;
    ctx->buf[3] = 0x10325476;

    ctx->bits[0] = 0;
    ctx->bits[1] = 0;
}

/*
 * Update context to reflect the concatenation of another buffer full
 * of bytes.
 */
void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
{
    uint32 t;

    /* Update bitcount */

    t = ctx->bits[0];
    if ((ctx->bits[0] = (t + ((uint32)len << 3)) & 0xffffffff) < t)
	ctx->bits[1]++;		/* Carry from low to high */
    ctx->bits[1] += len >> 29;

    t = (t >> 3) & 0x3f;	/* Bytes already in shsInfo->data */

    /* Handle any leading odd-sized chunks */

    if (t) {
	unsigned char *p = ctx->in + t;

	t = 64 - t;
	if (len < t) {
	    memcpy(p, buf, len);
	    return;
	}
	memcpy(p, buf, t);
	MD5Transform(ctx->buf, ctx->in);
	buf += t;
	len -= t;
    }
    /* Process data in 64-byte chunks */

    while (len >= 64) {
	memcpy(ctx->in, buf, 64);
	MD5Transform(ctx->buf, ctx->in);
	buf += 64;
	len -= 64;
    }

    /* Handle any remaining bytes of data. */

    memcpy(ctx->in, buf, len);
}

/*
 * Final wrapup - pad to 64-byte boundary with the bit pattern 
 * 1 0* (64-bit count of bits processed, MSB-first)
 */
void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
{
    unsigned count;
    unsigned char *p;

    /* Compute number of bytes mod 64 */
    count = (ctx->bits[0] >> 3) & 0x3F;

    /* Set the first char of padding to 0x80.  This is safe since there is
       always at least one byte free */
    p = ctx->in + count;
    *p++ = 0x80;

    /* Bytes of padding needed to make 64 bytes */
    count = 64 - 1 - count;

    /* Pad out to 56 mod 64 */
    if (count < 8) {
	/* Two lots of padding:  Pad the first block to 64 bytes */
	memset(p, 0, count);
	MD5Transform(ctx->buf, ctx->in);

	/* Now fill the next block with 56 bytes */
	memset(ctx->in, 0, 56);
    } else {
	/* Pad block to 56 bytes */
	memset(p, 0, count - 8);
    }

    /* Append length in bits and transform */
    PUT_32BIT_LSB_FIRST(ctx->in + 56, ctx->bits[0]);
    PUT_32BIT_LSB_FIRST(ctx->in + 60, ctx->bits[1]);

    MD5Transform(ctx->buf, ctx->in);
    PUT_32BIT_LSB_FIRST(digest, ctx->buf[0]);
    PUT_32BIT_LSB_FIRST(digest + 4, ctx->buf[1]);
    PUT_32BIT_LSB_FIRST(digest + 8, ctx->buf[2]);
    PUT_32BIT_LSB_FIRST(digest + 12, ctx->buf[3]);
    memset(ctx, 0, sizeof(ctx));	/* In case it's sensitive */
}

#ifndef ASM_MD5

/* The four core functions - F1 is optimized somewhat */

/* #define F1(x, y, z) (x & y | ~x & z) */
#define F1(x, y, z) (z ^ (x & (y ^ z)))
#define F2(x, y, z) F1(z, x, y)
#define F3(x, y, z) (x ^ y ^ z)
#define F4(x, y, z) (y ^ (x | ~z))

/* This is the central step in the MD5 algorithm. */
#define MD5STEP(f, w, x, y, z, data, s) \
	( w += f(x, y, z) + data,  w = w<<s | w>>(32-s),  w += x )

/*
 * The core of the MD5 algorithm, this alters an existing MD5 hash to
 * reflect the addition of 16 longwords of new data.  MD5Update blocks
 * the data and converts bytes into longwords for this routine.
 */
void MD5Transform(uint32 buf[4], const unsigned char inext[64])
{
    register word32 a, b, c, d, i;
    word32 in[16];
    
    for (i = 0; i < 16; i++)
      in[i] = GET_32BIT_LSB_FIRST(inext + 4 * i);

    a = buf[0];
    b = buf[1];
    c = buf[2];
    d = buf[3];

    MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
    MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
    MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
    MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
    MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
    MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
    MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
    MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
    MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
    MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
    MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
    MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
    MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
    MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
    MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
    MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);

    MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
    MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
    MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
    MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
    MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
    MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
    MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
    MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
    MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
    MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
    MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
    MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
    MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
    MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
    MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
    MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);

    MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
    MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
    MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
    MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
    MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
    MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
    MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
    MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
    MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
    MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
    MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
    MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
    MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
    MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
    MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
    MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);

    MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
    MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
    MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
    MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
    MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
    MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
    MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
    MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
    MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
    MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
    MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
    MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
    MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
    MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
    MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
    MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);

    buf[0] += a;
    buf[1] += b;
    buf[2] += c;
    buf[3] += d;
}

#endif
Commit	Line	Data
374330e2	1	/* This code has been heavily hacked by Tatu Ylonen <ylo@cs.hut.fi> to
	2	make it compile on machines like Cray that don't have a 32 bit integer
	3	type. */
	4	/*
	5	* This code implements the MD5 message-digest algorithm.
	6	* The algorithm is due to Ron Rivest. This code was
	7	* written by Colin Plumb in 1993, no copyright is claimed.
	8	* This code is in the public domain; do with it what you wish.
	9	*
	10	* Equivalent code is available from RSA Data Security, Inc.
	11	* This code has been tested against that, and is equivalent,
	12	* except that you don't need to include two pages of legalese
	13	* with every copy.
	14	*
	15	* To compute the message digest of a chunk of bytes, declare an
	16	* MD5Context structure, pass it to MD5Init, call MD5Update as
	17	* needed on buffers full of bytes, and then call MD5Final, which
	18	* will fill a supplied 16-byte array with the digest.
	19	*/
	20
	21	#include "ssh.h"
	22
	23	#define GET_32BIT_LSB_FIRST(cp) \
	24	(((unsigned long)(unsigned char)(cp)[0]) \| \
	25	((unsigned long)(unsigned char)(cp)[1] << 8) \| \
	26	((unsigned long)(unsigned char)(cp)[2] << 16) \| \
	27	((unsigned long)(unsigned char)(cp)[3] << 24))
	28
	29	#define PUT_32BIT_LSB_FIRST(cp, value) do { \
	30	(cp)[0] = (value); \
	31	(cp)[1] = (value) >> 8; \
	32	(cp)[2] = (value) >> 16; \
	33	(cp)[3] = (value) >> 24; } while (0)
	34
	35	void MD5Transform(uint32 buf[4], const unsigned char in[64]);
	36
	37	/*
	38	* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
	39	* initialization constants.
	40	*/
	41	void MD5Init(struct MD5Context *ctx)
	42	{
	43	ctx->buf[0] = 0x67452301;
	44	ctx->buf[1] = 0xefcdab89;
	45	ctx->buf[2] = 0x98badcfe;
	46	ctx->buf[3] = 0x10325476;
	47
	48	ctx->bits[0] = 0;
	49	ctx->bits[1] = 0;
	50	}
	51
	52	/*
	53	* Update context to reflect the concatenation of another buffer full
	54	* of bytes.
	55	*/
	56	void MD5Update(struct MD5Context ctx, unsigned char const buf, unsigned len)
	57	{
	58	uint32 t;
	59
	60	/* Update bitcount */
	61
	62	t = ctx->bits[0];
	63	if ((ctx->bits[0] = (t + ((uint32)len << 3)) & 0xffffffff) < t)
	64	ctx->bits[1]++; /* Carry from low to high */
65	ctx->bits[1] += len >> 29;
66
67	t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
68
69	/* Handle any leading odd-sized chunks */
70
71	if (t) {
72	unsigned char *p = ctx->in + t;
73
74	t = 64 - t;
75	if (len < t) {
76	memcpy(p, buf, len);
77	return;
78	}
79	memcpy(p, buf, t);
80	MD5Transform(ctx->buf, ctx->in);
81	buf += t;
82	len -= t;
83	}
84	/* Process data in 64-byte chunks */
85
86	while (len >= 64) {
87	memcpy(ctx->in, buf, 64);
88	MD5Transform(ctx->buf, ctx->in);
89	buf += 64;
90	len -= 64;
91	}
92
93	/* Handle any remaining bytes of data. */
94
95	memcpy(ctx->in, buf, len);
96	}
97
98	/*
99	* Final wrapup - pad to 64-byte boundary with the bit pattern
100	* 1 0* (64-bit count of bits processed, MSB-first)
101	*/
102	void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
103	{
104	unsigned count;
105	unsigned char *p;
106
107	/* Compute number of bytes mod 64 */
108	count = (ctx->bits[0] >> 3) & 0x3F;
109
110	/* Set the first char of padding to 0x80. This is safe since there is
111	always at least one byte free */
112	p = ctx->in + count;
113	*p++ = 0x80;
114
115	/* Bytes of padding needed to make 64 bytes */
116	count = 64 - 1 - count;
117
118	/* Pad out to 56 mod 64 */
119	if (count < 8) {
120	/* Two lots of padding: Pad the first block to 64 bytes */
121	memset(p, 0, count);
122	MD5Transform(ctx->buf, ctx->in);
123
124	/* Now fill the next block with 56 bytes */
125	memset(ctx->in, 0, 56);
126	} else {
127	/* Pad block to 56 bytes */
128	memset(p, 0, count - 8);
129	}
130
131	/* Append length in bits and transform */
132	PUT_32BIT_LSB_FIRST(ctx->in + 56, ctx->bits[0]);
133	PUT_32BIT_LSB_FIRST(ctx->in + 60, ctx->bits[1]);
134
135	MD5Transform(ctx->buf, ctx->in);
136	PUT_32BIT_LSB_FIRST(digest, ctx->buf[0]);
137	PUT_32BIT_LSB_FIRST(digest + 4, ctx->buf[1]);
138	PUT_32BIT_LSB_FIRST(digest + 8, ctx->buf[2]);
139	PUT_32BIT_LSB_FIRST(digest + 12, ctx->buf[3]);
140	memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
141	}
142
143	#ifndef ASM_MD5
144
145	/* The four core functions - F1 is optimized somewhat */
146
147	/* #define F1(x, y, z) (x & y \| ~x & z) */
148	#define F1(x, y, z) (z ^ (x & (y ^ z)))
149	#define F2(x, y, z) F1(z, x, y)
150	#define F3(x, y, z) (x ^ y ^ z)
151	#define F4(x, y, z) (y ^ (x \| ~z))
152
153	/* This is the central step in the MD5 algorithm. */
154	#define MD5STEP(f, w, x, y, z, data, s) \
155	( w += f(x, y, z) + data, w = w<<s \| w>>(32-s), w += x )
156
157	/*
158	* The core of the MD5 algorithm, this alters an existing MD5 hash to
159	* reflect the addition of 16 longwords of new data. MD5Update blocks
160	* the data and converts bytes into longwords for this routine.
161	*/
162	void MD5Transform(uint32 buf[4], const unsigned char inext[64])
163	{
164	register word32 a, b, c, d, i;
165	word32 in[16];
166
167	for (i = 0; i < 16; i++)
168	in[i] = GET_32BIT_LSB_FIRST(inext + 4 * i);
169
170	a = buf[0];
171	b = buf[1];
172	c = buf[2];
173	d = buf[3];
174
175	MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
176	MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
177	MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
178	MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
179	MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
180	MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
181	MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
182	MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
183	MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
184	MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
185	MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
186	MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
187	MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
188	MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
189	MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
190	MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
191
192	MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
193	MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
194	MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
195	MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
196	MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
197	MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
198	MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
199	MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
200	MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
201	MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
202	MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
203	MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
204	MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
205	MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
206	MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
207	MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
208
209	MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
210	MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
211	MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
212	MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
213	MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
214	MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
215	MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
216	MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
217	MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
218	MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
219	MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
220	MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
221	MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
222	MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
223	MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
224	MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
225
226	MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
227	MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
228	MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
229	MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
230	MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
231	MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
232	MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
233	MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
234	MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
235	MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
236	MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
237	MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
238	MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
239	MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
240	MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
241	MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
242
243	buf[0] += a;
244	buf[1] += b;
245	buf[2] += c;
246	buf[3] += d;
247	}
248
249	#endif