3 * Copyright (C) 2006-2012 Sawtooth Consulting Ltd.
5 * This file is part of CyaSSL.
7 * CyaSSL is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
12 * CyaSSL is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
27 #include <cyassl/ctaocrypt/md5.h>
30 #include <cyassl/ctaocrypt/misc.h>
32 #include <ctaocrypt/src/misc.c>
38 static INLINE word32 min(word32 a, word32 b)
46 void InitMd5(Md5* md5)
48 md5->digest[0] = 0x67452301L;
49 md5->digest[1] = 0xefcdab89L;
50 md5->digest[2] = 0x98badcfeL;
51 md5->digest[3] = 0x10325476L;
59 static void Transform(Md5* md5)
61 #define F1(x, y, z) (z ^ (x & (y ^ z)))
62 #define F2(x, y, z) F1(z, x, y)
63 #define F3(x, y, z) (x ^ y ^ z)
64 #define F4(x, y, z) (y ^ (x | ~z))
66 #define MD5STEP(f, w, x, y, z, data, s) \
67 w = rotlFixed(w + f(x, y, z) + data, s) + x
69 /* Copy context->state[] to working vars */
70 word32 a = md5->digest[0];
71 word32 b = md5->digest[1];
72 word32 c = md5->digest[2];
73 word32 d = md5->digest[3];
75 MD5STEP(F1, a, b, c, d, md5->buffer[0] + 0xd76aa478, 7);
76 MD5STEP(F1, d, a, b, c, md5->buffer[1] + 0xe8c7b756, 12);
77 MD5STEP(F1, c, d, a, b, md5->buffer[2] + 0x242070db, 17);
78 MD5STEP(F1, b, c, d, a, md5->buffer[3] + 0xc1bdceee, 22);
79 MD5STEP(F1, a, b, c, d, md5->buffer[4] + 0xf57c0faf, 7);
80 MD5STEP(F1, d, a, b, c, md5->buffer[5] + 0x4787c62a, 12);
81 MD5STEP(F1, c, d, a, b, md5->buffer[6] + 0xa8304613, 17);
82 MD5STEP(F1, b, c, d, a, md5->buffer[7] + 0xfd469501, 22);
83 MD5STEP(F1, a, b, c, d, md5->buffer[8] + 0x698098d8, 7);
84 MD5STEP(F1, d, a, b, c, md5->buffer[9] + 0x8b44f7af, 12);
85 MD5STEP(F1, c, d, a, b, md5->buffer[10] + 0xffff5bb1, 17);
86 MD5STEP(F1, b, c, d, a, md5->buffer[11] + 0x895cd7be, 22);
87 MD5STEP(F1, a, b, c, d, md5->buffer[12] + 0x6b901122, 7);
88 MD5STEP(F1, d, a, b, c, md5->buffer[13] + 0xfd987193, 12);
89 MD5STEP(F1, c, d, a, b, md5->buffer[14] + 0xa679438e, 17);
90 MD5STEP(F1, b, c, d, a, md5->buffer[15] + 0x49b40821, 22);
92 MD5STEP(F2, a, b, c, d, md5->buffer[1] + 0xf61e2562, 5);
93 MD5STEP(F2, d, a, b, c, md5->buffer[6] + 0xc040b340, 9);
94 MD5STEP(F2, c, d, a, b, md5->buffer[11] + 0x265e5a51, 14);
95 MD5STEP(F2, b, c, d, a, md5->buffer[0] + 0xe9b6c7aa, 20);
96 MD5STEP(F2, a, b, c, d, md5->buffer[5] + 0xd62f105d, 5);
97 MD5STEP(F2, d, a, b, c, md5->buffer[10] + 0x02441453, 9);
98 MD5STEP(F2, c, d, a, b, md5->buffer[15] + 0xd8a1e681, 14);
99 MD5STEP(F2, b, c, d, a, md5->buffer[4] + 0xe7d3fbc8, 20);
100 MD5STEP(F2, a, b, c, d, md5->buffer[9] + 0x21e1cde6, 5);
101 MD5STEP(F2, d, a, b, c, md5->buffer[14] + 0xc33707d6, 9);
102 MD5STEP(F2, c, d, a, b, md5->buffer[3] + 0xf4d50d87, 14);
103 MD5STEP(F2, b, c, d, a, md5->buffer[8] + 0x455a14ed, 20);
104 MD5STEP(F2, a, b, c, d, md5->buffer[13] + 0xa9e3e905, 5);
105 MD5STEP(F2, d, a, b, c, md5->buffer[2] + 0xfcefa3f8, 9);
106 MD5STEP(F2, c, d, a, b, md5->buffer[7] + 0x676f02d9, 14);
107 MD5STEP(F2, b, c, d, a, md5->buffer[12] + 0x8d2a4c8a, 20);
109 MD5STEP(F3, a, b, c, d, md5->buffer[5] + 0xfffa3942, 4);
110 MD5STEP(F3, d, a, b, c, md5->buffer[8] + 0x8771f681, 11);
111 MD5STEP(F3, c, d, a, b, md5->buffer[11] + 0x6d9d6122, 16);
112 MD5STEP(F3, b, c, d, a, md5->buffer[14] + 0xfde5380c, 23);
113 MD5STEP(F3, a, b, c, d, md5->buffer[1] + 0xa4beea44, 4);
114 MD5STEP(F3, d, a, b, c, md5->buffer[4] + 0x4bdecfa9, 11);
115 MD5STEP(F3, c, d, a, b, md5->buffer[7] + 0xf6bb4b60, 16);
116 MD5STEP(F3, b, c, d, a, md5->buffer[10] + 0xbebfbc70, 23);
117 MD5STEP(F3, a, b, c, d, md5->buffer[13] + 0x289b7ec6, 4);
118 MD5STEP(F3, d, a, b, c, md5->buffer[0] + 0xeaa127fa, 11);
119 MD5STEP(F3, c, d, a, b, md5->buffer[3] + 0xd4ef3085, 16);
120 MD5STEP(F3, b, c, d, a, md5->buffer[6] + 0x04881d05, 23);
121 MD5STEP(F3, a, b, c, d, md5->buffer[9] + 0xd9d4d039, 4);
122 MD5STEP(F3, d, a, b, c, md5->buffer[12] + 0xe6db99e5, 11);
123 MD5STEP(F3, c, d, a, b, md5->buffer[15] + 0x1fa27cf8, 16);
124 MD5STEP(F3, b, c, d, a, md5->buffer[2] + 0xc4ac5665, 23);
126 MD5STEP(F4, a, b, c, d, md5->buffer[0] + 0xf4292244, 6);
127 MD5STEP(F4, d, a, b, c, md5->buffer[7] + 0x432aff97, 10);
128 MD5STEP(F4, c, d, a, b, md5->buffer[14] + 0xab9423a7, 15);
129 MD5STEP(F4, b, c, d, a, md5->buffer[5] + 0xfc93a039, 21);
130 MD5STEP(F4, a, b, c, d, md5->buffer[12] + 0x655b59c3, 6);
131 MD5STEP(F4, d, a, b, c, md5->buffer[3] + 0x8f0ccc92, 10);
132 MD5STEP(F4, c, d, a, b, md5->buffer[10] + 0xffeff47d, 15);
133 MD5STEP(F4, b, c, d, a, md5->buffer[1] + 0x85845dd1, 21);
134 MD5STEP(F4, a, b, c, d, md5->buffer[8] + 0x6fa87e4f, 6);
135 MD5STEP(F4, d, a, b, c, md5->buffer[15] + 0xfe2ce6e0, 10);
136 MD5STEP(F4, c, d, a, b, md5->buffer[6] + 0xa3014314, 15);
137 MD5STEP(F4, b, c, d, a, md5->buffer[13] + 0x4e0811a1, 21);
138 MD5STEP(F4, a, b, c, d, md5->buffer[4] + 0xf7537e82, 6);
139 MD5STEP(F4, d, a, b, c, md5->buffer[11] + 0xbd3af235, 10);
140 MD5STEP(F4, c, d, a, b, md5->buffer[2] + 0x2ad7d2bb, 15);
141 MD5STEP(F4, b, c, d, a, md5->buffer[9] + 0xeb86d391, 21);
143 /* Add the working vars back into digest state[] */
151 static INLINE void AddLength(Md5* md5, word32 len)
153 word32 tmp = md5->loLen;
154 if ( (md5->loLen += len) < tmp)
155 md5->hiLen++; /* carry low to high */
159 void Md5Update(Md5* md5, const byte* data, word32 len)
161 /* do block size increments */
162 byte* local = (byte*)md5->buffer;
165 word32 add = min(len, MD5_BLOCK_SIZE - md5->buffLen);
166 XMEMCPY(&local[md5->buffLen], data, add);
172 if (md5->buffLen == MD5_BLOCK_SIZE) {
173 #ifdef BIG_ENDIAN_ORDER
174 ByteReverseBytes(local, local, MD5_BLOCK_SIZE);
177 AddLength(md5, MD5_BLOCK_SIZE);
184 void Md5Final(Md5* md5, byte* hash)
186 byte* local = (byte*)md5->buffer;
188 AddLength(md5, md5->buffLen); /* before adding pads */
190 local[md5->buffLen++] = 0x80; /* add 1 */
193 if (md5->buffLen > MD5_PAD_SIZE) {
194 XMEMSET(&local[md5->buffLen], 0, MD5_BLOCK_SIZE - md5->buffLen);
195 md5->buffLen += MD5_BLOCK_SIZE - md5->buffLen;
197 #ifdef BIG_ENDIAN_ORDER
198 ByteReverseBytes(local, local, MD5_BLOCK_SIZE);
203 XMEMSET(&local[md5->buffLen], 0, MD5_PAD_SIZE - md5->buffLen);
205 /* put lengths in bits */
206 md5->hiLen = (md5->loLen >> (8*sizeof(md5->loLen) - 3)) +
208 md5->loLen = md5->loLen << 3;
211 #ifdef BIG_ENDIAN_ORDER
212 ByteReverseBytes(local, local, MD5_BLOCK_SIZE);
214 /* ! length ordering dependent on digest endian type ! */
215 XMEMCPY(&local[MD5_PAD_SIZE], &md5->loLen, sizeof(word32));
216 XMEMCPY(&local[MD5_PAD_SIZE + sizeof(word32)], &md5->hiLen, sizeof(word32));
219 #ifdef BIG_ENDIAN_ORDER
220 ByteReverseWords(md5->digest, md5->digest, MD5_DIGEST_SIZE);
222 XMEMCPY(hash, md5->digest, MD5_DIGEST_SIZE);
224 InitMd5(md5); /* reset state */