cyassl re-port with cellular comms, PSK test

Dependencies:   VodafoneUSBModem_bleedingedge2 mbed-rtos mbed-src

Embed: (wiki syntax)

« Back to documentation index

Show/hide line numbers md5.c Source File

md5.c

00001 /* md5.c
00002  *
00003  * Copyright (C) 2006-2012 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 #ifdef HAVE_CONFIG_H
00024     #include <config.h>
00025 #endif
00026 
00027 #include <cyassl/ctaocrypt/md5.h>
00028 
00029 #ifdef NO_INLINE
00030     #include <cyassl/ctaocrypt/misc.h>
00031 #else
00032     #include <ctaocrypt/src/misc.c>
00033 #endif
00034 
00035 
00036 #ifdef STM32F2_CRYPTO
00037     /*
00038      * STM32F2 hardware MD5 support through the STM32F2 standard peripheral
00039      * library. Documentation located in STM32F2xx Standard Peripheral Library
00040      * document (See note in README).
00041      */
00042     #include "stm32f2xx.h"
00043 
00044     void InitMd5(Md5* md5)
00045     {
00046         /* STM32F2 struct notes:
00047          * md5->buffer  = first 4 bytes used to hold partial block if needed 
00048          * md5->buffLen = num bytes currently stored in md5->buffer
00049          * md5->loLen   = num bytes that have been written to STM32 FIFO
00050          */
00051         XMEMSET(md5->buffer, 0, MD5_REG_SIZE);
00052         md5->buffLen = 0;
00053         md5->loLen = 0;
00054 
00055         /* initialize HASH peripheral */
00056         HASH_DeInit();
00057 
00058         /* configure algo used, algo mode, datatype */
00059         HASH->CR &= ~ (HASH_CR_ALGO | HASH_CR_DATATYPE | HASH_CR_MODE);
00060         HASH->CR |= (HASH_AlgoSelection_MD5 | HASH_AlgoMode_HASH 
00061                  | HASH_DataType_8b);
00062 
00063         /* reset HASH processor */
00064         HASH->CR |= HASH_CR_INIT;
00065     }
00066 
00067     void Md5Update(Md5* md5, const byte* data, word32 len)
00068     {
00069         word32 i = 0;
00070         word32 fill = 0;
00071         word32 diff = 0;
00072 
00073         /* if saved partial block is available */
00074         if (md5->buffLen > 0) {
00075             fill = 4 - md5->buffLen;
00076 
00077             /* if enough data to fill, fill and push to FIFO */
00078             if (fill <= len) {
00079                 XMEMCPY((byte*)md5->buffer + md5->buffLen, data, fill);
00080                 HASH_DataIn(*(uint32_t*)md5->buffer);
00081 
00082                 data += fill;
00083                 len -= fill;
00084                 md5->loLen += 4;
00085                 md5->buffLen = 0;
00086             } else {
00087                 /* append partial to existing stored block */
00088                 XMEMCPY((byte*)md5->buffer + md5->buffLen, data, len);
00089                 md5->buffLen += len;
00090                 return;
00091             }
00092         }
00093 
00094         /* write input block in the IN FIFO */
00095         for (i = 0; i < len; i += 4)
00096         {
00097             diff = len - i;
00098             if (diff < 4) {
00099                 /* store incomplete last block, not yet in FIFO */
00100                 XMEMSET(md5->buffer, 0, MD5_REG_SIZE);
00101                 XMEMCPY((byte*)md5->buffer, data, diff);
00102                 md5->buffLen = diff;
00103             } else {
00104                 HASH_DataIn(*(uint32_t*)data);
00105                 data+=4;
00106             }
00107         }
00108 
00109         /* keep track of total data length thus far */
00110         md5->loLen += (len - md5->buffLen);
00111     }
00112 
00113     void Md5Final(Md5* md5, byte* hash)
00114     {
00115         __IO uint16_t nbvalidbitsdata = 0;
00116 
00117         /* finish reading any trailing bytes into FIFO */
00118         if (md5->buffLen > 0) {
00119             HASH_DataIn(*(uint32_t*)md5->buffer);
00120             md5->loLen += md5->buffLen;
00121         }
00122 
00123         /* calculate number of valid bits in last word of input data */
00124         nbvalidbitsdata = 8 * (md5->loLen % MD5_REG_SIZE);
00125 
00126         /* configure number of valid bits in last word of the data */
00127         HASH_SetLastWordValidBitsNbr(nbvalidbitsdata);
00128 
00129         /* start HASH processor */
00130         HASH_StartDigest();
00131 
00132         /* wait until Busy flag == RESET */
00133         while (HASH_GetFlagStatus(HASH_FLAG_BUSY) != RESET) {}
00134         
00135         /* read message digest */
00136         md5->digest[0] = HASH->HR[0];
00137         md5->digest[1] = HASH->HR[1];
00138         md5->digest[2] = HASH->HR[2];
00139         md5->digest[3] = HASH->HR[3];
00140 
00141         ByteReverseWords(md5->digest, md5->digest, MD5_DIGEST_SIZE);
00142 
00143         XMEMCPY(hash, md5->digest, MD5_DIGEST_SIZE);
00144 
00145         InitMd5(md5);  /* reset state */
00146     }
00147 
00148 #else /* CTaoCrypt software implementation */
00149 
00150 #ifndef min
00151 
00152     static INLINE word32 min(word32 a, word32 b)
00153     {
00154         return a > b ? b : a;
00155     }
00156 
00157 #endif /* min */
00158 
00159 
00160 void InitMd5(Md5* md5)
00161 {
00162     md5->digest[0] = 0x67452301L;
00163     md5->digest[1] = 0xefcdab89L;
00164     md5->digest[2] = 0x98badcfeL;
00165     md5->digest[3] = 0x10325476L;
00166 
00167     md5->buffLen = 0;
00168     md5->loLen   = 0;
00169     md5->hiLen   = 0;
00170 }
00171 
00172 
00173 static void Transform(Md5* md5)
00174 {
00175 #define F1(x, y, z) (z ^ (x & (y ^ z)))
00176 #define F2(x, y, z) F1(z, x, y)
00177 #define F3(x, y, z) (x ^ y ^ z)
00178 #define F4(x, y, z) (y ^ (x | ~z))
00179 
00180 #define MD5STEP(f, w, x, y, z, data, s) \
00181     w = rotlFixed(w + f(x, y, z) + data, s) + x
00182 
00183     /* Copy context->state[] to working vars  */
00184     word32 a = md5->digest[0];
00185     word32 b = md5->digest[1];
00186     word32 c = md5->digest[2];
00187     word32 d = md5->digest[3];
00188 
00189     MD5STEP(F1, a, b, c, d, md5->buffer[0]  + 0xd76aa478,  7);
00190     MD5STEP(F1, d, a, b, c, md5->buffer[1]  + 0xe8c7b756, 12);
00191     MD5STEP(F1, c, d, a, b, md5->buffer[2]  + 0x242070db, 17);
00192     MD5STEP(F1, b, c, d, a, md5->buffer[3]  + 0xc1bdceee, 22);
00193     MD5STEP(F1, a, b, c, d, md5->buffer[4]  + 0xf57c0faf,  7);
00194     MD5STEP(F1, d, a, b, c, md5->buffer[5]  + 0x4787c62a, 12);
00195     MD5STEP(F1, c, d, a, b, md5->buffer[6]  + 0xa8304613, 17);
00196     MD5STEP(F1, b, c, d, a, md5->buffer[7]  + 0xfd469501, 22);
00197     MD5STEP(F1, a, b, c, d, md5->buffer[8]  + 0x698098d8,  7);
00198     MD5STEP(F1, d, a, b, c, md5->buffer[9]  + 0x8b44f7af, 12);
00199     MD5STEP(F1, c, d, a, b, md5->buffer[10] + 0xffff5bb1, 17);
00200     MD5STEP(F1, b, c, d, a, md5->buffer[11] + 0x895cd7be, 22);
00201     MD5STEP(F1, a, b, c, d, md5->buffer[12] + 0x6b901122,  7);
00202     MD5STEP(F1, d, a, b, c, md5->buffer[13] + 0xfd987193, 12);
00203     MD5STEP(F1, c, d, a, b, md5->buffer[14] + 0xa679438e, 17);
00204     MD5STEP(F1, b, c, d, a, md5->buffer[15] + 0x49b40821, 22);
00205 
00206     MD5STEP(F2, a, b, c, d, md5->buffer[1]  + 0xf61e2562,  5);
00207     MD5STEP(F2, d, a, b, c, md5->buffer[6]  + 0xc040b340,  9);
00208     MD5STEP(F2, c, d, a, b, md5->buffer[11] + 0x265e5a51, 14);
00209     MD5STEP(F2, b, c, d, a, md5->buffer[0]  + 0xe9b6c7aa, 20);
00210     MD5STEP(F2, a, b, c, d, md5->buffer[5]  + 0xd62f105d,  5);
00211     MD5STEP(F2, d, a, b, c, md5->buffer[10] + 0x02441453,  9);
00212     MD5STEP(F2, c, d, a, b, md5->buffer[15] + 0xd8a1e681, 14);
00213     MD5STEP(F2, b, c, d, a, md5->buffer[4]  + 0xe7d3fbc8, 20);
00214     MD5STEP(F2, a, b, c, d, md5->buffer[9]  + 0x21e1cde6,  5);
00215     MD5STEP(F2, d, a, b, c, md5->buffer[14] + 0xc33707d6,  9);
00216     MD5STEP(F2, c, d, a, b, md5->buffer[3]  + 0xf4d50d87, 14);
00217     MD5STEP(F2, b, c, d, a, md5->buffer[8]  + 0x455a14ed, 20);
00218     MD5STEP(F2, a, b, c, d, md5->buffer[13] + 0xa9e3e905,  5);
00219     MD5STEP(F2, d, a, b, c, md5->buffer[2]  + 0xfcefa3f8,  9);
00220     MD5STEP(F2, c, d, a, b, md5->buffer[7]  + 0x676f02d9, 14);
00221     MD5STEP(F2, b, c, d, a, md5->buffer[12] + 0x8d2a4c8a, 20);
00222 
00223     MD5STEP(F3, a, b, c, d, md5->buffer[5]  + 0xfffa3942,  4);
00224     MD5STEP(F3, d, a, b, c, md5->buffer[8]  + 0x8771f681, 11);
00225     MD5STEP(F3, c, d, a, b, md5->buffer[11] + 0x6d9d6122, 16);
00226     MD5STEP(F3, b, c, d, a, md5->buffer[14] + 0xfde5380c, 23);
00227     MD5STEP(F3, a, b, c, d, md5->buffer[1]  + 0xa4beea44,  4);
00228     MD5STEP(F3, d, a, b, c, md5->buffer[4]  + 0x4bdecfa9, 11);
00229     MD5STEP(F3, c, d, a, b, md5->buffer[7]  + 0xf6bb4b60, 16);
00230     MD5STEP(F3, b, c, d, a, md5->buffer[10] + 0xbebfbc70, 23);
00231     MD5STEP(F3, a, b, c, d, md5->buffer[13] + 0x289b7ec6,  4);
00232     MD5STEP(F3, d, a, b, c, md5->buffer[0]  + 0xeaa127fa, 11);
00233     MD5STEP(F3, c, d, a, b, md5->buffer[3]  + 0xd4ef3085, 16);
00234     MD5STEP(F3, b, c, d, a, md5->buffer[6]  + 0x04881d05, 23);
00235     MD5STEP(F3, a, b, c, d, md5->buffer[9]  + 0xd9d4d039,  4);
00236     MD5STEP(F3, d, a, b, c, md5->buffer[12] + 0xe6db99e5, 11);
00237     MD5STEP(F3, c, d, a, b, md5->buffer[15] + 0x1fa27cf8, 16);
00238     MD5STEP(F3, b, c, d, a, md5->buffer[2]  + 0xc4ac5665, 23);
00239 
00240     MD5STEP(F4, a, b, c, d, md5->buffer[0]  + 0xf4292244,  6);
00241     MD5STEP(F4, d, a, b, c, md5->buffer[7]  + 0x432aff97, 10);
00242     MD5STEP(F4, c, d, a, b, md5->buffer[14] + 0xab9423a7, 15);
00243     MD5STEP(F4, b, c, d, a, md5->buffer[5]  + 0xfc93a039, 21);
00244     MD5STEP(F4, a, b, c, d, md5->buffer[12] + 0x655b59c3,  6);
00245     MD5STEP(F4, d, a, b, c, md5->buffer[3]  + 0x8f0ccc92, 10);
00246     MD5STEP(F4, c, d, a, b, md5->buffer[10] + 0xffeff47d, 15);
00247     MD5STEP(F4, b, c, d, a, md5->buffer[1]  + 0x85845dd1, 21);
00248     MD5STEP(F4, a, b, c, d, md5->buffer[8]  + 0x6fa87e4f,  6);
00249     MD5STEP(F4, d, a, b, c, md5->buffer[15] + 0xfe2ce6e0, 10);
00250     MD5STEP(F4, c, d, a, b, md5->buffer[6]  + 0xa3014314, 15);
00251     MD5STEP(F4, b, c, d, a, md5->buffer[13] + 0x4e0811a1, 21);
00252     MD5STEP(F4, a, b, c, d, md5->buffer[4]  + 0xf7537e82,  6);
00253     MD5STEP(F4, d, a, b, c, md5->buffer[11] + 0xbd3af235, 10);
00254     MD5STEP(F4, c, d, a, b, md5->buffer[2]  + 0x2ad7d2bb, 15);
00255     MD5STEP(F4, b, c, d, a, md5->buffer[9]  + 0xeb86d391, 21);
00256     
00257     /* Add the working vars back into digest state[]  */
00258     md5->digest[0] += a;
00259     md5->digest[1] += b;
00260     md5->digest[2] += c;
00261     md5->digest[3] += d;
00262 }
00263 
00264 
00265 static INLINE void AddLength(Md5* md5, word32 len)
00266 {
00267     word32 tmp = md5->loLen;
00268     if ( (md5->loLen += len) < tmp)
00269         md5->hiLen++;                       /* carry low to high */
00270 }
00271 
00272 
00273 void Md5Update(Md5* md5, const byte* data, word32 len)
00274 {
00275     /* do block size increments */
00276     byte* local = (byte*)md5->buffer;
00277 
00278     while (len) {
00279         word32 add = min(len, MD5_BLOCK_SIZE - md5->buffLen);
00280         XMEMCPY(&local[md5->buffLen], data, add);
00281 
00282         md5->buffLen += add;
00283         data         += add;
00284         len          -= add;
00285 
00286         if (md5->buffLen == MD5_BLOCK_SIZE) {
00287             #ifdef BIG_ENDIAN_ORDER
00288                 ByteReverseBytes(local, local, MD5_BLOCK_SIZE);
00289             #endif
00290             Transform(md5);
00291             AddLength(md5, MD5_BLOCK_SIZE);
00292             md5->buffLen = 0;
00293         }
00294     }
00295 }
00296 
00297 
00298 void Md5Final(Md5* md5, byte* hash)
00299 {
00300     byte* local = (byte*)md5->buffer;
00301 
00302     AddLength(md5, md5->buffLen);               /* before adding pads */
00303 
00304     local[md5->buffLen++] = 0x80;  /* add 1 */
00305 
00306     /* pad with zeros */
00307     if (md5->buffLen > MD5_PAD_SIZE) {
00308         XMEMSET(&local[md5->buffLen], 0, MD5_BLOCK_SIZE - md5->buffLen);
00309         md5->buffLen += MD5_BLOCK_SIZE - md5->buffLen;
00310 
00311         #ifdef BIG_ENDIAN_ORDER
00312             ByteReverseBytes(local, local, MD5_BLOCK_SIZE);
00313         #endif
00314         Transform(md5);
00315         md5->buffLen = 0;
00316     }
00317     XMEMSET(&local[md5->buffLen], 0, MD5_PAD_SIZE - md5->buffLen);
00318    
00319     /* put lengths in bits */
00320     md5->hiLen = (md5->loLen >> (8*sizeof(md5->loLen) - 3)) + 
00321                  (md5->hiLen << 3);
00322     md5->loLen = md5->loLen << 3;
00323 
00324     /* store lengths */
00325     #ifdef BIG_ENDIAN_ORDER
00326         ByteReverseBytes(local, local, MD5_BLOCK_SIZE);
00327     #endif
00328     /* ! length ordering dependent on digest endian type ! */
00329     XMEMCPY(&local[MD5_PAD_SIZE], &md5->loLen, sizeof(word32));
00330     XMEMCPY(&local[MD5_PAD_SIZE + sizeof(word32)], &md5->hiLen, sizeof(word32));
00331 
00332     Transform(md5);
00333     #ifdef BIG_ENDIAN_ORDER
00334         ByteReverseWords(md5->digest, md5->digest, MD5_DIGEST_SIZE);
00335     #endif
00336     XMEMCPY(hash, md5->digest, MD5_DIGEST_SIZE);
00337 
00338     InitMd5(md5);  /* reset state */
00339 }
00340 
00341 #endif /* STM32F2_CRYPTO */
00342