MultiTech / CyaSSL

A library for setting up Secure Socket Layer (SSL) connections and verifying remote hosts using certificates. Contains only the source files for mbed platform implementation of the library.

Dependents:   HTTPClient-SSL HTTPClient-SSL HTTPClient-SSL HTTPClient-SSL

ctaocrypt/src/sha.c@6:cf58d49e1a86, 2015-03-23 (annotated)

Committer:
Mike Fiore
Date:
Mon Mar 23 16:51:07 2015 -0500
Revision:
6:cf58d49e1a86
Parent:
0:b86d15c6ba29 
fix whitespace in sha512.c

Who changed what in which revision?

UserRevisionLine numberNew contents of line
Vanger 0:b86d15c6ba29 1 /* sha.c
Vanger 0:b86d15c6ba29 2 *
Vanger 0:b86d15c6ba29 3 * Copyright (C) 2006-2014 wolfSSL Inc.
Vanger 0:b86d15c6ba29 4 *
Vanger 0:b86d15c6ba29 5 * This file is part of CyaSSL.
Vanger 0:b86d15c6ba29 6 *
Vanger 0:b86d15c6ba29 7 * CyaSSL is free software; you can redistribute it and/or modify
Vanger 0:b86d15c6ba29 8 * it under the terms of the GNU General Public License as published by
Vanger 0:b86d15c6ba29 9 * the Free Software Foundation; either version 2 of the License, or
Vanger 0:b86d15c6ba29 10 * (at your option) any later version.
Vanger 0:b86d15c6ba29 11 *
Vanger 0:b86d15c6ba29 12 * CyaSSL is distributed in the hope that it will be useful,
Vanger 0:b86d15c6ba29 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Vanger 0:b86d15c6ba29 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Vanger 0:b86d15c6ba29 15 * GNU General Public License for more details.
Vanger 0:b86d15c6ba29 16 *
Vanger 0:b86d15c6ba29 17 * You should have received a copy of the GNU General Public License
Vanger 0:b86d15c6ba29 18 * along with this program; if not, write to the Free Software
Vanger 0:b86d15c6ba29 19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
Vanger 0:b86d15c6ba29 20 */
Vanger 0:b86d15c6ba29 21
Vanger 0:b86d15c6ba29 22
Vanger 0:b86d15c6ba29 23 #ifdef HAVE_CONFIG_H
Vanger 0:b86d15c6ba29 24 #include <config.h>
Vanger 0:b86d15c6ba29 25 #endif
Vanger 0:b86d15c6ba29 26
Vanger 0:b86d15c6ba29 27 #include <cyassl/ctaocrypt/settings.h>
Vanger 0:b86d15c6ba29 28
Vanger 0:b86d15c6ba29 29 #if !defined(NO_SHA)
Vanger 0:b86d15c6ba29 30
Vanger 0:b86d15c6ba29 31 #ifdef CYASSL_PIC32MZ_HASH
Vanger 0:b86d15c6ba29 32 #define InitSha InitSha_sw
Vanger 0:b86d15c6ba29 33 #define ShaUpdate ShaUpdate_sw
Vanger 0:b86d15c6ba29 34 #define ShaFinal ShaFinal_sw
Vanger 0:b86d15c6ba29 35 #endif
Vanger 0:b86d15c6ba29 36
Vanger 0:b86d15c6ba29 37 #ifdef HAVE_FIPS
Vanger 0:b86d15c6ba29 38 /* set NO_WRAPPERS before headers, use direct internal f()s not wrappers */
Vanger 0:b86d15c6ba29 39 #define FIPS_NO_WRAPPERS
Vanger 0:b86d15c6ba29 40 #endif
Vanger 0:b86d15c6ba29 41
Vanger 0:b86d15c6ba29 42 #include <cyassl/ctaocrypt/sha.h>
Vanger 0:b86d15c6ba29 43 #include <cyassl/ctaocrypt/logging.h>
Vanger 0:b86d15c6ba29 44 #include <cyassl/ctaocrypt/error-crypt.h>
Vanger 0:b86d15c6ba29 45
Vanger 0:b86d15c6ba29 46 #ifdef NO_INLINE
Vanger 0:b86d15c6ba29 47 #include <cyassl/ctaocrypt/misc.h>
Vanger 0:b86d15c6ba29 48 #else
Vanger 0:b86d15c6ba29 49 #include <ctaocrypt/src/misc.c>
Vanger 0:b86d15c6ba29 50 #endif
Vanger 0:b86d15c6ba29 51
Vanger 0:b86d15c6ba29 52 #ifdef FREESCALE_MMCAU
Vanger 0:b86d15c6ba29 53 #include "cau_api.h"
Vanger 0:b86d15c6ba29 54 #define XTRANSFORM(S,B) cau_sha1_hash_n((B), 1, ((S))->digest)
Vanger 0:b86d15c6ba29 55 #else
Vanger 0:b86d15c6ba29 56 #define XTRANSFORM(S,B) Transform((S))
Vanger 0:b86d15c6ba29 57 #endif
Vanger 0:b86d15c6ba29 58
Vanger 0:b86d15c6ba29 59
Vanger 0:b86d15c6ba29 60 #ifdef STM32F2_HASH
Vanger 0:b86d15c6ba29 61 /*
Vanger 0:b86d15c6ba29 62 * STM32F2 hardware SHA1 support through the STM32F2 standard peripheral
Vanger 0:b86d15c6ba29 63 * library. Documentation located in STM32F2xx Standard Peripheral Library
Vanger 0:b86d15c6ba29 64 * document (See note in README).
Vanger 0:b86d15c6ba29 65 */
Vanger 0:b86d15c6ba29 66 #include "stm32f2xx.h"
Vanger 0:b86d15c6ba29 67 #include "stm32f2xx_hash.h"
Vanger 0:b86d15c6ba29 68
Vanger 0:b86d15c6ba29 69 int InitSha(Sha* sha)
Vanger 0:b86d15c6ba29 70 {
Vanger 0:b86d15c6ba29 71 /* STM32F2 struct notes:
Vanger 0:b86d15c6ba29 72 * sha->buffer = first 4 bytes used to hold partial block if needed
Vanger 0:b86d15c6ba29 73 * sha->buffLen = num bytes currently stored in sha->buffer
Vanger 0:b86d15c6ba29 74 * sha->loLen = num bytes that have been written to STM32 FIFO
Vanger 0:b86d15c6ba29 75 */
Vanger 0:b86d15c6ba29 76 XMEMSET(sha->buffer, 0, SHA_REG_SIZE);
Vanger 0:b86d15c6ba29 77 sha->buffLen = 0;
Vanger 0:b86d15c6ba29 78 sha->loLen = 0;
Vanger 0:b86d15c6ba29 79
Vanger 0:b86d15c6ba29 80 /* initialize HASH peripheral */
Vanger 0:b86d15c6ba29 81 HASH_DeInit();
Vanger 0:b86d15c6ba29 82
Vanger 0:b86d15c6ba29 83 /* configure algo used, algo mode, datatype */
Vanger 0:b86d15c6ba29 84 HASH->CR &= ~ (HASH_CR_ALGO | HASH_CR_DATATYPE | HASH_CR_MODE);
Vanger 0:b86d15c6ba29 85 HASH->CR |= (HASH_AlgoSelection_SHA1 | HASH_AlgoMode_HASH
Vanger 0:b86d15c6ba29 86 | HASH_DataType_8b);
Vanger 0:b86d15c6ba29 87
Vanger 0:b86d15c6ba29 88 /* reset HASH processor */
Vanger 0:b86d15c6ba29 89 HASH->CR |= HASH_CR_INIT;
Vanger 0:b86d15c6ba29 90
Vanger 0:b86d15c6ba29 91 return 0;
Vanger 0:b86d15c6ba29 92 }
Vanger 0:b86d15c6ba29 93
Vanger 0:b86d15c6ba29 94 int ShaUpdate(Sha* sha, const byte* data, word32 len)
Vanger 0:b86d15c6ba29 95 {
Vanger 0:b86d15c6ba29 96 word32 i = 0;
Vanger 0:b86d15c6ba29 97 word32 fill = 0;
Vanger 0:b86d15c6ba29 98 word32 diff = 0;
Vanger 0:b86d15c6ba29 99
Vanger 0:b86d15c6ba29 100 /* if saved partial block is available */
Vanger 0:b86d15c6ba29 101 if (sha->buffLen) {
Vanger 0:b86d15c6ba29 102 fill = 4 - sha->buffLen;
Vanger 0:b86d15c6ba29 103
Vanger 0:b86d15c6ba29 104 /* if enough data to fill, fill and push to FIFO */
Vanger 0:b86d15c6ba29 105 if (fill <= len) {
Vanger 0:b86d15c6ba29 106 XMEMCPY((byte*)sha->buffer + sha->buffLen, data, fill);
Vanger 0:b86d15c6ba29 107 HASH_DataIn(*(uint32_t*)sha->buffer);
Vanger 0:b86d15c6ba29 108
Vanger 0:b86d15c6ba29 109 data += fill;
Vanger 0:b86d15c6ba29 110 len -= fill;
Vanger 0:b86d15c6ba29 111 sha->loLen += 4;
Vanger 0:b86d15c6ba29 112 sha->buffLen = 0;
Vanger 0:b86d15c6ba29 113 } else {
Vanger 0:b86d15c6ba29 114 /* append partial to existing stored block */
Vanger 0:b86d15c6ba29 115 XMEMCPY((byte*)sha->buffer + sha->buffLen, data, len);
Vanger 0:b86d15c6ba29 116 sha->buffLen += len;
Vanger 0:b86d15c6ba29 117 return;
Vanger 0:b86d15c6ba29 118 }
Vanger 0:b86d15c6ba29 119 }
Vanger 0:b86d15c6ba29 120
Vanger 0:b86d15c6ba29 121 /* write input block in the IN FIFO */
Vanger 0:b86d15c6ba29 122 for(i = 0; i < len; i += 4)
Vanger 0:b86d15c6ba29 123 {
Vanger 0:b86d15c6ba29 124 diff = len - i;
Vanger 0:b86d15c6ba29 125 if ( diff < 4) {
Vanger 0:b86d15c6ba29 126 /* store incomplete last block, not yet in FIFO */
Vanger 0:b86d15c6ba29 127 XMEMSET(sha->buffer, 0, SHA_REG_SIZE);
Vanger 0:b86d15c6ba29 128 XMEMCPY((byte*)sha->buffer, data, diff);
Vanger 0:b86d15c6ba29 129 sha->buffLen = diff;
Vanger 0:b86d15c6ba29 130 } else {
Vanger 0:b86d15c6ba29 131 HASH_DataIn(*(uint32_t*)data);
Vanger 0:b86d15c6ba29 132 data+=4;
Vanger 0:b86d15c6ba29 133 }
Vanger 0:b86d15c6ba29 134 }
Vanger 0:b86d15c6ba29 135
Vanger 0:b86d15c6ba29 136 /* keep track of total data length thus far */
Vanger 0:b86d15c6ba29 137 sha->loLen += (len - sha->buffLen);
Vanger 0:b86d15c6ba29 138
Vanger 0:b86d15c6ba29 139 return 0;
Vanger 0:b86d15c6ba29 140 }
Vanger 0:b86d15c6ba29 141
Vanger 0:b86d15c6ba29 142 int ShaFinal(Sha* sha, byte* hash)
Vanger 0:b86d15c6ba29 143 {
Vanger 0:b86d15c6ba29 144 __IO uint16_t nbvalidbitsdata = 0;
Vanger 0:b86d15c6ba29 145
Vanger 0:b86d15c6ba29 146 /* finish reading any trailing bytes into FIFO */
Vanger 0:b86d15c6ba29 147 if (sha->buffLen) {
Vanger 0:b86d15c6ba29 148 HASH_DataIn(*(uint32_t*)sha->buffer);
Vanger 0:b86d15c6ba29 149 sha->loLen += sha->buffLen;
Vanger 0:b86d15c6ba29 150 }
Vanger 0:b86d15c6ba29 151
Vanger 0:b86d15c6ba29 152 /* calculate number of valid bits in last word of input data */
Vanger 0:b86d15c6ba29 153 nbvalidbitsdata = 8 * (sha->loLen % SHA_REG_SIZE);
Vanger 0:b86d15c6ba29 154
Vanger 0:b86d15c6ba29 155 /* configure number of valid bits in last word of the data */
Vanger 0:b86d15c6ba29 156 HASH_SetLastWordValidBitsNbr(nbvalidbitsdata);
Vanger 0:b86d15c6ba29 157
Vanger 0:b86d15c6ba29 158 /* start HASH processor */
Vanger 0:b86d15c6ba29 159 HASH_StartDigest();
Vanger 0:b86d15c6ba29 160
Vanger 0:b86d15c6ba29 161 /* wait until Busy flag == RESET */
Vanger 0:b86d15c6ba29 162 while (HASH_GetFlagStatus(HASH_FLAG_BUSY) != RESET) {}
Vanger 0:b86d15c6ba29 163
Vanger 0:b86d15c6ba29 164 /* read message digest */
Vanger 0:b86d15c6ba29 165 sha->digest[0] = HASH->HR[0];
Vanger 0:b86d15c6ba29 166 sha->digest[1] = HASH->HR[1];
Vanger 0:b86d15c6ba29 167 sha->digest[2] = HASH->HR[2];
Vanger 0:b86d15c6ba29 168 sha->digest[3] = HASH->HR[3];
Vanger 0:b86d15c6ba29 169 sha->digest[4] = HASH->HR[4];
Vanger 0:b86d15c6ba29 170
Vanger 0:b86d15c6ba29 171 ByteReverseWords(sha->digest, sha->digest, SHA_DIGEST_SIZE);
Vanger 0:b86d15c6ba29 172
Vanger 0:b86d15c6ba29 173 XMEMCPY(hash, sha->digest, SHA_DIGEST_SIZE);
Vanger 0:b86d15c6ba29 174
Vanger 0:b86d15c6ba29 175 return InitSha(sha); /* reset state */
Vanger 0:b86d15c6ba29 176 }
Vanger 0:b86d15c6ba29 177
Vanger 0:b86d15c6ba29 178 #else /* CTaoCrypt software implementation */
Vanger 0:b86d15c6ba29 179
Vanger 0:b86d15c6ba29 180 #ifndef min
Vanger 0:b86d15c6ba29 181
Vanger 0:b86d15c6ba29 182 static INLINE word32 min(word32 a, word32 b)
Vanger 0:b86d15c6ba29 183 {
Vanger 0:b86d15c6ba29 184 return a > b ? b : a;
Vanger 0:b86d15c6ba29 185 }
Vanger 0:b86d15c6ba29 186
Vanger 0:b86d15c6ba29 187 #endif /* min */
Vanger 0:b86d15c6ba29 188
Vanger 0:b86d15c6ba29 189
Vanger 0:b86d15c6ba29 190 int InitSha(Sha* sha)
Vanger 0:b86d15c6ba29 191 {
Vanger 0:b86d15c6ba29 192 #ifdef FREESCALE_MMCAU
Vanger 0:b86d15c6ba29 193 cau_sha1_initialize_output(sha->digest);
Vanger 0:b86d15c6ba29 194 #else
Vanger 0:b86d15c6ba29 195 sha->digest[0] = 0x67452301L;
Vanger 0:b86d15c6ba29 196 sha->digest[1] = 0xEFCDAB89L;
Vanger 0:b86d15c6ba29 197 sha->digest[2] = 0x98BADCFEL;
Vanger 0:b86d15c6ba29 198 sha->digest[3] = 0x10325476L;
Vanger 0:b86d15c6ba29 199 sha->digest[4] = 0xC3D2E1F0L;
Vanger 0:b86d15c6ba29 200 #endif
Vanger 0:b86d15c6ba29 201
Vanger 0:b86d15c6ba29 202 sha->buffLen = 0;
Vanger 0:b86d15c6ba29 203 sha->loLen = 0;
Vanger 0:b86d15c6ba29 204 sha->hiLen = 0;
Vanger 0:b86d15c6ba29 205
Vanger 0:b86d15c6ba29 206 return 0;
Vanger 0:b86d15c6ba29 207 }
Vanger 0:b86d15c6ba29 208
Vanger 0:b86d15c6ba29 209 #ifndef FREESCALE_MMCAU
Vanger 0:b86d15c6ba29 210
Vanger 0:b86d15c6ba29 211 #define blk0(i) (W[i] = sha->buffer[i])
Vanger 0:b86d15c6ba29 212 #define blk1(i) (W[i&15] = \
Vanger 0:b86d15c6ba29 213 rotlFixed(W[(i+13)&15]^W[(i+8)&15]^W[(i+2)&15]^W[i&15],1))
Vanger 0:b86d15c6ba29 214
Vanger 0:b86d15c6ba29 215 #define f1(x,y,z) (z^(x &(y^z)))
Vanger 0:b86d15c6ba29 216 #define f2(x,y,z) (x^y^z)
Vanger 0:b86d15c6ba29 217 #define f3(x,y,z) ((x&y)|(z&(x|y)))
Vanger 0:b86d15c6ba29 218 #define f4(x,y,z) (x^y^z)
Vanger 0:b86d15c6ba29 219
Vanger 0:b86d15c6ba29 220 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
Vanger 0:b86d15c6ba29 221 #define R0(v,w,x,y,z,i) z+= f1(w,x,y) + blk0(i) + 0x5A827999+ \
Vanger 0:b86d15c6ba29 222 rotlFixed(v,5); w = rotlFixed(w,30);
Vanger 0:b86d15c6ba29 223 #define R1(v,w,x,y,z,i) z+= f1(w,x,y) + blk1(i) + 0x5A827999+ \
Vanger 0:b86d15c6ba29 224 rotlFixed(v,5); w = rotlFixed(w,30);
Vanger 0:b86d15c6ba29 225 #define R2(v,w,x,y,z,i) z+= f2(w,x,y) + blk1(i) + 0x6ED9EBA1+ \
Vanger 0:b86d15c6ba29 226 rotlFixed(v,5); w = rotlFixed(w,30);
Vanger 0:b86d15c6ba29 227 #define R3(v,w,x,y,z,i) z+= f3(w,x,y) + blk1(i) + 0x8F1BBCDC+ \
Vanger 0:b86d15c6ba29 228 rotlFixed(v,5); w = rotlFixed(w,30);
Vanger 0:b86d15c6ba29 229 #define R4(v,w,x,y,z,i) z+= f4(w,x,y) + blk1(i) + 0xCA62C1D6+ \
Vanger 0:b86d15c6ba29 230 rotlFixed(v,5); w = rotlFixed(w,30);
Vanger 0:b86d15c6ba29 231
Vanger 0:b86d15c6ba29 232
Vanger 0:b86d15c6ba29 233 static void Transform(Sha* sha)
Vanger 0:b86d15c6ba29 234 {
Vanger 0:b86d15c6ba29 235 word32 W[SHA_BLOCK_SIZE / sizeof(word32)];
Vanger 0:b86d15c6ba29 236
Vanger 0:b86d15c6ba29 237 /* Copy context->state[] to working vars */
Vanger 0:b86d15c6ba29 238 word32 a = sha->digest[0];
Vanger 0:b86d15c6ba29 239 word32 b = sha->digest[1];
Vanger 0:b86d15c6ba29 240 word32 c = sha->digest[2];
Vanger 0:b86d15c6ba29 241 word32 d = sha->digest[3];
Vanger 0:b86d15c6ba29 242 word32 e = sha->digest[4];
Vanger 0:b86d15c6ba29 243
Vanger 0:b86d15c6ba29 244 #ifdef USE_SLOW_SHA
Vanger 0:b86d15c6ba29 245 word32 t, i;
Vanger 0:b86d15c6ba29 246
Vanger 0:b86d15c6ba29 247 for (i = 0; i < 16; i++) {
Vanger 0:b86d15c6ba29 248 R0(a, b, c, d, e, i);
Vanger 0:b86d15c6ba29 249 t = e; e = d; d = c; c = b; b = a; a = t;
Vanger 0:b86d15c6ba29 250 }
Vanger 0:b86d15c6ba29 251
Vanger 0:b86d15c6ba29 252 for (; i < 20; i++) {
Vanger 0:b86d15c6ba29 253 R1(a, b, c, d, e, i);
Vanger 0:b86d15c6ba29 254 t = e; e = d; d = c; c = b; b = a; a = t;
Vanger 0:b86d15c6ba29 255 }
Vanger 0:b86d15c6ba29 256
Vanger 0:b86d15c6ba29 257 for (; i < 40; i++) {
Vanger 0:b86d15c6ba29 258 R2(a, b, c, d, e, i);
Vanger 0:b86d15c6ba29 259 t = e; e = d; d = c; c = b; b = a; a = t;
Vanger 0:b86d15c6ba29 260 }
Vanger 0:b86d15c6ba29 261
Vanger 0:b86d15c6ba29 262 for (; i < 60; i++) {
Vanger 0:b86d15c6ba29 263 R3(a, b, c, d, e, i);
Vanger 0:b86d15c6ba29 264 t = e; e = d; d = c; c = b; b = a; a = t;
Vanger 0:b86d15c6ba29 265 }
Vanger 0:b86d15c6ba29 266
Vanger 0:b86d15c6ba29 267 for (; i < 80; i++) {
Vanger 0:b86d15c6ba29 268 R4(a, b, c, d, e, i);
Vanger 0:b86d15c6ba29 269 t = e; e = d; d = c; c = b; b = a; a = t;
Vanger 0:b86d15c6ba29 270 }
Vanger 0:b86d15c6ba29 271 #else
Vanger 0:b86d15c6ba29 272 /* nearly 1 K bigger in code size but 25% faster */
Vanger 0:b86d15c6ba29 273 /* 4 rounds of 20 operations each. Loop unrolled. */
Vanger 0:b86d15c6ba29 274 R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
Vanger 0:b86d15c6ba29 275 R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
Vanger 0:b86d15c6ba29 276 R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
Vanger 0:b86d15c6ba29 277 R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
Vanger 0:b86d15c6ba29 278
Vanger 0:b86d15c6ba29 279 R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
Vanger 0:b86d15c6ba29 280
Vanger 0:b86d15c6ba29 281 R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
Vanger 0:b86d15c6ba29 282 R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
Vanger 0:b86d15c6ba29 283 R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
Vanger 0:b86d15c6ba29 284 R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
Vanger 0:b86d15c6ba29 285 R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
Vanger 0:b86d15c6ba29 286
Vanger 0:b86d15c6ba29 287 R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
Vanger 0:b86d15c6ba29 288 R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
Vanger 0:b86d15c6ba29 289 R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
Vanger 0:b86d15c6ba29 290 R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
Vanger 0:b86d15c6ba29 291 R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
Vanger 0:b86d15c6ba29 292
Vanger 0:b86d15c6ba29 293 R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
Vanger 0:b86d15c6ba29 294 R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
Vanger 0:b86d15c6ba29 295 R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
Vanger 0:b86d15c6ba29 296 R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
Vanger 0:b86d15c6ba29 297 R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
Vanger 0:b86d15c6ba29 298 #endif
Vanger 0:b86d15c6ba29 299
Vanger 0:b86d15c6ba29 300 /* Add the working vars back into digest state[] */
Vanger 0:b86d15c6ba29 301 sha->digest[0] += a;
Vanger 0:b86d15c6ba29 302 sha->digest[1] += b;
Vanger 0:b86d15c6ba29 303 sha->digest[2] += c;
Vanger 0:b86d15c6ba29 304 sha->digest[3] += d;
Vanger 0:b86d15c6ba29 305 sha->digest[4] += e;
Vanger 0:b86d15c6ba29 306 }
Vanger 0:b86d15c6ba29 307
Vanger 0:b86d15c6ba29 308 #endif /* FREESCALE_MMCAU */
Vanger 0:b86d15c6ba29 309
Vanger 0:b86d15c6ba29 310
Vanger 0:b86d15c6ba29 311 static INLINE void AddLength(Sha* sha, word32 len)
Vanger 0:b86d15c6ba29 312 {
Vanger 0:b86d15c6ba29 313 word32 tmp = sha->loLen;
Vanger 0:b86d15c6ba29 314 if ( (sha->loLen += len) < tmp)
Vanger 0:b86d15c6ba29 315 sha->hiLen++; /* carry low to high */
Vanger 0:b86d15c6ba29 316 }
Vanger 0:b86d15c6ba29 317
Vanger 0:b86d15c6ba29 318
Vanger 0:b86d15c6ba29 319 int ShaUpdate(Sha* sha, const byte* data, word32 len)
Vanger 0:b86d15c6ba29 320 {
Vanger 0:b86d15c6ba29 321 /* do block size increments */
Vanger 0:b86d15c6ba29 322 byte* local = (byte*)sha->buffer;
Vanger 0:b86d15c6ba29 323
Vanger 0:b86d15c6ba29 324 while (len) {
Vanger 0:b86d15c6ba29 325 word32 add = min(len, SHA_BLOCK_SIZE - sha->buffLen);
Vanger 0:b86d15c6ba29 326 XMEMCPY(&local[sha->buffLen], data, add);
Vanger 0:b86d15c6ba29 327
Vanger 0:b86d15c6ba29 328 sha->buffLen += add;
Vanger 0:b86d15c6ba29 329 data += add;
Vanger 0:b86d15c6ba29 330 len -= add;
Vanger 0:b86d15c6ba29 331
Vanger 0:b86d15c6ba29 332 if (sha->buffLen == SHA_BLOCK_SIZE) {
Vanger 0:b86d15c6ba29 333 #if defined(LITTLE_ENDIAN_ORDER) && !defined(FREESCALE_MMCAU)
Vanger 0:b86d15c6ba29 334 ByteReverseWords(sha->buffer, sha->buffer, SHA_BLOCK_SIZE);
Vanger 0:b86d15c6ba29 335 #endif
Vanger 0:b86d15c6ba29 336 XTRANSFORM(sha, local);
Vanger 0:b86d15c6ba29 337 AddLength(sha, SHA_BLOCK_SIZE);
Vanger 0:b86d15c6ba29 338 sha->buffLen = 0;
Vanger 0:b86d15c6ba29 339 }
Vanger 0:b86d15c6ba29 340 }
Vanger 0:b86d15c6ba29 341
Vanger 0:b86d15c6ba29 342 return 0;
Vanger 0:b86d15c6ba29 343 }
Vanger 0:b86d15c6ba29 344
Vanger 0:b86d15c6ba29 345
Vanger 0:b86d15c6ba29 346 int ShaFinal(Sha* sha, byte* hash)
Vanger 0:b86d15c6ba29 347 {
Vanger 0:b86d15c6ba29 348 byte* local = (byte*)sha->buffer;
Vanger 0:b86d15c6ba29 349
Vanger 0:b86d15c6ba29 350 AddLength(sha, sha->buffLen); /* before adding pads */
Vanger 0:b86d15c6ba29 351
Vanger 0:b86d15c6ba29 352 local[sha->buffLen++] = 0x80; /* add 1 */
Vanger 0:b86d15c6ba29 353
Vanger 0:b86d15c6ba29 354 /* pad with zeros */
Vanger 0:b86d15c6ba29 355 if (sha->buffLen > SHA_PAD_SIZE) {
Vanger 0:b86d15c6ba29 356 XMEMSET(&local[sha->buffLen], 0, SHA_BLOCK_SIZE - sha->buffLen);
Vanger 0:b86d15c6ba29 357 sha->buffLen += SHA_BLOCK_SIZE - sha->buffLen;
Vanger 0:b86d15c6ba29 358
Vanger 0:b86d15c6ba29 359 #if defined(LITTLE_ENDIAN_ORDER) && !defined(FREESCALE_MMCAU)
Vanger 0:b86d15c6ba29 360 ByteReverseWords(sha->buffer, sha->buffer, SHA_BLOCK_SIZE);
Vanger 0:b86d15c6ba29 361 #endif
Vanger 0:b86d15c6ba29 362 XTRANSFORM(sha, local);
Vanger 0:b86d15c6ba29 363 sha->buffLen = 0;
Vanger 0:b86d15c6ba29 364 }
Vanger 0:b86d15c6ba29 365 XMEMSET(&local[sha->buffLen], 0, SHA_PAD_SIZE - sha->buffLen);
Vanger 0:b86d15c6ba29 366
Vanger 0:b86d15c6ba29 367 /* put lengths in bits */
Vanger 0:b86d15c6ba29 368 sha->hiLen = (sha->loLen >> (8*sizeof(sha->loLen) - 3)) +
Vanger 0:b86d15c6ba29 369 (sha->hiLen << 3);
Vanger 0:b86d15c6ba29 370 sha->loLen = sha->loLen << 3;
Vanger 0:b86d15c6ba29 371
Vanger 0:b86d15c6ba29 372 /* store lengths */
Vanger 0:b86d15c6ba29 373 #if defined(LITTLE_ENDIAN_ORDER) && !defined(FREESCALE_MMCAU)
Vanger 0:b86d15c6ba29 374 ByteReverseWords(sha->buffer, sha->buffer, SHA_BLOCK_SIZE);
Vanger 0:b86d15c6ba29 375 #endif
Vanger 0:b86d15c6ba29 376 /* ! length ordering dependent on digest endian type ! */
Vanger 0:b86d15c6ba29 377 XMEMCPY(&local[SHA_PAD_SIZE], &sha->hiLen, sizeof(word32));
Vanger 0:b86d15c6ba29 378 XMEMCPY(&local[SHA_PAD_SIZE + sizeof(word32)], &sha->loLen, sizeof(word32));
Vanger 0:b86d15c6ba29 379
Vanger 0:b86d15c6ba29 380 #ifdef FREESCALE_MMCAU
Vanger 0:b86d15c6ba29 381 /* Kinetis requires only these bytes reversed */
Vanger 0:b86d15c6ba29 382 ByteReverseWords(&sha->buffer[SHA_PAD_SIZE/sizeof(word32)],
Vanger 0:b86d15c6ba29 383 &sha->buffer[SHA_PAD_SIZE/sizeof(word32)],
Vanger 0:b86d15c6ba29 384 2 * sizeof(word32));
Vanger 0:b86d15c6ba29 385 #endif
Vanger 0:b86d15c6ba29 386
Vanger 0:b86d15c6ba29 387 XTRANSFORM(sha, local);
Vanger 0:b86d15c6ba29 388 #ifdef LITTLE_ENDIAN_ORDER
Vanger 0:b86d15c6ba29 389 ByteReverseWords(sha->digest, sha->digest, SHA_DIGEST_SIZE);
Vanger 0:b86d15c6ba29 390 #endif
Vanger 0:b86d15c6ba29 391 XMEMCPY(hash, sha->digest, SHA_DIGEST_SIZE);
Vanger 0:b86d15c6ba29 392
Vanger 0:b86d15c6ba29 393 return InitSha(sha); /* reset state */
Vanger 0:b86d15c6ba29 394 }
Vanger 0:b86d15c6ba29 395
Vanger 0:b86d15c6ba29 396 #endif /* STM32F2_HASH */
Vanger 0:b86d15c6ba29 397
Vanger 0:b86d15c6ba29 398
Vanger 0:b86d15c6ba29 399 int ShaHash(const byte* data, word32 len, byte* hash)
Vanger 0:b86d15c6ba29 400 {
Vanger 0:b86d15c6ba29 401 int ret = 0;
Vanger 0:b86d15c6ba29 402 #ifdef CYASSL_SMALL_STACK
Vanger 0:b86d15c6ba29 403 Sha* sha;
Vanger 0:b86d15c6ba29 404 #else
Vanger 0:b86d15c6ba29 405 Sha sha[1];
Vanger 0:b86d15c6ba29 406 #endif
Vanger 0:b86d15c6ba29 407
Vanger 0:b86d15c6ba29 408 #ifdef CYASSL_SMALL_STACK
Vanger 0:b86d15c6ba29 409 sha = (Sha*)XMALLOC(sizeof(Sha), NULL, DYNAMIC_TYPE_TMP_BUFFER);
Vanger 0:b86d15c6ba29 410 if (sha == NULL)
Vanger 0:b86d15c6ba29 411 return MEMORY_E;
Vanger 0:b86d15c6ba29 412 #endif
Vanger 0:b86d15c6ba29 413
Vanger 0:b86d15c6ba29 414 if ((ret = InitSha(sha)) != 0) {
Vanger 0:b86d15c6ba29 415 CYASSL_MSG("InitSha failed");
Vanger 0:b86d15c6ba29 416 }
Vanger 0:b86d15c6ba29 417 else {
Vanger 0:b86d15c6ba29 418 ShaUpdate(sha, data, len);
Vanger 0:b86d15c6ba29 419 ShaFinal(sha, hash);
Vanger 0:b86d15c6ba29 420 }
Vanger 0:b86d15c6ba29 421
Vanger 0:b86d15c6ba29 422 #ifdef CYASSL_SMALL_STACK
Vanger 0:b86d15c6ba29 423 XFREE(sha, NULL, DYNAMIC_TYPE_TMP_BUFFER);
Vanger 0:b86d15c6ba29 424 #endif
Vanger 0:b86d15c6ba29 425
Vanger 0:b86d15c6ba29 426 return ret;
Vanger 0:b86d15c6ba29 427 }
Vanger 0:b86d15c6ba29 428
Vanger 0:b86d15c6ba29 429 #endif /* NO_SHA */