+++ /dev/null
-/*\r
- * FIPS-180-1 compliant SHA-1 implementation\r
- *\r
- * Copyright (C) 2006-2007 Christophe Devine\r
- *\r
- * This library is free software; you can redistribute it and/or\r
- * modify it under the terms of the GNU Lesser General Public\r
- * License, version 2.1 as published by the Free Software Foundation.\r
- *\r
- * This library is distributed in the hope that it will be useful,\r
- * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
- * Lesser General Public License for more details.\r
- *\r
- * You should have received a copy of the GNU Lesser General Public\r
- * License along with this library; if not, write to the Free Software\r
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\r
- * MA 02110-1301 USA\r
- */\r
-/*\r
- * The SHA-1 standard was published by NIST in 1993.\r
- *\r
- * http://www.itl.nist.gov/fipspubs/fip180-1.htm\r
- */\r
-\r
-#include "../../include/xyssl/config.h"\r
-\r
-#if defined(XYSSL_SHA1_C)\r
-\r
-#include "../../include/xyssl/sha1.h"\r
-\r
-#include <string.h>\r
-#include <stdio.h>\r
-\r
-/*\r
- * 32-bit integer manipulation macros (big endian)\r
- */\r
-#ifndef GET_ULONG_BE\r
-#define GET_ULONG_BE(n,b,i) \\r
-{ \\r
- (n) = ( (unsigned long) (b)[(i) ] << 24 ) \\r
- | ( (unsigned long) (b)[(i) + 1] << 16 ) \\r
- | ( (unsigned long) (b)[(i) + 2] << 8 ) \\r
- | ( (unsigned long) (b)[(i) + 3] ); \\r
-}\r
-#endif\r
-\r
-#ifndef PUT_ULONG_BE\r
-#define PUT_ULONG_BE(n,b,i) \\r
-{ \\r
- (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \\r
- (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \\r
- (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \\r
- (b)[(i) + 3] = (unsigned char) ( (n) ); \\r
-}\r
-#endif\r
-\r
-/*\r
- * SHA-1 context setup\r
- */\r
-void sha1_starts( sha1_context *ctx )\r
-{\r
- ctx->total[0] = 0;\r
- ctx->total[1] = 0;\r
-\r
- ctx->state[0] = 0x67452301;\r
- ctx->state[1] = 0xEFCDAB89;\r
- ctx->state[2] = 0x98BADCFE;\r
- ctx->state[3] = 0x10325476;\r
- ctx->state[4] = 0xC3D2E1F0;\r
-}\r
-\r
-static void sha1_process( sha1_context *ctx, unsigned char data[64] )\r
-{\r
- unsigned long temp, W[16], A, B, C, D, E;\r
-\r
- GET_ULONG_BE( W[ 0], data, 0 );\r
- GET_ULONG_BE( W[ 1], data, 4 );\r
- GET_ULONG_BE( W[ 2], data, 8 );\r
- GET_ULONG_BE( W[ 3], data, 12 );\r
- GET_ULONG_BE( W[ 4], data, 16 );\r
- GET_ULONG_BE( W[ 5], data, 20 );\r
- GET_ULONG_BE( W[ 6], data, 24 );\r
- GET_ULONG_BE( W[ 7], data, 28 );\r
- GET_ULONG_BE( W[ 8], data, 32 );\r
- GET_ULONG_BE( W[ 9], data, 36 );\r
- GET_ULONG_BE( W[10], data, 40 );\r
- GET_ULONG_BE( W[11], data, 44 );\r
- GET_ULONG_BE( W[12], data, 48 );\r
- GET_ULONG_BE( W[13], data, 52 );\r
- GET_ULONG_BE( W[14], data, 56 );\r
- GET_ULONG_BE( W[15], data, 60 );\r
-\r
-#define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))\r
-\r
-#define R(t) \\r
-( \\r
- temp = W[(t - 3) & 0x0F] ^ W[(t - 8) & 0x0F] ^ \\r
- W[(t - 14) & 0x0F] ^ W[ t & 0x0F], \\r
- ( W[t & 0x0F] = S(temp,1) ) \\r
-)\r
-\r
-#define P(a,b,c,d,e,x) \\r
-{ \\r
- e += S(a,5) + F(b,c,d) + K + x; b = S(b,30); \\r
-}\r
-\r
- A = ctx->state[0];\r
- B = ctx->state[1];\r
- C = ctx->state[2];\r
- D = ctx->state[3];\r
- E = ctx->state[4];\r
-\r
-#define F(x,y,z) (z ^ (x & (y ^ z)))\r
-#define K 0x5A827999\r
-\r
- P( A, B, C, D, E, W[0] );\r
- P( E, A, B, C, D, W[1] );\r
- P( D, E, A, B, C, W[2] );\r
- P( C, D, E, A, B, W[3] );\r
- P( B, C, D, E, A, W[4] );\r
- P( A, B, C, D, E, W[5] );\r
- P( E, A, B, C, D, W[6] );\r
- P( D, E, A, B, C, W[7] );\r
- P( C, D, E, A, B, W[8] );\r
- P( B, C, D, E, A, W[9] );\r
- P( A, B, C, D, E, W[10] );\r
- P( E, A, B, C, D, W[11] );\r
- P( D, E, A, B, C, W[12] );\r
- P( C, D, E, A, B, W[13] );\r
- P( B, C, D, E, A, W[14] );\r
- P( A, B, C, D, E, W[15] );\r
- P( E, A, B, C, D, R(16) );\r
- P( D, E, A, B, C, R(17) );\r
- P( C, D, E, A, B, R(18) );\r
- P( B, C, D, E, A, R(19) );\r
-\r
-#undef K\r
-#undef F\r
-\r
-#define F(x,y,z) (x ^ y ^ z)\r
-#define K 0x6ED9EBA1\r
-\r
- P( A, B, C, D, E, R(20) );\r
- P( E, A, B, C, D, R(21) );\r
- P( D, E, A, B, C, R(22) );\r
- P( C, D, E, A, B, R(23) );\r
- P( B, C, D, E, A, R(24) );\r
- P( A, B, C, D, E, R(25) );\r
- P( E, A, B, C, D, R(26) );\r
- P( D, E, A, B, C, R(27) );\r
- P( C, D, E, A, B, R(28) );\r
- P( B, C, D, E, A, R(29) );\r
- P( A, B, C, D, E, R(30) );\r
- P( E, A, B, C, D, R(31) );\r
- P( D, E, A, B, C, R(32) );\r
- P( C, D, E, A, B, R(33) );\r
- P( B, C, D, E, A, R(34) );\r
- P( A, B, C, D, E, R(35) );\r
- P( E, A, B, C, D, R(36) );\r
- P( D, E, A, B, C, R(37) );\r
- P( C, D, E, A, B, R(38) );\r
- P( B, C, D, E, A, R(39) );\r
-\r
-#undef K\r
-#undef F\r
-\r
-#define F(x,y,z) ((x & y) | (z & (x | y)))\r
-#define K 0x8F1BBCDC\r
-\r
- P( A, B, C, D, E, R(40) );\r
- P( E, A, B, C, D, R(41) );\r
- P( D, E, A, B, C, R(42) );\r
- P( C, D, E, A, B, R(43) );\r
- P( B, C, D, E, A, R(44) );\r
- P( A, B, C, D, E, R(45) );\r
- P( E, A, B, C, D, R(46) );\r
- P( D, E, A, B, C, R(47) );\r
- P( C, D, E, A, B, R(48) );\r
- P( B, C, D, E, A, R(49) );\r
- P( A, B, C, D, E, R(50) );\r
- P( E, A, B, C, D, R(51) );\r
- P( D, E, A, B, C, R(52) );\r
- P( C, D, E, A, B, R(53) );\r
- P( B, C, D, E, A, R(54) );\r
- P( A, B, C, D, E, R(55) );\r
- P( E, A, B, C, D, R(56) );\r
- P( D, E, A, B, C, R(57) );\r
- P( C, D, E, A, B, R(58) );\r
- P( B, C, D, E, A, R(59) );\r
-\r
-#undef K\r
-#undef F\r
-\r
-#define F(x,y,z) (x ^ y ^ z)\r
-#define K 0xCA62C1D6\r
-\r
- P( A, B, C, D, E, R(60) );\r
- P( E, A, B, C, D, R(61) );\r
- P( D, E, A, B, C, R(62) );\r
- P( C, D, E, A, B, R(63) );\r
- P( B, C, D, E, A, R(64) );\r
- P( A, B, C, D, E, R(65) );\r
- P( E, A, B, C, D, R(66) );\r
- P( D, E, A, B, C, R(67) );\r
- P( C, D, E, A, B, R(68) );\r
- P( B, C, D, E, A, R(69) );\r
- P( A, B, C, D, E, R(70) );\r
- P( E, A, B, C, D, R(71) );\r
- P( D, E, A, B, C, R(72) );\r
- P( C, D, E, A, B, R(73) );\r
- P( B, C, D, E, A, R(74) );\r
- P( A, B, C, D, E, R(75) );\r
- P( E, A, B, C, D, R(76) );\r
- P( D, E, A, B, C, R(77) );\r
- P( C, D, E, A, B, R(78) );\r
- P( B, C, D, E, A, R(79) );\r
-\r
-#undef K\r
-#undef F\r
-\r
- ctx->state[0] += A;\r
- ctx->state[1] += B;\r
- ctx->state[2] += C;\r
- ctx->state[3] += D;\r
- ctx->state[4] += E;\r
-}\r
-\r
-/*\r
- * SHA-1 process buffer\r
- */\r
-void sha1_update( sha1_context *ctx, unsigned char *input, int ilen )\r
-{\r
- int fill;\r
- unsigned long left;\r
-\r
- if( ilen <= 0 )\r
- return;\r
-\r
- left = ctx->total[0] & 0x3F;\r
- fill = 64 - left;\r
-\r
- ctx->total[0] += ilen;\r
- ctx->total[0] &= 0xFFFFFFFF;\r
-\r
- if( ctx->total[0] < (unsigned long) ilen )\r
- ctx->total[1]++;\r
-\r
- if( left && ilen >= fill )\r
- {\r
- memcpy( (void *) (ctx->buffer + left),\r
- (void *) input, fill );\r
- sha1_process( ctx, ctx->buffer );\r
- input += fill;\r
- ilen -= fill;\r
- left = 0;\r
- }\r
-\r
- while( ilen >= 64 )\r
- {\r
- sha1_process( ctx, input );\r
- input += 64;\r
- ilen -= 64;\r
- }\r
-\r
- if( ilen > 0 )\r
- {\r
- memcpy( (void *) (ctx->buffer + left),\r
- (void *) input, ilen );\r
- }\r
-}\r
-\r
-static const unsigned char sha1_padding[64] =\r
-{\r
- 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\r
-};\r
-\r
-/*\r
- * SHA-1 final digest\r
- */\r
-void sha1_finish( sha1_context *ctx, unsigned char output[20] )\r
-{\r
- unsigned long last, padn;\r
- unsigned long high, low;\r
- unsigned char msglen[8];\r
-\r
- high = ( ctx->total[0] >> 29 )\r
- | ( ctx->total[1] << 3 );\r
- low = ( ctx->total[0] << 3 );\r
-\r
- PUT_ULONG_BE( high, msglen, 0 );\r
- PUT_ULONG_BE( low, msglen, 4 );\r
-\r
- last = ctx->total[0] & 0x3F;\r
- padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );\r
-\r
- sha1_update( ctx, (unsigned char *) sha1_padding, padn );\r
- sha1_update( ctx, msglen, 8 );\r
-\r
- PUT_ULONG_BE( ctx->state[0], output, 0 );\r
- PUT_ULONG_BE( ctx->state[1], output, 4 );\r
- PUT_ULONG_BE( ctx->state[2], output, 8 );\r
- PUT_ULONG_BE( ctx->state[3], output, 12 );\r
- PUT_ULONG_BE( ctx->state[4], output, 16 );\r
-}\r
-\r
-/*\r
- * output = SHA-1( input buffer )\r
- */\r
-void sha1( unsigned char *input, int ilen, unsigned char output[20] )\r
-{\r
- sha1_context ctx;\r
-\r
- sha1_starts( &ctx );\r
- sha1_update( &ctx, input, ilen );\r
- sha1_finish( &ctx, output );\r
-\r
- memset( &ctx, 0, sizeof( sha1_context ) );\r
-}\r
-\r
-/*\r
- * output = SHA-1( file contents )\r
- */\r
-int sha1_file( char *path, unsigned char output[20] )\r
-{\r
- FILE *f;\r
- size_t n;\r
- sha1_context ctx;\r
- unsigned char buf[1024];\r
-\r
- if( ( f = fopen( path, "rb" ) ) == NULL )\r
- return( 1 );\r
-\r
- sha1_starts( &ctx );\r
-\r
- while( ( n = fread( buf, 1, sizeof( buf ), f ) ) > 0 )\r
- sha1_update( &ctx, buf, (int) n );\r
-\r
- sha1_finish( &ctx, output );\r
-\r
- memset( &ctx, 0, sizeof( sha1_context ) );\r
-\r
- if( ferror( f ) != 0 )\r
- {\r
- fclose( f );\r
- return( 2 );\r
- }\r
-\r
- fclose( f );\r
- return( 0 );\r
-}\r
-\r
-/*\r
- * SHA-1 HMAC context setup\r
- */\r
-void sha1_hmac_starts( sha1_context *ctx, unsigned char *key, int keylen )\r
-{\r
- int i;\r
- unsigned char sum[20];\r
-\r
- if( keylen > 64 )\r
- {\r
- sha1( key, keylen, sum );\r
- keylen = 20;\r
- key = sum;\r
- }\r
-\r
- memset( ctx->ipad, 0x36, 64 );\r
- memset( ctx->opad, 0x5C, 64 );\r
-\r
- for( i = 0; i < keylen; i++ )\r
- {\r
- ctx->ipad[i] = (unsigned char)( ctx->ipad[i] ^ key[i] );\r
- ctx->opad[i] = (unsigned char)( ctx->opad[i] ^ key[i] );\r
- }\r
-\r
- sha1_starts( ctx );\r
- sha1_update( ctx, ctx->ipad, 64 );\r
-\r
- memset( sum, 0, sizeof( sum ) );\r
-}\r
-\r
-/*\r
- * SHA-1 HMAC process buffer\r
- */\r
-void sha1_hmac_update( sha1_context *ctx, unsigned char *input, int ilen )\r
-{\r
- sha1_update( ctx, input, ilen );\r
-}\r
-\r
-/*\r
- * SHA-1 HMAC final digest\r
- */\r
-void sha1_hmac_finish( sha1_context *ctx, unsigned char output[20] )\r
-{\r
- unsigned char tmpbuf[20];\r
-\r
- sha1_finish( ctx, tmpbuf );\r
- sha1_starts( ctx );\r
- sha1_update( ctx, ctx->opad, 64 );\r
- sha1_update( ctx, tmpbuf, 20 );\r
- sha1_finish( ctx, output );\r
-\r
- memset( tmpbuf, 0, sizeof( tmpbuf ) );\r
-}\r
-\r
-/*\r
- * output = HMAC-SHA-1( hmac key, input buffer )\r
- */\r
-void sha1_hmac( unsigned char *key, int keylen, unsigned char *input, int ilen,\r
- unsigned char output[20] )\r
-{\r
- sha1_context ctx;\r
-\r
- sha1_hmac_starts( &ctx, key, keylen );\r
- sha1_hmac_update( &ctx, input, ilen );\r
- sha1_hmac_finish( &ctx, output );\r
-\r
- memset( &ctx, 0, sizeof( sha1_context ) );\r
-}\r
-\r
-#if defined(XYSSL_SELF_TEST)\r
-\r
-/*\r
- * FIPS-180-1 test vectors\r
- */\r
-static const char sha1_test_str[3][57] = \r
-{\r
- { "abc" },\r
- { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },\r
- { "" }\r
-};\r
-\r
-static const unsigned char sha1_test_sum[3][20] =\r
-{\r
- { 0xA9, 0x99, 0x3E, 0x36, 0x47, 0x06, 0x81, 0x6A, 0xBA, 0x3E,\r
- 0x25, 0x71, 0x78, 0x50, 0xC2, 0x6C, 0x9C, 0xD0, 0xD8, 0x9D },\r
- { 0x84, 0x98, 0x3E, 0x44, 0x1C, 0x3B, 0xD2, 0x6E, 0xBA, 0xAE,\r
- 0x4A, 0xA1, 0xF9, 0x51, 0x29, 0xE5, 0xE5, 0x46, 0x70, 0xF1 },\r
- { 0x34, 0xAA, 0x97, 0x3C, 0xD4, 0xC4, 0xDA, 0xA4, 0xF6, 0x1E,\r
- 0xEB, 0x2B, 0xDB, 0xAD, 0x27, 0x31, 0x65, 0x34, 0x01, 0x6F }\r
-};\r
-\r
-/*\r
- * Checkup routine\r
- */\r
-int sha1_self_test( int verbose )\r
-{\r
- int i, j;\r
- unsigned char buf[1000];\r
- unsigned char sha1sum[20];\r
- sha1_context ctx;\r
-\r
- for( i = 0; i < 3; i++ )\r
- {\r
- if( verbose != 0 )\r
- printf( " SHA-1 test #%d: ", i + 1 );\r
-\r
- sha1_starts( &ctx );\r
-\r
- if( i < 2 )\r
- sha1_update( &ctx, (unsigned char *) sha1_test_str[i],\r
- strlen( sha1_test_str[i] ) );\r
- else\r
- {\r
- memset( buf, 'a', 1000 );\r
- for( j = 0; j < 1000; j++ )\r
- sha1_update( &ctx, buf, 1000 );\r
- }\r
-\r
- sha1_finish( &ctx, sha1sum );\r
-\r
- if( memcmp( sha1sum, sha1_test_sum[i], 20 ) != 0 )\r
- {\r
- if( verbose != 0 )\r
- printf( "failed\n" );\r
-\r
- return( 1 );\r
- }\r
-\r
- if( verbose != 0 )\r
- printf( "passed\n" );\r
- }\r
-\r
- if( verbose != 0 )\r
- printf( "\n" );\r
-\r
- return( 0 );\r
-}\r
-\r
-#endif\r
-\r
-#endif\r
projects / fms.git / blobdiff