rainlance
/
amiga-apg
mirror of https://frontier.innolan.net/rainlance/amiga-apg.git
1
0
Fork 0
Code Releases 1 Activity
amiga-apg/sha/sha.c

409 lines
11 KiB
C
Raw Permalink Blame History

/***************************************************************************/
/* sha.c */
/* */
/* Public domain SHA-1 implementation. */
/* */
/* Taken from the SHA implementation by Peter C. Gutmann of 9/2/1992 */
/* and modified by Carl Ellison to be SHA-1. */
/***************************************************************************/
/*
** Note regarding apg_* namespace: this avoids potential conflicts
** with libraries.
*/
#include <string.h>
#include "sha.h"
/* The SHA f()-functions */
#define f1(x,y,z) ( ( x & y ) | ( ~x & z ) ) /* Rounds 0-19 */
#define f2(x,y,z) ( x ^ y ^ z ) /* Rounds 20-39 */
#define f3(x,y,z) ( ( x & y ) | ( x & z ) | ( y & z ) ) /* Rounds 40-59 */
#define f4(x,y,z) ( x ^ y ^ z ) /* Rounds 60-79 */
/* The SHA Mysterious Constants */
#define K1 0x5A827999L /* Rounds 0-19 */
#define K2 0x6ED9EBA1L /* Rounds 20-39 */
#define K3 0x8F1BBCDCL /* Rounds 40-59 */
#define K4 0xCA62C1D6L /* Rounds 60-79 */
/* SHA initial values */
#define h0init 0x67452301L
#define h1init 0xEFCDAB89L
#define h2init 0x98BADCFEL
#define h3init 0x10325476L
#define h4init 0xC3D2E1F0L
/* 32-bit rotate - kludged with shifts */
typedef unsigned long UL ; /* to save space */
#define S(n,X) ( ( ((UL)X) << n ) | ( ((UL)X) >> ( 32 - n ) ) )
/* The initial expanding function */
#define expand(count) W[ count ] = S(1,(W[ count - 3 ] ^ W[ count - 8 ] ^ W[ count - 14 ] ^ W[ count - 16 ])) /* to make this SHA-1 */
/* The four SHA sub-rounds */
#define subRound1(count) \
{ \
temp = S( 5, A ) + f1( B, C, D ) + E + W[ count ] + K1; \
E = D; \
D = C; \
C = S( 30, B ); \
B = A; \
A = temp; \
}
#define subRound2(count) \
{ \
temp = S( 5, A ) + f2( B, C, D ) + E + W[ count ] + K2; \
E = D; \
D = C; \
C = S( 30, B ); \
B = A; \
A = temp; \
}
#define subRound3(count) \
{ \
temp = S( 5, A ) + f3( B, C, D ) + E + W[ count ] + K3; \
E = D; \
D = C; \
C = S( 30, B ); \
B = A; \
A = temp; \
}
#define subRound4(count) \
{ \
temp = S( 5, A ) + f4( B, C, D ) + E + W[ count ] + K4; \
E = D; \
D = C; \
C = S( 30, B ); \
B = A; \
A = temp; \
}
/* The two buffers of 5 32-bit words */
LONG h0, h1, h2, h3, h4;
LONG A, B, C, D, E;
/***************************************************************************/
/* apg_shaInit */
/* */
/* Initialize the SHA values */
/***************************************************************************/
void apg_shaInit( apg_SHA_INFO *shaInfo )
{
/* Set the h-vars to their initial values */
shaInfo->digest[ 0 ] = h0init;
shaInfo->digest[ 1 ] = h1init;
shaInfo->digest[ 2 ] = h2init;
shaInfo->digest[ 3 ] = h3init;
shaInfo->digest[ 4 ] = h4init;
/* Initialise bit count */
shaInfo->countLo = shaInfo->countHi = 0L;
shaInfo->slop = 0 ; /* no data saved yet in data[] */
} /* apg_shaInit */
/***************************************************************************/
/* shaTransform */
/* */
/* Perform the SHA transformation over one input block. */
/***************************************************************************/
static void shaTransform( apg_SHA_INFO *shaInfo )
{
LONG W[ 80 ], temp;
int i;
/* Step A. Copy the data buffer into the local work buffer */
for( i = 0; i < 16; i++ )
W[ i ] = shaInfo->data[ i ];
/* Step B. Expand the 16 words into 64 temporary data words */
expand( 16 );
expand( 17 );
expand( 18 );
expand( 19 );
expand( 20 );
expand( 21 );
expand( 22 );
expand( 23 );
expand( 24 );
expand( 25 );
expand( 26 );
expand( 27 );
expand( 28 );
expand( 29 );
expand( 30 );
expand( 31 );
expand( 32 );
expand( 33 );
expand( 34 );
expand( 35 );
expand( 36 );
expand( 37 );
expand( 38 );
expand( 39 );
expand( 40 );
expand( 41 );
expand( 42 );
expand( 43 );
expand( 44 );
expand( 45 );
expand( 46 );
expand( 47 );
expand( 48 );
expand( 49 );
expand( 50 );
expand( 51 );
expand( 52 );
expand( 53 );
expand( 54 );
expand( 55 );
expand( 56 );
expand( 57 );
expand( 58 );
expand( 59 );
expand( 60 );
expand( 61 );
expand( 62 );
expand( 63 );
expand( 64 );
expand( 65 );
expand( 66 );
expand( 67 );
expand( 68 );
expand( 69 );
expand( 70 );
expand( 71 );
expand( 72 );
expand( 73 );
expand( 74 );
expand( 75 );
expand( 76 );
expand( 77 );
expand( 78 );
expand( 79 );
/* Step C. Set up first buffer */
A = shaInfo->digest[ 0 ];
B = shaInfo->digest[ 1 ];
C = shaInfo->digest[ 2 ];
D = shaInfo->digest[ 3 ];
E = shaInfo->digest[ 4 ];
/* Step D. Serious mangling, divided into four sub-rounds */
subRound1( 0 );
subRound1( 1 );
subRound1( 2 );
subRound1( 3 );
subRound1( 4 );
subRound1( 5 );
subRound1( 6 );
subRound1( 7 );
subRound1( 8 );
subRound1( 9 );
subRound1( 10 );
subRound1( 11 );
subRound1( 12 );
subRound1( 13 );
subRound1( 14 );
subRound1( 15 );
subRound1( 16 );
subRound1( 17 );
subRound1( 18 );
subRound1( 19 );
subRound2( 20 );
subRound2( 21 );
subRound2( 22 );
subRound2( 23 );
subRound2( 24 );
subRound2( 25 );
subRound2( 26 );
subRound2( 27 );
subRound2( 28 );
subRound2( 29 );
subRound2( 30 );
subRound2( 31 );
subRound2( 32 );
subRound2( 33 );
subRound2( 34 );
subRound2( 35 );
subRound2( 36 );
subRound2( 37 );
subRound2( 38 );
subRound2( 39 );
subRound3( 40 );
subRound3( 41 );
subRound3( 42 );
subRound3( 43 );
subRound3( 44 );
subRound3( 45 );
subRound3( 46 );
subRound3( 47 );
subRound3( 48 );
subRound3( 49 );
subRound3( 50 );
subRound3( 51 );
subRound3( 52 );
subRound3( 53 );
subRound3( 54 );
subRound3( 55 );
subRound3( 56 );
subRound3( 57 );
subRound3( 58 );
subRound3( 59 );
subRound4( 60 );
subRound4( 61 );
subRound4( 62 );
subRound4( 63 );
subRound4( 64 );
subRound4( 65 );
subRound4( 66 );
subRound4( 67 );
subRound4( 68 );
subRound4( 69 );
subRound4( 70 );
subRound4( 71 );
subRound4( 72 );
subRound4( 73 );
subRound4( 74 );
subRound4( 75 );
subRound4( 76 );
subRound4( 77 );
subRound4( 78 );
subRound4( 79 );
/* Step E. Build message digest */
shaInfo->digest[ 0 ] += A;
shaInfo->digest[ 1 ] += B;
shaInfo->digest[ 2 ] += C;
shaInfo->digest[ 3 ] += D;
shaInfo->digest[ 4 ] += E;
} /* shaTransform */
#ifdef APG_LITTLE_ENDIAN
/***************************************************************************/
/* byteReverse */
/* */
/* When run on a little-endian CPU we need to perform byte reversal on an */
/* array of longwords. It is possible to make the code endianness- */
/* independant by fiddling around with data at the byte level, but this */
/* makes for very slow code, so we rely on the user to sort out endianness */
/* at compile time. */
/***************************************************************************/
static void byteReverse( LONG *buffer, int byteCount )
{
LONG value;
int count;
byteCount /= sizeof( LONG );
for( count = 0; count < byteCount; count++ )
{
value = ( buffer[ count ] << 16 ) | ( buffer[ count ] >> 16 );
buffer[ count ] = ( ( value & 0xFF00FF00L ) >> 8 ) | ( ( value & 0x00FF00FFL ) << 8 );
} /* for */
} /* byteReverse */
#endif /* APG_LITTLE_ENDIAN */
/***************************************************************************/
/* apg_shaUpdate */
/* */
/* Update SHA for a block of data. */
/* Use any data already in the SHA_INFO structure and leave any partial */
/* data block there. */
/***************************************************************************/
void apg_shaUpdate( apg_SHA_INFO *shaInfo, BYTE *buffer, int count )
{
BYTE *db ;
db = (BYTE *) &(shaInfo->data[0]) ;
/* Update bitcount */
if( ( shaInfo->countLo + ( ( LONG ) count << 3 ) ) < shaInfo->countLo )
shaInfo->countHi++; /* Carry from low to high bitCount */
shaInfo->countLo += ( ( LONG ) count << 3 );
shaInfo->countHi += ( ( LONG ) count >> 29 );
/* Process data in SHA_BLOCKSIZE chunks */
while ( count-- > 0 )
{
db[ shaInfo->slop++ ] = *(buffer++) ;
if (shaInfo->slop == SHA_BLOCKSIZE)
{ /* transform this one block */
#ifdef APG_LITTLE_ENDIAN
byteReverse( shaInfo->data, SHA_BLOCKSIZE );
#endif /* APG_LITTLE_ENDIAN */
shaTransform( shaInfo );
shaInfo->slop = 0 ; /* no slop left */
} /* if */
} /* while */
} /* apg_shaUpdate */
/***************************************************************************/
/* apg_shaFinal */
/* */
/* Handle the last piece of data -- if any is left over in the data */
/* buffer -- and append padding and a bit count for the last block */
/* to process. Having transformed that block, pull the digest out */
/* as a byte array. */
/***************************************************************************/
void apg_shaFinal( apg_SHA_INFO *shaInfo, BYTE hash[SHA_DIGESTSIZE] )
{
int count;
LONG lowBitcount = shaInfo->countLo, highBitcount = shaInfo->countHi;
/* Compute number of bytes mod 64 */
count = ( int ) ( ( shaInfo->countLo >> 3 ) & 0x3F );
/* Set the first char of padding to 0x80. This is safe since there is
always at least one byte free */
( ( BYTE * ) shaInfo->data )[ count++ ] = 0x80;
/* Pad out to 56 mod 64 */
if( count > 56 )
{
/* Two lots of padding: Pad the first block to 64 bytes */
memset( ( BYTE * ) &shaInfo->data + count, 0, 64 - count );
#ifdef APG_LITTLE_ENDIAN
byteReverse( shaInfo->data, SHA_BLOCKSIZE );
#endif /* APG_LITTLE_ENDIAN */
shaTransform( shaInfo );
/* Now fill the next block with 56 bytes */
memset( &shaInfo->data, 0, 56 );
}
else
/* Pad block to 56 bytes */
memset( ( BYTE * ) &shaInfo->data + count, 0, 56 - count );
#ifdef APG_LITTLE_ENDIAN
byteReverse( shaInfo->data, SHA_BLOCKSIZE );
#endif /* APG_LITTLE_ENDIAN */
/* Append length in bits and transform */
shaInfo->data[ 14 ] = highBitcount;
shaInfo->data[ 15 ] = lowBitcount;
shaTransform( shaInfo );
#ifdef APG_LITTLE_ENDIAN
byteReverse( shaInfo->data, SHA_DIGESTSIZE );
#endif /* APG_LITTLE_ENDIAN */
for (count=0; count<SHA_DIGESTSIZE; count++)
hash[count] = (BYTE) ((shaInfo->digest[count>>2]) >> (8*(3-(count & 0x3)))) & 0xff ;
} /* apg_shaFinal */
View Git Blame Copy Permalink