Darran Shepherd / Mbed 2 deprecated Bonjour

Dependencies:   mbed

Committer:
darran
Date:
Fri Jun 18 09:11:35 2010 +0000
Revision:
0:55a05330f8cc

        

Who changed what in which revision?

UserRevisionLine numberNew contents of line
darran 0:55a05330f8cc 1 /*
darran 0:55a05330f8cc 2 * FIPS-180-1 compliant SHA-1 implementation
darran 0:55a05330f8cc 3 *
darran 0:55a05330f8cc 4 * Copyright (C) 2006-2010, Paul Bakker <polarssl_maintainer at polarssl.org>
darran 0:55a05330f8cc 5 * All rights reserved.
darran 0:55a05330f8cc 6 *
darran 0:55a05330f8cc 7 * This program is free software; you can redistribute it and/or modify
darran 0:55a05330f8cc 8 * it under the terms of the GNU General Public License as published by
darran 0:55a05330f8cc 9 * the Free Software Foundation; either version 2 of the License, or
darran 0:55a05330f8cc 10 * (at your option) any later version.
darran 0:55a05330f8cc 11 *
darran 0:55a05330f8cc 12 * This program is distributed in the hope that it will be useful,
darran 0:55a05330f8cc 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
darran 0:55a05330f8cc 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
darran 0:55a05330f8cc 15 * GNU General Public License for more details.
darran 0:55a05330f8cc 16 *
darran 0:55a05330f8cc 17 * You should have received a copy of the GNU General Public License along
darran 0:55a05330f8cc 18 * with this program; if not, write to the Free Software Foundation, Inc.,
darran 0:55a05330f8cc 19 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
darran 0:55a05330f8cc 20 */
darran 0:55a05330f8cc 21 /*
darran 0:55a05330f8cc 22 * The SHA-1 standard was published by NIST in 1993.
darran 0:55a05330f8cc 23 *
darran 0:55a05330f8cc 24 * http://www.itl.nist.gov/fipspubs/fip180-1.htm
darran 0:55a05330f8cc 25 */
darran 0:55a05330f8cc 26
darran 0:55a05330f8cc 27 #include "sha1config.h"
darran 0:55a05330f8cc 28
darran 0:55a05330f8cc 29 #if defined(POLARSSL_SHA1_C)
darran 0:55a05330f8cc 30
darran 0:55a05330f8cc 31 #include "sha1.h"
darran 0:55a05330f8cc 32
darran 0:55a05330f8cc 33 #include <string.h>
darran 0:55a05330f8cc 34 #include <stdio.h>
darran 0:55a05330f8cc 35
darran 0:55a05330f8cc 36 /*
darran 0:55a05330f8cc 37 * 32-bit integer manipulation macros (big endian)
darran 0:55a05330f8cc 38 */
darran 0:55a05330f8cc 39 #ifndef GET_ULONG_BE
darran 0:55a05330f8cc 40 #define GET_ULONG_BE(n,b,i) \
darran 0:55a05330f8cc 41 { \
darran 0:55a05330f8cc 42 (n) = ( (unsigned long) (b)[(i) ] << 24 ) \
darran 0:55a05330f8cc 43 | ( (unsigned long) (b)[(i) + 1] << 16 ) \
darran 0:55a05330f8cc 44 | ( (unsigned long) (b)[(i) + 2] << 8 ) \
darran 0:55a05330f8cc 45 | ( (unsigned long) (b)[(i) + 3] ); \
darran 0:55a05330f8cc 46 }
darran 0:55a05330f8cc 47 #endif
darran 0:55a05330f8cc 48
darran 0:55a05330f8cc 49 #ifndef PUT_ULONG_BE
darran 0:55a05330f8cc 50 #define PUT_ULONG_BE(n,b,i) \
darran 0:55a05330f8cc 51 { \
darran 0:55a05330f8cc 52 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
darran 0:55a05330f8cc 53 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
darran 0:55a05330f8cc 54 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
darran 0:55a05330f8cc 55 (b)[(i) + 3] = (unsigned char) ( (n) ); \
darran 0:55a05330f8cc 56 }
darran 0:55a05330f8cc 57 #endif
darran 0:55a05330f8cc 58
darran 0:55a05330f8cc 59 /*
darran 0:55a05330f8cc 60 * SHA-1 context setup
darran 0:55a05330f8cc 61 */
darran 0:55a05330f8cc 62 void sha1_starts( sha1_context *ctx )
darran 0:55a05330f8cc 63 {
darran 0:55a05330f8cc 64 ctx->total[0] = 0;
darran 0:55a05330f8cc 65 ctx->total[1] = 0;
darran 0:55a05330f8cc 66
darran 0:55a05330f8cc 67 ctx->state[0] = 0x67452301;
darran 0:55a05330f8cc 68 ctx->state[1] = 0xEFCDAB89;
darran 0:55a05330f8cc 69 ctx->state[2] = 0x98BADCFE;
darran 0:55a05330f8cc 70 ctx->state[3] = 0x10325476;
darran 0:55a05330f8cc 71 ctx->state[4] = 0xC3D2E1F0;
darran 0:55a05330f8cc 72 }
darran 0:55a05330f8cc 73
darran 0:55a05330f8cc 74 static void sha1_process( sha1_context *ctx, const unsigned char data[64] )
darran 0:55a05330f8cc 75 {
darran 0:55a05330f8cc 76 unsigned long temp, W[16], A, B, C, D, E;
darran 0:55a05330f8cc 77
darran 0:55a05330f8cc 78 GET_ULONG_BE( W[ 0], data, 0 );
darran 0:55a05330f8cc 79 GET_ULONG_BE( W[ 1], data, 4 );
darran 0:55a05330f8cc 80 GET_ULONG_BE( W[ 2], data, 8 );
darran 0:55a05330f8cc 81 GET_ULONG_BE( W[ 3], data, 12 );
darran 0:55a05330f8cc 82 GET_ULONG_BE( W[ 4], data, 16 );
darran 0:55a05330f8cc 83 GET_ULONG_BE( W[ 5], data, 20 );
darran 0:55a05330f8cc 84 GET_ULONG_BE( W[ 6], data, 24 );
darran 0:55a05330f8cc 85 GET_ULONG_BE( W[ 7], data, 28 );
darran 0:55a05330f8cc 86 GET_ULONG_BE( W[ 8], data, 32 );
darran 0:55a05330f8cc 87 GET_ULONG_BE( W[ 9], data, 36 );
darran 0:55a05330f8cc 88 GET_ULONG_BE( W[10], data, 40 );
darran 0:55a05330f8cc 89 GET_ULONG_BE( W[11], data, 44 );
darran 0:55a05330f8cc 90 GET_ULONG_BE( W[12], data, 48 );
darran 0:55a05330f8cc 91 GET_ULONG_BE( W[13], data, 52 );
darran 0:55a05330f8cc 92 GET_ULONG_BE( W[14], data, 56 );
darran 0:55a05330f8cc 93 GET_ULONG_BE( W[15], data, 60 );
darran 0:55a05330f8cc 94
darran 0:55a05330f8cc 95 #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
darran 0:55a05330f8cc 96
darran 0:55a05330f8cc 97 #define R(t) \
darran 0:55a05330f8cc 98 ( \
darran 0:55a05330f8cc 99 temp = W[(t - 3) & 0x0F] ^ W[(t - 8) & 0x0F] ^ \
darran 0:55a05330f8cc 100 W[(t - 14) & 0x0F] ^ W[ t & 0x0F], \
darran 0:55a05330f8cc 101 ( W[t & 0x0F] = S(temp,1) ) \
darran 0:55a05330f8cc 102 )
darran 0:55a05330f8cc 103
darran 0:55a05330f8cc 104 #define P(a,b,c,d,e,x) \
darran 0:55a05330f8cc 105 { \
darran 0:55a05330f8cc 106 e += S(a,5) + F(b,c,d) + K + x; b = S(b,30); \
darran 0:55a05330f8cc 107 }
darran 0:55a05330f8cc 108
darran 0:55a05330f8cc 109 A = ctx->state[0];
darran 0:55a05330f8cc 110 B = ctx->state[1];
darran 0:55a05330f8cc 111 C = ctx->state[2];
darran 0:55a05330f8cc 112 D = ctx->state[3];
darran 0:55a05330f8cc 113 E = ctx->state[4];
darran 0:55a05330f8cc 114
darran 0:55a05330f8cc 115 #define F(x,y,z) (z ^ (x & (y ^ z)))
darran 0:55a05330f8cc 116 #define K 0x5A827999
darran 0:55a05330f8cc 117
darran 0:55a05330f8cc 118 P( A, B, C, D, E, W[0] );
darran 0:55a05330f8cc 119 P( E, A, B, C, D, W[1] );
darran 0:55a05330f8cc 120 P( D, E, A, B, C, W[2] );
darran 0:55a05330f8cc 121 P( C, D, E, A, B, W[3] );
darran 0:55a05330f8cc 122 P( B, C, D, E, A, W[4] );
darran 0:55a05330f8cc 123 P( A, B, C, D, E, W[5] );
darran 0:55a05330f8cc 124 P( E, A, B, C, D, W[6] );
darran 0:55a05330f8cc 125 P( D, E, A, B, C, W[7] );
darran 0:55a05330f8cc 126 P( C, D, E, A, B, W[8] );
darran 0:55a05330f8cc 127 P( B, C, D, E, A, W[9] );
darran 0:55a05330f8cc 128 P( A, B, C, D, E, W[10] );
darran 0:55a05330f8cc 129 P( E, A, B, C, D, W[11] );
darran 0:55a05330f8cc 130 P( D, E, A, B, C, W[12] );
darran 0:55a05330f8cc 131 P( C, D, E, A, B, W[13] );
darran 0:55a05330f8cc 132 P( B, C, D, E, A, W[14] );
darran 0:55a05330f8cc 133 P( A, B, C, D, E, W[15] );
darran 0:55a05330f8cc 134 P( E, A, B, C, D, R(16) );
darran 0:55a05330f8cc 135 P( D, E, A, B, C, R(17) );
darran 0:55a05330f8cc 136 P( C, D, E, A, B, R(18) );
darran 0:55a05330f8cc 137 P( B, C, D, E, A, R(19) );
darran 0:55a05330f8cc 138
darran 0:55a05330f8cc 139 #undef K
darran 0:55a05330f8cc 140 #undef F
darran 0:55a05330f8cc 141
darran 0:55a05330f8cc 142 #define F(x,y,z) (x ^ y ^ z)
darran 0:55a05330f8cc 143 #define K 0x6ED9EBA1
darran 0:55a05330f8cc 144
darran 0:55a05330f8cc 145 P( A, B, C, D, E, R(20) );
darran 0:55a05330f8cc 146 P( E, A, B, C, D, R(21) );
darran 0:55a05330f8cc 147 P( D, E, A, B, C, R(22) );
darran 0:55a05330f8cc 148 P( C, D, E, A, B, R(23) );
darran 0:55a05330f8cc 149 P( B, C, D, E, A, R(24) );
darran 0:55a05330f8cc 150 P( A, B, C, D, E, R(25) );
darran 0:55a05330f8cc 151 P( E, A, B, C, D, R(26) );
darran 0:55a05330f8cc 152 P( D, E, A, B, C, R(27) );
darran 0:55a05330f8cc 153 P( C, D, E, A, B, R(28) );
darran 0:55a05330f8cc 154 P( B, C, D, E, A, R(29) );
darran 0:55a05330f8cc 155 P( A, B, C, D, E, R(30) );
darran 0:55a05330f8cc 156 P( E, A, B, C, D, R(31) );
darran 0:55a05330f8cc 157 P( D, E, A, B, C, R(32) );
darran 0:55a05330f8cc 158 P( C, D, E, A, B, R(33) );
darran 0:55a05330f8cc 159 P( B, C, D, E, A, R(34) );
darran 0:55a05330f8cc 160 P( A, B, C, D, E, R(35) );
darran 0:55a05330f8cc 161 P( E, A, B, C, D, R(36) );
darran 0:55a05330f8cc 162 P( D, E, A, B, C, R(37) );
darran 0:55a05330f8cc 163 P( C, D, E, A, B, R(38) );
darran 0:55a05330f8cc 164 P( B, C, D, E, A, R(39) );
darran 0:55a05330f8cc 165
darran 0:55a05330f8cc 166 #undef K
darran 0:55a05330f8cc 167 #undef F
darran 0:55a05330f8cc 168
darran 0:55a05330f8cc 169 #define F(x,y,z) ((x & y) | (z & (x | y)))
darran 0:55a05330f8cc 170 #define K 0x8F1BBCDC
darran 0:55a05330f8cc 171
darran 0:55a05330f8cc 172 P( A, B, C, D, E, R(40) );
darran 0:55a05330f8cc 173 P( E, A, B, C, D, R(41) );
darran 0:55a05330f8cc 174 P( D, E, A, B, C, R(42) );
darran 0:55a05330f8cc 175 P( C, D, E, A, B, R(43) );
darran 0:55a05330f8cc 176 P( B, C, D, E, A, R(44) );
darran 0:55a05330f8cc 177 P( A, B, C, D, E, R(45) );
darran 0:55a05330f8cc 178 P( E, A, B, C, D, R(46) );
darran 0:55a05330f8cc 179 P( D, E, A, B, C, R(47) );
darran 0:55a05330f8cc 180 P( C, D, E, A, B, R(48) );
darran 0:55a05330f8cc 181 P( B, C, D, E, A, R(49) );
darran 0:55a05330f8cc 182 P( A, B, C, D, E, R(50) );
darran 0:55a05330f8cc 183 P( E, A, B, C, D, R(51) );
darran 0:55a05330f8cc 184 P( D, E, A, B, C, R(52) );
darran 0:55a05330f8cc 185 P( C, D, E, A, B, R(53) );
darran 0:55a05330f8cc 186 P( B, C, D, E, A, R(54) );
darran 0:55a05330f8cc 187 P( A, B, C, D, E, R(55) );
darran 0:55a05330f8cc 188 P( E, A, B, C, D, R(56) );
darran 0:55a05330f8cc 189 P( D, E, A, B, C, R(57) );
darran 0:55a05330f8cc 190 P( C, D, E, A, B, R(58) );
darran 0:55a05330f8cc 191 P( B, C, D, E, A, R(59) );
darran 0:55a05330f8cc 192
darran 0:55a05330f8cc 193 #undef K
darran 0:55a05330f8cc 194 #undef F
darran 0:55a05330f8cc 195
darran 0:55a05330f8cc 196 #define F(x,y,z) (x ^ y ^ z)
darran 0:55a05330f8cc 197 #define K 0xCA62C1D6
darran 0:55a05330f8cc 198
darran 0:55a05330f8cc 199 P( A, B, C, D, E, R(60) );
darran 0:55a05330f8cc 200 P( E, A, B, C, D, R(61) );
darran 0:55a05330f8cc 201 P( D, E, A, B, C, R(62) );
darran 0:55a05330f8cc 202 P( C, D, E, A, B, R(63) );
darran 0:55a05330f8cc 203 P( B, C, D, E, A, R(64) );
darran 0:55a05330f8cc 204 P( A, B, C, D, E, R(65) );
darran 0:55a05330f8cc 205 P( E, A, B, C, D, R(66) );
darran 0:55a05330f8cc 206 P( D, E, A, B, C, R(67) );
darran 0:55a05330f8cc 207 P( C, D, E, A, B, R(68) );
darran 0:55a05330f8cc 208 P( B, C, D, E, A, R(69) );
darran 0:55a05330f8cc 209 P( A, B, C, D, E, R(70) );
darran 0:55a05330f8cc 210 P( E, A, B, C, D, R(71) );
darran 0:55a05330f8cc 211 P( D, E, A, B, C, R(72) );
darran 0:55a05330f8cc 212 P( C, D, E, A, B, R(73) );
darran 0:55a05330f8cc 213 P( B, C, D, E, A, R(74) );
darran 0:55a05330f8cc 214 P( A, B, C, D, E, R(75) );
darran 0:55a05330f8cc 215 P( E, A, B, C, D, R(76) );
darran 0:55a05330f8cc 216 P( D, E, A, B, C, R(77) );
darran 0:55a05330f8cc 217 P( C, D, E, A, B, R(78) );
darran 0:55a05330f8cc 218 P( B, C, D, E, A, R(79) );
darran 0:55a05330f8cc 219
darran 0:55a05330f8cc 220 #undef K
darran 0:55a05330f8cc 221 #undef F
darran 0:55a05330f8cc 222
darran 0:55a05330f8cc 223 ctx->state[0] += A;
darran 0:55a05330f8cc 224 ctx->state[1] += B;
darran 0:55a05330f8cc 225 ctx->state[2] += C;
darran 0:55a05330f8cc 226 ctx->state[3] += D;
darran 0:55a05330f8cc 227 ctx->state[4] += E;
darran 0:55a05330f8cc 228 }
darran 0:55a05330f8cc 229
darran 0:55a05330f8cc 230 /*
darran 0:55a05330f8cc 231 * SHA-1 process buffer
darran 0:55a05330f8cc 232 */
darran 0:55a05330f8cc 233 void sha1_update( sha1_context *ctx, const unsigned char *input, int ilen )
darran 0:55a05330f8cc 234 {
darran 0:55a05330f8cc 235 int fill;
darran 0:55a05330f8cc 236 unsigned long left;
darran 0:55a05330f8cc 237
darran 0:55a05330f8cc 238 if( ilen <= 0 )
darran 0:55a05330f8cc 239 return;
darran 0:55a05330f8cc 240
darran 0:55a05330f8cc 241 left = ctx->total[0] & 0x3F;
darran 0:55a05330f8cc 242 fill = 64 - left;
darran 0:55a05330f8cc 243
darran 0:55a05330f8cc 244 ctx->total[0] += ilen;
darran 0:55a05330f8cc 245 ctx->total[0] &= 0xFFFFFFFF;
darran 0:55a05330f8cc 246
darran 0:55a05330f8cc 247 if( ctx->total[0] < (unsigned long) ilen )
darran 0:55a05330f8cc 248 ctx->total[1]++;
darran 0:55a05330f8cc 249
darran 0:55a05330f8cc 250 if( left && ilen >= fill )
darran 0:55a05330f8cc 251 {
darran 0:55a05330f8cc 252 memcpy( (void *) (ctx->buffer + left),
darran 0:55a05330f8cc 253 (void *) input, fill );
darran 0:55a05330f8cc 254 sha1_process( ctx, ctx->buffer );
darran 0:55a05330f8cc 255 input += fill;
darran 0:55a05330f8cc 256 ilen -= fill;
darran 0:55a05330f8cc 257 left = 0;
darran 0:55a05330f8cc 258 }
darran 0:55a05330f8cc 259
darran 0:55a05330f8cc 260 while( ilen >= 64 )
darran 0:55a05330f8cc 261 {
darran 0:55a05330f8cc 262 sha1_process( ctx, input );
darran 0:55a05330f8cc 263 input += 64;
darran 0:55a05330f8cc 264 ilen -= 64;
darran 0:55a05330f8cc 265 }
darran 0:55a05330f8cc 266
darran 0:55a05330f8cc 267 if( ilen > 0 )
darran 0:55a05330f8cc 268 {
darran 0:55a05330f8cc 269 memcpy( (void *) (ctx->buffer + left),
darran 0:55a05330f8cc 270 (void *) input, ilen );
darran 0:55a05330f8cc 271 }
darran 0:55a05330f8cc 272 }
darran 0:55a05330f8cc 273
darran 0:55a05330f8cc 274 static const unsigned char sha1_padding[64] =
darran 0:55a05330f8cc 275 {
darran 0:55a05330f8cc 276 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
darran 0:55a05330f8cc 277 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
darran 0:55a05330f8cc 278 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
darran 0:55a05330f8cc 279 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
darran 0:55a05330f8cc 280 };
darran 0:55a05330f8cc 281
darran 0:55a05330f8cc 282 /*
darran 0:55a05330f8cc 283 * SHA-1 final digest
darran 0:55a05330f8cc 284 */
darran 0:55a05330f8cc 285 void sha1_finish( sha1_context *ctx, unsigned char output[20] )
darran 0:55a05330f8cc 286 {
darran 0:55a05330f8cc 287 unsigned long last, padn;
darran 0:55a05330f8cc 288 unsigned long high, low;
darran 0:55a05330f8cc 289 unsigned char msglen[8];
darran 0:55a05330f8cc 290
darran 0:55a05330f8cc 291 high = ( ctx->total[0] >> 29 )
darran 0:55a05330f8cc 292 | ( ctx->total[1] << 3 );
darran 0:55a05330f8cc 293 low = ( ctx->total[0] << 3 );
darran 0:55a05330f8cc 294
darran 0:55a05330f8cc 295 PUT_ULONG_BE( high, msglen, 0 );
darran 0:55a05330f8cc 296 PUT_ULONG_BE( low, msglen, 4 );
darran 0:55a05330f8cc 297
darran 0:55a05330f8cc 298 last = ctx->total[0] & 0x3F;
darran 0:55a05330f8cc 299 padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
darran 0:55a05330f8cc 300
darran 0:55a05330f8cc 301 sha1_update( ctx, (unsigned char *) sha1_padding, padn );
darran 0:55a05330f8cc 302 sha1_update( ctx, msglen, 8 );
darran 0:55a05330f8cc 303
darran 0:55a05330f8cc 304 PUT_ULONG_BE( ctx->state[0], output, 0 );
darran 0:55a05330f8cc 305 PUT_ULONG_BE( ctx->state[1], output, 4 );
darran 0:55a05330f8cc 306 PUT_ULONG_BE( ctx->state[2], output, 8 );
darran 0:55a05330f8cc 307 PUT_ULONG_BE( ctx->state[3], output, 12 );
darran 0:55a05330f8cc 308 PUT_ULONG_BE( ctx->state[4], output, 16 );
darran 0:55a05330f8cc 309 }
darran 0:55a05330f8cc 310
darran 0:55a05330f8cc 311 /*
darran 0:55a05330f8cc 312 * output = SHA-1( input buffer )
darran 0:55a05330f8cc 313 */
darran 0:55a05330f8cc 314 void sha1( const unsigned char *input, int ilen, unsigned char output[20] )
darran 0:55a05330f8cc 315 {
darran 0:55a05330f8cc 316 sha1_context ctx;
darran 0:55a05330f8cc 317
darran 0:55a05330f8cc 318 sha1_starts( &ctx );
darran 0:55a05330f8cc 319 sha1_update( &ctx, input, ilen );
darran 0:55a05330f8cc 320 sha1_finish( &ctx, output );
darran 0:55a05330f8cc 321
darran 0:55a05330f8cc 322 memset( &ctx, 0, sizeof( sha1_context ) );
darran 0:55a05330f8cc 323 }
darran 0:55a05330f8cc 324
darran 0:55a05330f8cc 325 /*
darran 0:55a05330f8cc 326 * output = SHA-1( file contents )
darran 0:55a05330f8cc 327 */
darran 0:55a05330f8cc 328 #if 0 //No need for that
darran 0:55a05330f8cc 329 int sha1_file( const char *path, unsigned char output[20] )
darran 0:55a05330f8cc 330 {
darran 0:55a05330f8cc 331 FILE *f;
darran 0:55a05330f8cc 332 size_t n;
darran 0:55a05330f8cc 333 sha1_context ctx;
darran 0:55a05330f8cc 334 unsigned char buf[1024];
darran 0:55a05330f8cc 335
darran 0:55a05330f8cc 336 if( ( f = fopen( path, "rb" ) ) == NULL )
darran 0:55a05330f8cc 337 return( 1 );
darran 0:55a05330f8cc 338
darran 0:55a05330f8cc 339 sha1_starts( &ctx );
darran 0:55a05330f8cc 340
darran 0:55a05330f8cc 341 while( ( n = fread( buf, 1, sizeof( buf ), f ) ) > 0 )
darran 0:55a05330f8cc 342 sha1_update( &ctx, buf, (int) n );
darran 0:55a05330f8cc 343
darran 0:55a05330f8cc 344 sha1_finish( &ctx, output );
darran 0:55a05330f8cc 345
darran 0:55a05330f8cc 346 memset( &ctx, 0, sizeof( sha1_context ) );
darran 0:55a05330f8cc 347
darran 0:55a05330f8cc 348 if( ferror( f ) != 0 )
darran 0:55a05330f8cc 349 {
darran 0:55a05330f8cc 350 fclose( f );
darran 0:55a05330f8cc 351 return( 2 );
darran 0:55a05330f8cc 352 }
darran 0:55a05330f8cc 353
darran 0:55a05330f8cc 354 fclose( f );
darran 0:55a05330f8cc 355 return( 0 );
darran 0:55a05330f8cc 356 }
darran 0:55a05330f8cc 357 #endif
darran 0:55a05330f8cc 358
darran 0:55a05330f8cc 359 /*
darran 0:55a05330f8cc 360 * SHA-1 HMAC context setup
darran 0:55a05330f8cc 361 */
darran 0:55a05330f8cc 362 void sha1_hmac_starts( sha1_context *ctx, const unsigned char *key, int keylen )
darran 0:55a05330f8cc 363 {
darran 0:55a05330f8cc 364 int i;
darran 0:55a05330f8cc 365 unsigned char sum[20];
darran 0:55a05330f8cc 366
darran 0:55a05330f8cc 367 if( keylen > 64 )
darran 0:55a05330f8cc 368 {
darran 0:55a05330f8cc 369 sha1( key, keylen, sum );
darran 0:55a05330f8cc 370 keylen = 20;
darran 0:55a05330f8cc 371 key = sum;
darran 0:55a05330f8cc 372 }
darran 0:55a05330f8cc 373
darran 0:55a05330f8cc 374 memset( ctx->ipad, 0x36, 64 );
darran 0:55a05330f8cc 375 memset( ctx->opad, 0x5C, 64 );
darran 0:55a05330f8cc 376
darran 0:55a05330f8cc 377 for( i = 0; i < keylen; i++ )
darran 0:55a05330f8cc 378 {
darran 0:55a05330f8cc 379 ctx->ipad[i] = (unsigned char)( ctx->ipad[i] ^ key[i] );
darran 0:55a05330f8cc 380 ctx->opad[i] = (unsigned char)( ctx->opad[i] ^ key[i] );
darran 0:55a05330f8cc 381 }
darran 0:55a05330f8cc 382
darran 0:55a05330f8cc 383 sha1_starts( ctx );
darran 0:55a05330f8cc 384 sha1_update( ctx, ctx->ipad, 64 );
darran 0:55a05330f8cc 385
darran 0:55a05330f8cc 386 memset( sum, 0, sizeof( sum ) );
darran 0:55a05330f8cc 387 }
darran 0:55a05330f8cc 388
darran 0:55a05330f8cc 389 /*
darran 0:55a05330f8cc 390 * SHA-1 HMAC process buffer
darran 0:55a05330f8cc 391 */
darran 0:55a05330f8cc 392 void sha1_hmac_update( sha1_context *ctx, const unsigned char *input, int ilen )
darran 0:55a05330f8cc 393 {
darran 0:55a05330f8cc 394 sha1_update( ctx, input, ilen );
darran 0:55a05330f8cc 395 }
darran 0:55a05330f8cc 396
darran 0:55a05330f8cc 397 /*
darran 0:55a05330f8cc 398 * SHA-1 HMAC final digest
darran 0:55a05330f8cc 399 */
darran 0:55a05330f8cc 400 void sha1_hmac_finish( sha1_context *ctx, unsigned char output[20] )
darran 0:55a05330f8cc 401 {
darran 0:55a05330f8cc 402 unsigned char tmpbuf[20];
darran 0:55a05330f8cc 403
darran 0:55a05330f8cc 404 sha1_finish( ctx, tmpbuf );
darran 0:55a05330f8cc 405 sha1_starts( ctx );
darran 0:55a05330f8cc 406 sha1_update( ctx, ctx->opad, 64 );
darran 0:55a05330f8cc 407 sha1_update( ctx, tmpbuf, 20 );
darran 0:55a05330f8cc 408 sha1_finish( ctx, output );
darran 0:55a05330f8cc 409
darran 0:55a05330f8cc 410 memset( tmpbuf, 0, sizeof( tmpbuf ) );
darran 0:55a05330f8cc 411 }
darran 0:55a05330f8cc 412
darran 0:55a05330f8cc 413 /*
darran 0:55a05330f8cc 414 * SHA1 HMAC context reset
darran 0:55a05330f8cc 415 */
darran 0:55a05330f8cc 416 void sha1_hmac_reset( sha1_context *ctx )
darran 0:55a05330f8cc 417 {
darran 0:55a05330f8cc 418 sha1_starts( ctx );
darran 0:55a05330f8cc 419 sha1_update( ctx, ctx->ipad, 64 );
darran 0:55a05330f8cc 420 }
darran 0:55a05330f8cc 421
darran 0:55a05330f8cc 422 /*
darran 0:55a05330f8cc 423 * output = HMAC-SHA-1( hmac key, input buffer )
darran 0:55a05330f8cc 424 */
darran 0:55a05330f8cc 425 void sha1_hmac( const unsigned char *key, int keylen,
darran 0:55a05330f8cc 426 const unsigned char *input, int ilen,
darran 0:55a05330f8cc 427 unsigned char output[20] )
darran 0:55a05330f8cc 428 {
darran 0:55a05330f8cc 429 sha1_context ctx;
darran 0:55a05330f8cc 430
darran 0:55a05330f8cc 431 sha1_hmac_starts( &ctx, key, keylen );
darran 0:55a05330f8cc 432 sha1_hmac_update( &ctx, input, ilen );
darran 0:55a05330f8cc 433 sha1_hmac_finish( &ctx, output );
darran 0:55a05330f8cc 434
darran 0:55a05330f8cc 435 memset( &ctx, 0, sizeof( sha1_context ) );
darran 0:55a05330f8cc 436 }
darran 0:55a05330f8cc 437
darran 0:55a05330f8cc 438 #if defined(POLARSSL_SELF_TEST)
darran 0:55a05330f8cc 439 /*
darran 0:55a05330f8cc 440 * FIPS-180-1 test vectors
darran 0:55a05330f8cc 441 */
darran 0:55a05330f8cc 442 static unsigned char sha1_test_buf[3][57] =
darran 0:55a05330f8cc 443 {
darran 0:55a05330f8cc 444 { "abc" },
darran 0:55a05330f8cc 445 { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },
darran 0:55a05330f8cc 446 { "" }
darran 0:55a05330f8cc 447 };
darran 0:55a05330f8cc 448
darran 0:55a05330f8cc 449 static const int sha1_test_buflen[3] =
darran 0:55a05330f8cc 450 {
darran 0:55a05330f8cc 451 3, 56, 1000
darran 0:55a05330f8cc 452 };
darran 0:55a05330f8cc 453
darran 0:55a05330f8cc 454 static const unsigned char sha1_test_sum[3][20] =
darran 0:55a05330f8cc 455 {
darran 0:55a05330f8cc 456 { 0xA9, 0x99, 0x3E, 0x36, 0x47, 0x06, 0x81, 0x6A, 0xBA, 0x3E,
darran 0:55a05330f8cc 457 0x25, 0x71, 0x78, 0x50, 0xC2, 0x6C, 0x9C, 0xD0, 0xD8, 0x9D },
darran 0:55a05330f8cc 458 { 0x84, 0x98, 0x3E, 0x44, 0x1C, 0x3B, 0xD2, 0x6E, 0xBA, 0xAE,
darran 0:55a05330f8cc 459 0x4A, 0xA1, 0xF9, 0x51, 0x29, 0xE5, 0xE5, 0x46, 0x70, 0xF1 },
darran 0:55a05330f8cc 460 { 0x34, 0xAA, 0x97, 0x3C, 0xD4, 0xC4, 0xDA, 0xA4, 0xF6, 0x1E,
darran 0:55a05330f8cc 461 0xEB, 0x2B, 0xDB, 0xAD, 0x27, 0x31, 0x65, 0x34, 0x01, 0x6F }
darran 0:55a05330f8cc 462 };
darran 0:55a05330f8cc 463
darran 0:55a05330f8cc 464 /*
darran 0:55a05330f8cc 465 * RFC 2202 test vectors
darran 0:55a05330f8cc 466 */
darran 0:55a05330f8cc 467 static unsigned char sha1_hmac_test_key[7][26] =
darran 0:55a05330f8cc 468 {
darran 0:55a05330f8cc 469 { "\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B"
darran 0:55a05330f8cc 470 "\x0B\x0B\x0B\x0B" },
darran 0:55a05330f8cc 471 { "Jefe" },
darran 0:55a05330f8cc 472 { "\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA"
darran 0:55a05330f8cc 473 "\xAA\xAA\xAA\xAA" },
darran 0:55a05330f8cc 474 { "\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0A\x0B\x0C\x0D\x0E\x0F\x10"
darran 0:55a05330f8cc 475 "\x11\x12\x13\x14\x15\x16\x17\x18\x19" },
darran 0:55a05330f8cc 476 { "\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C"
darran 0:55a05330f8cc 477 "\x0C\x0C\x0C\x0C" },
darran 0:55a05330f8cc 478 { "" }, /* 0xAA 80 times */
darran 0:55a05330f8cc 479 { "" }
darran 0:55a05330f8cc 480 };
darran 0:55a05330f8cc 481
darran 0:55a05330f8cc 482 static const int sha1_hmac_test_keylen[7] =
darran 0:55a05330f8cc 483 {
darran 0:55a05330f8cc 484 20, 4, 20, 25, 20, 80, 80
darran 0:55a05330f8cc 485 };
darran 0:55a05330f8cc 486
darran 0:55a05330f8cc 487 static unsigned char sha1_hmac_test_buf[7][74] =
darran 0:55a05330f8cc 488 {
darran 0:55a05330f8cc 489 { "Hi There" },
darran 0:55a05330f8cc 490 { "what do ya want for nothing?" },
darran 0:55a05330f8cc 491 { "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
darran 0:55a05330f8cc 492 "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
darran 0:55a05330f8cc 493 "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
darran 0:55a05330f8cc 494 "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
darran 0:55a05330f8cc 495 "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD" },
darran 0:55a05330f8cc 496 { "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
darran 0:55a05330f8cc 497 "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
darran 0:55a05330f8cc 498 "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
darran 0:55a05330f8cc 499 "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
darran 0:55a05330f8cc 500 "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD" },
darran 0:55a05330f8cc 501 { "Test With Truncation" },
darran 0:55a05330f8cc 502 { "Test Using Larger Than Block-Size Key - Hash Key First" },
darran 0:55a05330f8cc 503 { "Test Using Larger Than Block-Size Key and Larger"
darran 0:55a05330f8cc 504 " Than One Block-Size Data" }
darran 0:55a05330f8cc 505 };
darran 0:55a05330f8cc 506
darran 0:55a05330f8cc 507 static const int sha1_hmac_test_buflen[7] =
darran 0:55a05330f8cc 508 {
darran 0:55a05330f8cc 509 8, 28, 50, 50, 20, 54, 73
darran 0:55a05330f8cc 510 };
darran 0:55a05330f8cc 511
darran 0:55a05330f8cc 512 static const unsigned char sha1_hmac_test_sum[7][20] =
darran 0:55a05330f8cc 513 {
darran 0:55a05330f8cc 514 { 0xB6, 0x17, 0x31, 0x86, 0x55, 0x05, 0x72, 0x64, 0xE2, 0x8B,
darran 0:55a05330f8cc 515 0xC0, 0xB6, 0xFB, 0x37, 0x8C, 0x8E, 0xF1, 0x46, 0xBE, 0x00 },
darran 0:55a05330f8cc 516 { 0xEF, 0xFC, 0xDF, 0x6A, 0xE5, 0xEB, 0x2F, 0xA2, 0xD2, 0x74,
darran 0:55a05330f8cc 517 0x16, 0xD5, 0xF1, 0x84, 0xDF, 0x9C, 0x25, 0x9A, 0x7C, 0x79 },
darran 0:55a05330f8cc 518 { 0x12, 0x5D, 0x73, 0x42, 0xB9, 0xAC, 0x11, 0xCD, 0x91, 0xA3,
darran 0:55a05330f8cc 519 0x9A, 0xF4, 0x8A, 0xA1, 0x7B, 0x4F, 0x63, 0xF1, 0x75, 0xD3 },
darran 0:55a05330f8cc 520 { 0x4C, 0x90, 0x07, 0xF4, 0x02, 0x62, 0x50, 0xC6, 0xBC, 0x84,
darran 0:55a05330f8cc 521 0x14, 0xF9, 0xBF, 0x50, 0xC8, 0x6C, 0x2D, 0x72, 0x35, 0xDA },
darran 0:55a05330f8cc 522 { 0x4C, 0x1A, 0x03, 0x42, 0x4B, 0x55, 0xE0, 0x7F, 0xE7, 0xF2,
darran 0:55a05330f8cc 523 0x7B, 0xE1 },
darran 0:55a05330f8cc 524 { 0xAA, 0x4A, 0xE5, 0xE1, 0x52, 0x72, 0xD0, 0x0E, 0x95, 0x70,
darran 0:55a05330f8cc 525 0x56, 0x37, 0xCE, 0x8A, 0x3B, 0x55, 0xED, 0x40, 0x21, 0x12 },
darran 0:55a05330f8cc 526 { 0xE8, 0xE9, 0x9D, 0x0F, 0x45, 0x23, 0x7D, 0x78, 0x6D, 0x6B,
darran 0:55a05330f8cc 527 0xBA, 0xA7, 0x96, 0x5C, 0x78, 0x08, 0xBB, 0xFF, 0x1A, 0x91 }
darran 0:55a05330f8cc 528 };
darran 0:55a05330f8cc 529
darran 0:55a05330f8cc 530 /*
darran 0:55a05330f8cc 531 * Checkup routine
darran 0:55a05330f8cc 532 */
darran 0:55a05330f8cc 533 int sha1_self_test( int verbose )
darran 0:55a05330f8cc 534 {
darran 0:55a05330f8cc 535 int i, j, buflen;
darran 0:55a05330f8cc 536 unsigned char buf[1024];
darran 0:55a05330f8cc 537 unsigned char sha1sum[20];
darran 0:55a05330f8cc 538 sha1_context ctx;
darran 0:55a05330f8cc 539
darran 0:55a05330f8cc 540 /*
darran 0:55a05330f8cc 541 * SHA-1
darran 0:55a05330f8cc 542 */
darran 0:55a05330f8cc 543 for( i = 0; i < 3; i++ )
darran 0:55a05330f8cc 544 {
darran 0:55a05330f8cc 545 if( verbose != 0 )
darran 0:55a05330f8cc 546 printf( " SHA-1 test #%d: ", i + 1 );
darran 0:55a05330f8cc 547
darran 0:55a05330f8cc 548 sha1_starts( &ctx );
darran 0:55a05330f8cc 549
darran 0:55a05330f8cc 550 if( i == 2 )
darran 0:55a05330f8cc 551 {
darran 0:55a05330f8cc 552 memset( buf, 'a', buflen = 1000 );
darran 0:55a05330f8cc 553
darran 0:55a05330f8cc 554 for( j = 0; j < 1000; j++ )
darran 0:55a05330f8cc 555 sha1_update( &ctx, buf, buflen );
darran 0:55a05330f8cc 556 }
darran 0:55a05330f8cc 557 else
darran 0:55a05330f8cc 558 sha1_update( &ctx, sha1_test_buf[i],
darran 0:55a05330f8cc 559 sha1_test_buflen[i] );
darran 0:55a05330f8cc 560
darran 0:55a05330f8cc 561 sha1_finish( &ctx, sha1sum );
darran 0:55a05330f8cc 562
darran 0:55a05330f8cc 563 if( memcmp( sha1sum, sha1_test_sum[i], 20 ) != 0 )
darran 0:55a05330f8cc 564 {
darran 0:55a05330f8cc 565 if( verbose != 0 )
darran 0:55a05330f8cc 566 printf( "failed\n" );
darran 0:55a05330f8cc 567
darran 0:55a05330f8cc 568 return( 1 );
darran 0:55a05330f8cc 569 }
darran 0:55a05330f8cc 570
darran 0:55a05330f8cc 571 if( verbose != 0 )
darran 0:55a05330f8cc 572 printf( "passed\n" );
darran 0:55a05330f8cc 573 }
darran 0:55a05330f8cc 574
darran 0:55a05330f8cc 575 if( verbose != 0 )
darran 0:55a05330f8cc 576 printf( "\n" );
darran 0:55a05330f8cc 577
darran 0:55a05330f8cc 578 for( i = 0; i < 7; i++ )
darran 0:55a05330f8cc 579 {
darran 0:55a05330f8cc 580 if( verbose != 0 )
darran 0:55a05330f8cc 581 printf( " HMAC-SHA-1 test #%d: ", i + 1 );
darran 0:55a05330f8cc 582
darran 0:55a05330f8cc 583 if( i == 5 || i == 6 )
darran 0:55a05330f8cc 584 {
darran 0:55a05330f8cc 585 memset( buf, '\xAA', buflen = 80 );
darran 0:55a05330f8cc 586 sha1_hmac_starts( &ctx, buf, buflen );
darran 0:55a05330f8cc 587 }
darran 0:55a05330f8cc 588 else
darran 0:55a05330f8cc 589 sha1_hmac_starts( &ctx, sha1_hmac_test_key[i],
darran 0:55a05330f8cc 590 sha1_hmac_test_keylen[i] );
darran 0:55a05330f8cc 591
darran 0:55a05330f8cc 592 sha1_hmac_update( &ctx, sha1_hmac_test_buf[i],
darran 0:55a05330f8cc 593 sha1_hmac_test_buflen[i] );
darran 0:55a05330f8cc 594
darran 0:55a05330f8cc 595 sha1_hmac_finish( &ctx, sha1sum );
darran 0:55a05330f8cc 596
darran 0:55a05330f8cc 597 buflen = ( i == 4 ) ? 12 : 20;
darran 0:55a05330f8cc 598
darran 0:55a05330f8cc 599 if( memcmp( sha1sum, sha1_hmac_test_sum[i], buflen ) != 0 )
darran 0:55a05330f8cc 600 {
darran 0:55a05330f8cc 601 if( verbose != 0 )
darran 0:55a05330f8cc 602 printf( "failed\n" );
darran 0:55a05330f8cc 603
darran 0:55a05330f8cc 604 return( 1 );
darran 0:55a05330f8cc 605 }
darran 0:55a05330f8cc 606
darran 0:55a05330f8cc 607 if( verbose != 0 )
darran 0:55a05330f8cc 608 printf( "passed\n" );
darran 0:55a05330f8cc 609 }
darran 0:55a05330f8cc 610
darran 0:55a05330f8cc 611 if( verbose != 0 )
darran 0:55a05330f8cc 612 printf( "\n" );
darran 0:55a05330f8cc 613
darran 0:55a05330f8cc 614 return( 0 );
darran 0:55a05330f8cc 615 }
darran 0:55a05330f8cc 616
darran 0:55a05330f8cc 617 #endif
darran 0:55a05330f8cc 618
darran 0:55a05330f8cc 619 #endif