Important changes to repositories hosted on mbed.com
Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.
To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.
It is also possible to export all your personal repositories from the account settings page.
Fork of CyaSSL by
md5.c
00001 /* md5.c 00002 * 00003 * Copyright (C) 2006-2009 Sawtooth Consulting Ltd. 00004 * 00005 * This file is part of CyaSSL. 00006 * 00007 * CyaSSL is free software; you can redistribute it and/or modify 00008 * it under the terms of the GNU General Public License as published by 00009 * the Free Software Foundation; either version 2 of the License, or 00010 * (at your option) any later version. 00011 * 00012 * CyaSSL is distributed in the hope that it will be useful, 00013 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00014 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00015 * GNU General Public License for more details. 00016 * 00017 * You should have received a copy of the GNU General Public License 00018 * along with this program; if not, write to the Free Software 00019 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA 00020 */ 00021 00022 00023 #include "ctc_md5.h" 00024 #ifdef NO_INLINE 00025 #include "misc.h" 00026 #else 00027 #include "misc.c" 00028 #endif 00029 00030 00031 00032 #ifndef min 00033 00034 static INLINE word32 min(word32 a, word32 b) 00035 { 00036 return a > b ? b : a; 00037 } 00038 00039 #endif /* min */ 00040 00041 00042 void InitMd5(Md5* md5) 00043 { 00044 md5->digest[0] = 0x67452301L; 00045 md5->digest[1] = 0xefcdab89L; 00046 md5->digest[2] = 0x98badcfeL; 00047 md5->digest[3] = 0x10325476L; 00048 00049 md5->buffLen = 0; 00050 md5->loLen = 0; 00051 md5->hiLen = 0; 00052 } 00053 00054 00055 static void Transform(Md5* md5) 00056 { 00057 #define F1(x, y, z) (z ^ (x & (y ^ z))) 00058 #define F2(x, y, z) F1(z, x, y) 00059 #define F3(x, y, z) (x ^ y ^ z) 00060 #define F4(x, y, z) (y ^ (x | ~z)) 00061 00062 #define MD5STEP(f, w, x, y, z, data, s) \ 00063 w = rotlFixed(w + f(x, y, z) + data, s) + x 00064 00065 /* Copy context->state[] to working vars */ 00066 word32 a = md5->digest[0]; 00067 word32 b = md5->digest[1]; 00068 word32 c = md5->digest[2]; 00069 word32 d = md5->digest[3]; 00070 00071 MD5STEP(F1, a, b, c, d, md5->buffer[0] + 0xd76aa478, 7); 00072 MD5STEP(F1, d, a, b, c, md5->buffer[1] + 0xe8c7b756, 12); 00073 MD5STEP(F1, c, d, a, b, md5->buffer[2] + 0x242070db, 17); 00074 MD5STEP(F1, b, c, d, a, md5->buffer[3] + 0xc1bdceee, 22); 00075 MD5STEP(F1, a, b, c, d, md5->buffer[4] + 0xf57c0faf, 7); 00076 MD5STEP(F1, d, a, b, c, md5->buffer[5] + 0x4787c62a, 12); 00077 MD5STEP(F1, c, d, a, b, md5->buffer[6] + 0xa8304613, 17); 00078 MD5STEP(F1, b, c, d, a, md5->buffer[7] + 0xfd469501, 22); 00079 MD5STEP(F1, a, b, c, d, md5->buffer[8] + 0x698098d8, 7); 00080 MD5STEP(F1, d, a, b, c, md5->buffer[9] + 0x8b44f7af, 12); 00081 MD5STEP(F1, c, d, a, b, md5->buffer[10] + 0xffff5bb1, 17); 00082 MD5STEP(F1, b, c, d, a, md5->buffer[11] + 0x895cd7be, 22); 00083 MD5STEP(F1, a, b, c, d, md5->buffer[12] + 0x6b901122, 7); 00084 MD5STEP(F1, d, a, b, c, md5->buffer[13] + 0xfd987193, 12); 00085 MD5STEP(F1, c, d, a, b, md5->buffer[14] + 0xa679438e, 17); 00086 MD5STEP(F1, b, c, d, a, md5->buffer[15] + 0x49b40821, 22); 00087 00088 MD5STEP(F2, a, b, c, d, md5->buffer[1] + 0xf61e2562, 5); 00089 MD5STEP(F2, d, a, b, c, md5->buffer[6] + 0xc040b340, 9); 00090 MD5STEP(F2, c, d, a, b, md5->buffer[11] + 0x265e5a51, 14); 00091 MD5STEP(F2, b, c, d, a, md5->buffer[0] + 0xe9b6c7aa, 20); 00092 MD5STEP(F2, a, b, c, d, md5->buffer[5] + 0xd62f105d, 5); 00093 MD5STEP(F2, d, a, b, c, md5->buffer[10] + 0x02441453, 9); 00094 MD5STEP(F2, c, d, a, b, md5->buffer[15] + 0xd8a1e681, 14); 00095 MD5STEP(F2, b, c, d, a, md5->buffer[4] + 0xe7d3fbc8, 20); 00096 MD5STEP(F2, a, b, c, d, md5->buffer[9] + 0x21e1cde6, 5); 00097 MD5STEP(F2, d, a, b, c, md5->buffer[14] + 0xc33707d6, 9); 00098 MD5STEP(F2, c, d, a, b, md5->buffer[3] + 0xf4d50d87, 14); 00099 MD5STEP(F2, b, c, d, a, md5->buffer[8] + 0x455a14ed, 20); 00100 MD5STEP(F2, a, b, c, d, md5->buffer[13] + 0xa9e3e905, 5); 00101 MD5STEP(F2, d, a, b, c, md5->buffer[2] + 0xfcefa3f8, 9); 00102 MD5STEP(F2, c, d, a, b, md5->buffer[7] + 0x676f02d9, 14); 00103 MD5STEP(F2, b, c, d, a, md5->buffer[12] + 0x8d2a4c8a, 20); 00104 00105 MD5STEP(F3, a, b, c, d, md5->buffer[5] + 0xfffa3942, 4); 00106 MD5STEP(F3, d, a, b, c, md5->buffer[8] + 0x8771f681, 11); 00107 MD5STEP(F3, c, d, a, b, md5->buffer[11] + 0x6d9d6122, 16); 00108 MD5STEP(F3, b, c, d, a, md5->buffer[14] + 0xfde5380c, 23); 00109 MD5STEP(F3, a, b, c, d, md5->buffer[1] + 0xa4beea44, 4); 00110 MD5STEP(F3, d, a, b, c, md5->buffer[4] + 0x4bdecfa9, 11); 00111 MD5STEP(F3, c, d, a, b, md5->buffer[7] + 0xf6bb4b60, 16); 00112 MD5STEP(F3, b, c, d, a, md5->buffer[10] + 0xbebfbc70, 23); 00113 MD5STEP(F3, a, b, c, d, md5->buffer[13] + 0x289b7ec6, 4); 00114 MD5STEP(F3, d, a, b, c, md5->buffer[0] + 0xeaa127fa, 11); 00115 MD5STEP(F3, c, d, a, b, md5->buffer[3] + 0xd4ef3085, 16); 00116 MD5STEP(F3, b, c, d, a, md5->buffer[6] + 0x04881d05, 23); 00117 MD5STEP(F3, a, b, c, d, md5->buffer[9] + 0xd9d4d039, 4); 00118 MD5STEP(F3, d, a, b, c, md5->buffer[12] + 0xe6db99e5, 11); 00119 MD5STEP(F3, c, d, a, b, md5->buffer[15] + 0x1fa27cf8, 16); 00120 MD5STEP(F3, b, c, d, a, md5->buffer[2] + 0xc4ac5665, 23); 00121 00122 MD5STEP(F4, a, b, c, d, md5->buffer[0] + 0xf4292244, 6); 00123 MD5STEP(F4, d, a, b, c, md5->buffer[7] + 0x432aff97, 10); 00124 MD5STEP(F4, c, d, a, b, md5->buffer[14] + 0xab9423a7, 15); 00125 MD5STEP(F4, b, c, d, a, md5->buffer[5] + 0xfc93a039, 21); 00126 MD5STEP(F4, a, b, c, d, md5->buffer[12] + 0x655b59c3, 6); 00127 MD5STEP(F4, d, a, b, c, md5->buffer[3] + 0x8f0ccc92, 10); 00128 MD5STEP(F4, c, d, a, b, md5->buffer[10] + 0xffeff47d, 15); 00129 MD5STEP(F4, b, c, d, a, md5->buffer[1] + 0x85845dd1, 21); 00130 MD5STEP(F4, a, b, c, d, md5->buffer[8] + 0x6fa87e4f, 6); 00131 MD5STEP(F4, d, a, b, c, md5->buffer[15] + 0xfe2ce6e0, 10); 00132 MD5STEP(F4, c, d, a, b, md5->buffer[6] + 0xa3014314, 15); 00133 MD5STEP(F4, b, c, d, a, md5->buffer[13] + 0x4e0811a1, 21); 00134 MD5STEP(F4, a, b, c, d, md5->buffer[4] + 0xf7537e82, 6); 00135 MD5STEP(F4, d, a, b, c, md5->buffer[11] + 0xbd3af235, 10); 00136 MD5STEP(F4, c, d, a, b, md5->buffer[2] + 0x2ad7d2bb, 15); 00137 MD5STEP(F4, b, c, d, a, md5->buffer[9] + 0xeb86d391, 21); 00138 00139 /* Add the working vars back into digest state[] */ 00140 md5->digest[0] += a; 00141 md5->digest[1] += b; 00142 md5->digest[2] += c; 00143 md5->digest[3] += d; 00144 } 00145 00146 00147 static INLINE void AddLength(Md5* md5, word32 len) 00148 { 00149 word32 tmp = md5->loLen; 00150 if ( (md5->loLen += len) < tmp) 00151 md5->hiLen++; /* carry low to high */ 00152 } 00153 00154 00155 void Md5Update(Md5* md5, const byte* data, word32 len) 00156 { 00157 /* do block size increments */ 00158 byte* local = (byte*)md5->buffer; 00159 00160 while (len) { 00161 word32 add = min(len, MD5_BLOCK_SIZE - md5->buffLen); 00162 XMEMCPY(&local[md5->buffLen], data, add); 00163 00164 md5->buffLen += add; 00165 data += add; 00166 len -= add; 00167 00168 if (md5->buffLen == MD5_BLOCK_SIZE) { 00169 #ifdef BIG_ENDIAN_ORDER 00170 ByteReverseBytes(local, local, MD5_BLOCK_SIZE); 00171 #endif 00172 Transform(md5); 00173 AddLength(md5, MD5_BLOCK_SIZE); 00174 md5->buffLen = 0; 00175 } 00176 } 00177 } 00178 00179 00180 void Md5Final(Md5* md5, byte* hash) 00181 { 00182 byte* local = (byte*)md5->buffer; 00183 00184 AddLength(md5, md5->buffLen); /* before adding pads */ 00185 00186 local[md5->buffLen++] = 0x80; /* add 1 */ 00187 00188 /* pad with zeros */ 00189 if (md5->buffLen > MD5_PAD_SIZE) { 00190 XMEMSET(&local[md5->buffLen], 0, MD5_BLOCK_SIZE - md5->buffLen); 00191 md5->buffLen += MD5_BLOCK_SIZE - md5->buffLen; 00192 00193 #ifdef BIG_ENDIAN_ORDER 00194 ByteReverseBytes(local, local, MD5_BLOCK_SIZE); 00195 #endif 00196 Transform(md5); 00197 md5->buffLen = 0; 00198 } 00199 XMEMSET(&local[md5->buffLen], 0, MD5_PAD_SIZE - md5->buffLen); 00200 00201 /* put lengths in bits */ 00202 md5->loLen = md5->loLen << 3; 00203 md5->hiLen = (md5->loLen >> (8*sizeof(md5->loLen) - 3)) + 00204 (md5->hiLen << 3); 00205 00206 /* store lengths */ 00207 #ifdef BIG_ENDIAN_ORDER 00208 ByteReverseBytes(local, local, MD5_BLOCK_SIZE); 00209 #endif 00210 /* ! length ordering dependent on digest endian type ! */ 00211 XMEMCPY(&local[MD5_PAD_SIZE], &md5->loLen, sizeof(word32)); 00212 XMEMCPY(&local[MD5_PAD_SIZE + sizeof(word32)], &md5->hiLen, sizeof(word32)); 00213 00214 Transform(md5); 00215 #ifdef BIG_ENDIAN_ORDER 00216 ByteReverseWords(md5->digest, md5->digest, MD5_DIGEST_SIZE); 00217 #endif 00218 XMEMCPY(hash, md5->digest, MD5_DIGEST_SIZE); 00219 00220 InitMd5(md5); /* reset state */ 00221 } 00222
Generated on Sat Jul 16 2022 04:51:03 by
1.7.2
