⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 hash.cpp

📁 这是用于取证中完整性检测的工具
💻 CPP
字号:
#include <string>
#include<iostream>
#include<fstream>
#include<math.h>
#include <stdio.h>
#include "md5base.h"
using namespace std;
int main()
{
char mn[100][100],mn1[20][20][20];
char data[1000],data_md5[1000],q;
string data_re_row[100],data_re_col[100];//平方根矩阵重组数据行列
string data_row_hei[20][20],data_col_hei[20][20],data_hei_row[20][20];//立方根平面二维数组
string data_re1_row[20],data_re1_col[20],data_re1_hei[20];//立方根矩阵重组数据行列高
int p=0,p1=0;//计数器
cout<<"请输入要计算的数据:";
cin>>data;
int l=strlen(data);
cout<<"数据共"<<l<<"块"<<endl;
/*****************************************平方根********************************************/
int m=ceil(sqrt(l));//m阶平方根矩阵
cout<<"************************************************"<<endl;
cout<<"则"<<m<<"阶平方根矩阵为:"<<endl;
for(int i=0;i<m;i++)
{ 
	for(int j=0;j<m;j++)
	{
mn[i][j]=data[p];
if(p<l) p++;
	}
}

for( i=0;i<m;i++)
{ 
	for(int j=0;j<m;j++)
	{
cout<<mn[i][j];
	}
	cout<<endl;
}
cout<<"*******************"<<endl;
cout<<"矩阵数据分块及相应Hash值分别为:"<<endl;
for( i=0;i<m;i++)
{
	for(int j=0;j<m;j++)
	{
if(mn[i][j]!='\0')
data_re_row[i]+=mn[i][j];
	}
if(data_re_row[i]!="")
{
cout<<data_re_row[i]<<"   ";
md5calc(data_re_row[i].data(), data_md5);
cout<<"H"<<i+1<<"="<<data_md5<<endl;
}
}
cout<<endl;
for(int j=0;j<m;j++)
{
	for(int i=0;i<m;i++)
	{
		if(mn[i][j]!='\0')
			data_re_col[j]+=mn[i][j];
	}
if(data_re_col[j]!="")
{
cout<<data_re_col[j]<<"   ";
md5calc(data_re_col[j].data(), data_md5);
cout<<"H'"<<j+1<<"="<<data_md5<<endl;
}
}
cout<<"************************************************"<<endl;
/*****************************************立方根********************************************/
int n=ceil(pow(l,1.0/3.0));//n阶立方根矩阵
cout<<"则"<<n<<"阶立方根矩阵为:"<<endl;
for(int k=0;k<n;k++)
{
for( i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
mn1[i][j][k]=data[p1];
if(p1<l) p1++;
}
}
}



for( k=0;k<n;k++)
{
for(i=0;i<n;i++)
{
for( j=0;j<n;j++)
{
cout<<mn1[i][j][k];
}
cout<<endl;
}
cout<<endl;
}

cout<<"*******************"<<endl;
cout<<"矩阵数据分块及相应Hash值分别为:"<<endl;

for(i=0;i<n;i++)
{
	for(k=0;k<n;k++)
	{
		for(j=0;j<n;j++)
		{
if(mn1[i][j][k]!='\0')
data_row_hei[i][k]+=mn1[i][j][k];
		}
if(data_row_hei[i][k]!="")
data_re1_row[i]+=data_row_hei[i][k];
	}

if(data_re1_row[i]!="")
{
cout<<data_re1_row[i]<<"   ";
md5calc(data_re1_row[i].data(), data_md5);
cout<<"H"<<i+1<<"="<<data_md5<<endl;
}	
}
cout<<endl;
for(j=0;j<n;j++)
{
	for(k=0;k<n;k++)
	{
     for(i=0;i<n;i++)
	 {
  if(mn1[i][j][k]!='\0')
data_col_hei[j][k]+=mn1[i][j][k];
		}
if(data_col_hei[j][k]!="")
data_re1_col[j]+=data_col_hei[j][k];
	}
if(data_re1_col[j]!="")
{
cout<<data_re1_col[j]<<"   ";
md5calc(data_re1_col[j].data(), data_md5);
cout<<"H'"<<j+1<<"="<<data_md5<<endl;
}	
}
cout<<endl;
for(k=0;k<n;k++)
{
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{        
if(mn1[i][j][k]!='\0')
data_hei_row[k][i]+=mn1[i][j][k];
		}
if(data_hei_row[k][i]!="")
data_re1_hei[k]+=data_hei_row[k][i];
	}
if(data_re1_hei[k]!="")
{
cout<<data_re1_hei[k]<<"   ";
md5calc(data_re1_hei[k].data(), data_md5);
cout<<"H''"<<k+1<<"="<<data_md5<<endl;
}	
}
cout<<"************************************************"<<endl;
cout<<"按q退出:"<<endl;
while(q!='q')
{
	cin>>q;
}

	return 0;
}


#define GET_UINT32(n,b,i)                       \
{                                               \
    (n) = ( (uint32) (b)[(i)    ]       )       \
        | ( (uint32) (b)[(i) + 1] <<  8 )       \
        | ( (uint32) (b)[(i) + 2] << 16 )       \
        | ( (uint32) (b)[(i) + 3] << 24 );      \
}

#define PUT_UINT32(n,b,i)                       \
{                                               \
    (b)[(i)    ] = (uint8) ( (n)       );       \
    (b)[(i) + 1] = (uint8) ( (n) >>  8 );       \
    (b)[(i) + 2] = (uint8) ( (n) >> 16 );       \
    (b)[(i) + 3] = (uint8) ( (n) >> 24 );       \
}

#ifdef _USRDLL
#include <windows.h>
BOOL APIENTRY DllMain( HANDLE hModule, 
                       DWORD  ul_reason_for_call, 
                       LPVOID lpReserved
					 )
{
    return TRUE;
}
#endif

void md5_starts( md5_context *ctx )
{
    ctx->total[0] = 0;
    ctx->total[1] = 0;

    ctx->state[0] = 0x67452301;
    ctx->state[1] = 0xEFCDAB89;
    ctx->state[2] = 0x98BADCFE;
    ctx->state[3] = 0x10325476;
}

void md5_process( md5_context *ctx, uint8 data[64] )
{
    uint32 X[16], A, B, C, D;

    GET_UINT32( X[0],  data,  0 );
    GET_UINT32( X[1],  data,  4 );
    GET_UINT32( X[2],  data,  8 );
    GET_UINT32( X[3],  data, 12 );
    GET_UINT32( X[4],  data, 16 );
    GET_UINT32( X[5],  data, 20 );
    GET_UINT32( X[6],  data, 24 );
    GET_UINT32( X[7],  data, 28 );
    GET_UINT32( X[8],  data, 32 );
    GET_UINT32( X[9],  data, 36 );
    GET_UINT32( X[10], data, 40 );
    GET_UINT32( X[11], data, 44 );
    GET_UINT32( X[12], data, 48 );
    GET_UINT32( X[13], data, 52 );
    GET_UINT32( X[14], data, 56 );
    GET_UINT32( X[15], data, 60 );

#define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))

#define P(a,b,c,d,k,s,t)                                \
{                                                       \
    a += F(b,c,d) + X[k] + t; a = S(a,s) + b;           \
}

    A = ctx->state[0];
    B = ctx->state[1];
    C = ctx->state[2];
    D = ctx->state[3];

#define F(x,y,z) (z ^ (x & (y ^ z)))

    P( A, B, C, D,  0,  7, 0xD76AA478 );
    P( D, A, B, C,  1, 12, 0xE8C7B756 );
    P( C, D, A, B,  2, 17, 0x242070DB );
    P( B, C, D, A,  3, 22, 0xC1BDCEEE );
    P( A, B, C, D,  4,  7, 0xF57C0FAF );
    P( D, A, B, C,  5, 12, 0x4787C62A );
    P( C, D, A, B,  6, 17, 0xA8304613 );
    P( B, C, D, A,  7, 22, 0xFD469501 );
    P( A, B, C, D,  8,  7, 0x698098D8 );
    P( D, A, B, C,  9, 12, 0x8B44F7AF );
    P( C, D, A, B, 10, 17, 0xFFFF5BB1 );
    P( B, C, D, A, 11, 22, 0x895CD7BE );
    P( A, B, C, D, 12,  7, 0x6B901122 );
    P( D, A, B, C, 13, 12, 0xFD987193 );
    P( C, D, A, B, 14, 17, 0xA679438E );
    P( B, C, D, A, 15, 22, 0x49B40821 );

#undef F

#define F(x,y,z) (y ^ (z & (x ^ y)))

    P( A, B, C, D,  1,  5, 0xF61E2562 );
    P( D, A, B, C,  6,  9, 0xC040B340 );
    P( C, D, A, B, 11, 14, 0x265E5A51 );
    P( B, C, D, A,  0, 20, 0xE9B6C7AA );
    P( A, B, C, D,  5,  5, 0xD62F105D );
    P( D, A, B, C, 10,  9, 0x02441453 );
    P( C, D, A, B, 15, 14, 0xD8A1E681 );
    P( B, C, D, A,  4, 20, 0xE7D3FBC8 );
    P( A, B, C, D,  9,  5, 0x21E1CDE6 );
    P( D, A, B, C, 14,  9, 0xC33707D6 );
    P( C, D, A, B,  3, 14, 0xF4D50D87 );
    P( B, C, D, A,  8, 20, 0x455A14ED );
    P( A, B, C, D, 13,  5, 0xA9E3E905 );
    P( D, A, B, C,  2,  9, 0xFCEFA3F8 );
    P( C, D, A, B,  7, 14, 0x676F02D9 );
    P( B, C, D, A, 12, 20, 0x8D2A4C8A );

#undef F
    
#define F(x,y,z) (x ^ y ^ z)

    P( A, B, C, D,  5,  4, 0xFFFA3942 );
    P( D, A, B, C,  8, 11, 0x8771F681 );
    P( C, D, A, B, 11, 16, 0x6D9D6122 );
    P( B, C, D, A, 14, 23, 0xFDE5380C );
    P( A, B, C, D,  1,  4, 0xA4BEEA44 );
    P( D, A, B, C,  4, 11, 0x4BDECFA9 );
    P( C, D, A, B,  7, 16, 0xF6BB4B60 );
    P( B, C, D, A, 10, 23, 0xBEBFBC70 );
    P( A, B, C, D, 13,  4, 0x289B7EC6 );
    P( D, A, B, C,  0, 11, 0xEAA127FA );
    P( C, D, A, B,  3, 16, 0xD4EF3085 );
    P( B, C, D, A,  6, 23, 0x04881D05 );
    P( A, B, C, D,  9,  4, 0xD9D4D039 );
    P( D, A, B, C, 12, 11, 0xE6DB99E5 );
    P( C, D, A, B, 15, 16, 0x1FA27CF8 );
    P( B, C, D, A,  2, 23, 0xC4AC5665 );

#undef F

#define F(x,y,z) (y ^ (x | ~z))

    P( A, B, C, D,  0,  6, 0xF4292244 );
    P( D, A, B, C,  7, 10, 0x432AFF97 );
    P( C, D, A, B, 14, 15, 0xAB9423A7 );
    P( B, C, D, A,  5, 21, 0xFC93A039 );
    P( A, B, C, D, 12,  6, 0x655B59C3 );
    P( D, A, B, C,  3, 10, 0x8F0CCC92 );
    P( C, D, A, B, 10, 15, 0xFFEFF47D );
    P( B, C, D, A,  1, 21, 0x85845DD1 );
    P( A, B, C, D,  8,  6, 0x6FA87E4F );
    P( D, A, B, C, 15, 10, 0xFE2CE6E0 );
    P( C, D, A, B,  6, 15, 0xA3014314 );
    P( B, C, D, A, 13, 21, 0x4E0811A1 );
    P( A, B, C, D,  4,  6, 0xF7537E82 );
    P( D, A, B, C, 11, 10, 0xBD3AF235 );
    P( C, D, A, B,  2, 15, 0x2AD7D2BB );
    P( B, C, D, A,  9, 21, 0xEB86D391 );

#undef F

    ctx->state[0] += A;
    ctx->state[1] += B;
    ctx->state[2] += C;
    ctx->state[3] += D;
}

void md5_update( md5_context *ctx, uint8 *input, uint32 length )
{
    uint32 left, fill;

    if( ! length ) return;

    left = ctx->total[0] & 0x3F;
    fill = 64 - left;

    ctx->total[0] += length;
    ctx->total[0] &= 0xFFFFFFFF;

    if( ctx->total[0] < length )
        ctx->total[1]++;

    if( left && length >= fill )
    {
        memcpy( (void *) (ctx->buffer + left),
                (void *) input, fill );
        md5_process( ctx, ctx->buffer );
        length -= fill;
        input  += fill;
        left = 0;
    }

    while( length >= 64 )
    {
        md5_process( ctx, input );
        length -= 64;
        input  += 64;
    }

    if( length )
    {
        memcpy( (void *) (ctx->buffer + left),
                (void *) input, length );
    }
}

static uint8 md5_padding[64] =
{
 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};

void md5_finish( md5_context *ctx, uint8 digest[16] )
{
    uint32 last, padn;
    uint32 high, low;
    uint8 msglen[8];

    high = ( ctx->total[0] >> 29 )
         | ( ctx->total[1] <<  3 );
    low  = ( ctx->total[0] <<  3 );

    PUT_UINT32( low,  msglen, 0 );
    PUT_UINT32( high, msglen, 4 );

    last = ctx->total[0] & 0x3F;
    padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );

    md5_update( ctx, md5_padding, padn );
    md5_update( ctx, msglen, 8 );

    PUT_UINT32( ctx->state[0], digest,  0 );
    PUT_UINT32( ctx->state[1], digest,  4 );
    PUT_UINT32( ctx->state[2], digest,  8 );
    PUT_UINT32( ctx->state[3], digest, 12 );
}

void md5calc(const char* szSrc, char* szDest)
{
    md5_context ctx;
    unsigned char md5sum[16];

    md5_starts( &ctx );

    md5_update(&ctx, (unsigned char*)szSrc, strlen(szSrc));

    md5_finish( &ctx, md5sum );

	for (int i = 0; i < 16; i++)
		sprintf(szDest + i*2, "%02x", md5sum[i]);
	
	szDest[32] = '\0';
}


⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -