📄 sha.cpp
字号:
#ifndef SHADEF
#define SHADEF
#include "stdio.h"
//#include "mem.h"
#include "string.h"
#include "usuals.h"
extern void SHA(unsigned char *pbData, unsigned long dwDataLen, unsigned char *pDigest);
typedef struct {
unsigned long dwFlags; //0
unsigned long hash[5]; //4
unsigned long digest[5]; //18+0
unsigned long countHi; //18+14 64-bit bit count
unsigned long countLo; //18+18
unsigned long data[ 16 ]; //18+1c SHS data buffer
}SHA_Context;
/* The SHS block size and message digest sizes, in bytes */
#define SHS_DATASIZE 64
#define SHS_DIGESTSIZE 20
/* The SHS f()-functions. The f1 and f3 functions can be optimized to
save one boolean operation each - thanks to Rich Schroeppel,
rcs@cs.arizona.edu for discovering this */
/*#define f1(x,y,z) ( ( x & y ) | ( ~x & z ) ) // Rounds 0-19 */
#define f1(x,y,z) ( z ^ ( x & ( y ^ 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 f3(x,y,z) ( ( x & y ) | ( z & ( x | y ) ) ) /* Rounds 40-59 */
#define f4(x,y,z) ( x ^ y ^ z ) /* Rounds 60-79 */
/* The SHS 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 */
/* Note that it may be necessary to add parentheses to these macros if they
are to be called with expressions as arguments */
/* 32-bit rotate left - kludged with shifts */
#define ROTL(n,X) ( ( ( X ) << n ) | ( ( X ) >> ( 32 - n ) ) )
/* The initial expanding function. The hash function is defined over an
80-word expanded input array W, where the first 16 are copies of the input
data, and the remaining 64 are defined by
W[ i ] = W[ i - 16 ] ^ W[ i - 14 ] ^ W[ i - 8 ] ^ W[ i - 3 ]
This implementation generates these values on the fly in a circular
buffer - thanks to Colin Plumb, colin@nyx10.cs.du.edu for this
optimization.
The updated SHS changes the expanding function by adding a rotate of 1
bit. Thanks to Jim Gillogly, jim@rand.org, and an anonymous contributor
for this information */
#define expand(W,i) ( W[ i & 15 ] = ROTL( 1, ( W[ i & 15 ] ^ W[ (i - 14) & 15 ] ^ \
W[ (i - 8) & 15 ] ^ W[ (i - 3) & 15 ] ) ) )
/* The prototype SHS sub-round. The fundamental sub-round is:
a' = e + ROTL( 5, a ) + f( b, c, d ) + k + data;
b' = a;
c' = ROTL( 30, b );
d' = c;
e' = d;
but this is implemented by unrolling the loop 5 times and renaming the
variables ( e, a, b, c, d ) = ( a', b', c', d', e' ) each iteration.
This code is then replicated 20 times for each of the 4 functions, using
the next 20 values from the W[] array each time */
#define subRound(a, b, c, d, e, f, k, data) \
( e += ROTL( 5, a ) + f( b, c, d ) + k + data, b = ROTL( 30, b ) )
/* When run on a little-endian CPU we need to perform byte reversal on an
array of longwords. */
void longReverse(
unsigned long *pDst,
unsigned long *pSrc,
unsigned long count)
{
long i;
unsigned char buf[4],tmp[4];
for(i=0;(unsigned long)i<count;i++)
{
memcpy(buf,pSrc+i,4);
tmp[0]=buf[3];
tmp[1]=buf[2];
tmp[2]=buf[1];
tmp[3]=buf[0];
memcpy(pDst+i,tmp,4);
}
}
// SHA 置初态
void SHAinit(SHA_Context *pSHACtx)
{
pSHACtx->countLo = 0;
pSHACtx->countHi = 0;
pSHACtx->digest[0] = 0x67452301;
pSHACtx->digest[1] = 0xEFCDAB89;
pSHACtx->digest[2] = 0x98BADCFE;
pSHACtx->digest[3] = 0x10325476;
pSHACtx->digest[4] = 0xC3D2E1F0;
}
/* Perform the SHS transformation. Note that this code, like MD5, seems to
break some optimizing compilers due to the complexity of the expressions
and the size of the basic block. It may be necessary to split it into
sections, e.g. based on the four subrounds
Note that this corrupts the shsInfo->data area */
void SHSTransform(
unsigned long *digest,
unsigned long *data)
{
unsigned long A, B, C, D, E; // Local vars
unsigned long eData[ 16 ]; // Expanded data
/* Set up first buffer and local data buffer */
A = digest[ 0 ];
B = digest[ 1 ];
C = digest[ 2 ];
D = digest[ 3 ];
E = digest[ 4 ];
longReverse(eData, data, 16);
// memmove( eData, data, SHS_DATASIZE );
#ifdef DEBUG
printf("start: %08x %08x %08x %08x %08x\n", A, B, C, D, E);
#endif
/* Heavy mangling, in 4 sub-rounds of 20 interations each. */
subRound( A, B, C, D, E, f1, K1, eData[ 0 ] );
subRound( E, A, B, C, D, f1, K1, eData[ 1 ] );
subRound( D, E, A, B, C, f1, K1, eData[ 2 ] );
subRound( C, D, E, A, B, f1, K1, eData[ 3 ] );
subRound( B, C, D, E, A, f1, K1, eData[ 4 ] );
subRound( A, B, C, D, E, f1, K1, eData[ 5 ] );
subRound( E, A, B, C, D, f1, K1, eData[ 6 ] );
subRound( D, E, A, B, C, f1, K1, eData[ 7 ] );
subRound( C, D, E, A, B, f1, K1, eData[ 8 ] );
subRound( B, C, D, E, A, f1, K1, eData[ 9 ] );
subRound( A, B, C, D, E, f1, K1, eData[ 10 ] );
subRound( E, A, B, C, D, f1, K1, eData[ 11 ] );
subRound( D, E, A, B, C, f1, K1, eData[ 12 ] );
subRound( C, D, E, A, B, f1, K1, eData[ 13 ] );
subRound( B, C, D, E, A, f1, K1, eData[ 14 ] );
subRound( A, B, C, D, E, f1, K1, eData[ 15 ] );
subRound( E, A, B, C, D, f1, K1, expand( eData, 16 ) );
subRound( D, E, A, B, C, f1, K1, expand( eData, 17 ) );
subRound( C, D, E, A, B, f1, K1, expand( eData, 18 ) );
subRound( B, C, D, E, A, f1, K1, expand( eData, 19 ) );
#ifdef DEBUG
printf("2 : %08x %08x %08x %08x %08x\n", A, B, C, D, E);
#endif
subRound( A, B, C, D, E, f2, K2, expand( eData, 20 ) );
subRound( E, A, B, C, D, f2, K2, expand( eData, 21 ) );
subRound( D, E, A, B, C, f2, K2, expand( eData, 22 ) );
subRound( C, D, E, A, B, f2, K2, expand( eData, 23 ) );
subRound( B, C, D, E, A, f2, K2, expand( eData, 24 ) );
subRound( A, B, C, D, E, f2, K2, expand( eData, 25 ) );
subRound( E, A, B, C, D, f2, K2, expand( eData, 26 ) );
subRound( D, E, A, B, C, f2, K2, expand( eData, 27 ) );
subRound( C, D, E, A, B, f2, K2, expand( eData, 28 ) );
subRound( B, C, D, E, A, f2, K2, expand( eData, 29 ) );
subRound( A, B, C, D, E, f2, K2, expand( eData, 30 ) );
subRound( E, A, B, C, D, f2, K2, expand( eData, 31 ) );
subRound( D, E, A, B, C, f2, K2, expand( eData, 32 ) );
subRound( C, D, E, A, B, f2, K2, expand( eData, 33 ) );
subRound( B, C, D, E, A, f2, K2, expand( eData, 34 ) );
subRound( A, B, C, D, E, f2, K2, expand( eData, 35 ) );
subRound( E, A, B, C, D, f2, K2, expand( eData, 36 ) );
subRound( D, E, A, B, C, f2, K2, expand( eData, 37 ) );
subRound( C, D, E, A, B, f2, K2, expand( eData, 38 ) );
subRound( B, C, D, E, A, f2, K2, expand( eData, 39 ) );
#ifdef DEBUG
printf("3 : %08x %08x %08x %08x %08x\n", A, B, C, D, E);
#endif
subRound( A, B, C, D, E, f3, K3, expand( eData, 40 ) );
subRound( E, A, B, C, D, f3, K3, expand( eData, 41 ) );
subRound( D, E, A, B, C, f3, K3, expand( eData, 42 ) );
subRound( C, D, E, A, B, f3, K3, expand( eData, 43 ) );
subRound( B, C, D, E, A, f3, K3, expand( eData, 44 ) );
subRound( A, B, C, D, E, f3, K3, expand( eData, 45 ) );
subRound( E, A, B, C, D, f3, K3, expand( eData, 46 ) );
subRound( D, E, A, B, C, f3, K3, expand( eData, 47 ) );
subRound( C, D, E, A, B, f3, K3, expand( eData, 48 ) );
subRound( B, C, D, E, A, f3, K3, expand( eData, 49 ) );
subRound( A, B, C, D, E, f3, K3, expand( eData, 50 ) );
subRound( E, A, B, C, D, f3, K3, expand( eData, 51 ) );
subRound( D, E, A, B, C, f3, K3, expand( eData, 52 ) );
subRound( C, D, E, A, B, f3, K3, expand( eData, 53 ) );
subRound( B, C, D, E, A, f3, K3, expand( eData, 54 ) );
subRound( A, B, C, D, E, f3, K3, expand( eData, 55 ) );
subRound( E, A, B, C, D, f3, K3, expand( eData, 56 ) );
subRound( D, E, A, B, C, f3, K3, expand( eData, 57 ) );
subRound( C, D, E, A, B, f3, K3, expand( eData, 58 ) );
subRound( B, C, D, E, A, f3, K3, expand( eData, 59 ) );
#ifdef DEBUG
printf("4 : %08x %08x %08x %08x %08x\n", A, B, C, D, E);
#endif
subRound( A, B, C, D, E, f4, K4, expand( eData, 60 ) );
subRound( E, A, B, C, D, f4, K4, expand( eData, 61 ) );
subRound( D, E, A, B, C, f4, K4, expand( eData, 62 ) );
subRound( C, D, E, A, B, f4, K4, expand( eData, 63 ) );
subRound( B, C, D, E, A, f4, K4, expand( eData, 64 ) );
subRound( A, B, C, D, E, f4, K4, expand( eData, 65 ) );
subRound( E, A, B, C, D, f4, K4, expand( eData, 66 ) );
subRound( D, E, A, B, C, f4, K4, expand( eData, 67 ) );
subRound( C, D, E, A, B, f4, K4, expand( eData, 68 ) );
subRound( B, C, D, E, A, f4, K4, expand( eData, 69 ) );
subRound( A, B, C, D, E, f4, K4, expand( eData, 70 ) );
subRound( E, A, B, C, D, f4, K4, expand( eData, 71 ) );
subRound( D, E, A, B, C, f4, K4, expand( eData, 72 ) );
subRound( C, D, E, A, B, f4, K4, expand( eData, 73 ) );
subRound( B, C, D, E, A, f4, K4, expand( eData, 74 ) );
subRound( A, B, C, D, E, f4, K4, expand( eData, 75 ) );
subRound( E, A, B, C, D, f4, K4, expand( eData, 76 ) );
subRound( D, E, A, B, C, f4, K4, expand( eData, 77 ) );
subRound( C, D, E, A, B, f4, K4, expand( eData, 78 ) );
subRound( B, C, D, E, A, f4, K4, expand( eData, 79 ) );
#ifdef DEBUG
printf("5 : %08x %08x %08x %08x %08x\n", A, B, C, D, E);
#endif
/* Build message digest */
digest[ 0 ] += A;
digest[ 1 ] += B;
digest[ 2 ] += C;
digest[ 3 ] += D;
digest[ 4 ] += E;
}
/* Update SHS for a block of data */
void SHAupdate(
SHA_Context *pSHACtx, //0
unsigned char *pbData, //4
unsigned long dwDataLen) //8
{
unsigned long tmp;
long dataCount;
/* Update bitcount */
tmp = pSHACtx->countLo;
if (( pSHACtx->countLo = tmp + dwDataLen) < tmp )
pSHACtx->countHi++; /* Carry from low to high */
/* Get count of bytes already in data */
dataCount = ( long)(tmp & 0x3F);
/* Handle any leading odd-sized chunks */
if ( dataCount )
{
unsigned char *p = ( unsigned char * ) pSHACtx->data + dataCount;
dataCount = 64 - dataCount;
if (dwDataLen < (unsigned long)dataCount )
{
memmove(p, pbData, dwDataLen);
return;
}
memmove(p, pbData, dataCount);
pbData += dataCount;
dwDataLen -= dataCount;
SHSTransform(pSHACtx->digest, pSHACtx->data );
}
// loc_7CA0C9F5
/* Process data in SHS_DATASIZE chunks */
while( dwDataLen >= 64 )
{
SHSTransform( pSHACtx->digest, (unsigned long*)pbData);
pbData += SHS_DATASIZE;
dwDataLen -= SHS_DATASIZE;
}
// loc_7CA0CA1E
// Handle any remaining bytes of data.
if (dwDataLen)
memmove(pSHACtx->data, pbData, dwDataLen);
}
/* Final wrapup - pad to SHS_DATASIZE-byte boundary with the bit pattern
1 0* (64-bit count of bits processed, MSB-first) */
void SHAdigest(SHA_Context *pSHACtx, unsigned long *pHash)
{
long count;
unsigned char *dataPtr;
unsigned long bits[2];
/* Compute number of bytes mod 64 */
count = ( long) (pSHACtx->countLo & 0x3f);
/* Set the first char of padding to 0x80. This is safe since there is
always at least one byte free */
dataPtr = ( unsigned char * ) pSHACtx->data + count;
*dataPtr++ = 0x80;
/* Bytes of padding needed to make 64 bytes */
count = SHS_DATASIZE - 1 - count;
/* Pad out to 56 mod 64 */
if ( count < 8 )
{
/* Two lots of padding: Pad the first block to 64 bytes */
memset( dataPtr, 0, count );
SHSTransform( pSHACtx->digest, pSHACtx->data );
/* Now fill the next block with 56 bytes */
memset( pSHACtx->data, 0, SHS_DATASIZE - 8 );
}
else
/* Pad block to 56 bytes */
memset( dataPtr, 0, count - 8 );
/* Append length in bits and transform */
bits[0] = (pSHACtx->countHi << 3) + (pSHACtx->countLo >> 0x29);
bits[1] = (pSHACtx->countLo << 3);
longReverse(&pSHACtx->data[14], bits, 2);
SHSTransform( pSHACtx->digest, pSHACtx->data );
longReverse(pHash, pSHACtx->digest, 5);
SHAinit(pSHACtx);
}
void SHA(unsigned char *pbData, unsigned long dwDataLen, unsigned char *pDigest)
{
SHA_Context SHACtx;
SHAinit(&SHACtx);
SHAupdate(&SHACtx, pbData, dwDataLen);
SHAdigest(&SHACtx, (unsigned long*)pDigest);
}
#endif
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -