MD5和SHA1算法的C++实现和使用


MD5算法:


MD5.H

#ifndef MD5_H
#define MD5_H


typedef struct
{
  unsigned int count[2];
  unsigned int state[4];
  unsigned char buffer[64];
} MD5_CTX;

#define F(x,y,z) ((x & y) | (~x & z))
#define G(x,y,z) ((x & z) | (y & ~z))
#define H(x,y,z) (x^y^z)
#define I(x,y,z) (y ^ (x | ~z))
#define ROTATE_LEFT(x,n) ((x << n) | (x >> (32-n)))

#define FF(a,b,c,d,x,s,ac) \
{ \
  a += F(b,c,d) + x + ac; \
  a = ROTATE_LEFT(a,s); \
  a += b; \
}
#define GG(a,b,c,d,x,s,ac) \
{ \
  a += G(b,c,d) + x + ac; \
  a = ROTATE_LEFT(a,s); \
  a += b; \
}
#define HH(a,b,c,d,x,s,ac) \
{ \
  a += H(b,c,d) + x + ac; \
  a = ROTATE_LEFT(a,s); \
  a += b; \
}
#define II(a,b,c,d,x,s,ac) \
{ \
  a += I(b,c,d) + x + ac; \
  a = ROTATE_LEFT(a,s); \
  a += b; \
}
void MD5Init(MD5_CTX *context);
void MD5Update(MD5_CTX *context, unsigned char *input, unsigned int inputlen);
void MD5Final(MD5_CTX *context, unsigned char digest[16]);
void MD5Transform(unsigned int state[4], unsigned char block[64]);
void MD5Encode(unsigned char *output, unsigned int *input, unsigned int len);
void MD5Decode(unsigned int *output, unsigned char *input, unsigned int len);

#endif


MD5.CPP

#include "md5.h"
#include <memory.h>
#include <stdlib.h>
#include <stdio.h>
#include<fcntl.h>
unsigned char PADDING[] =
{
  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 MD5Init(MD5_CTX *context)
{
  context->count[0] = 0;
  context->count[1] = 0;
  context->state[0] = 0x67452301;
  context->state[1] = 0xEFCDAB89;
  context->state[2] = 0x98BADCFE;
  context->state[3] = 0x10325476;
}

void MD5Update(MD5_CTX *context, unsigned char *input, unsigned int inputlen)
{
  unsigned int i = 0;
  unsigned int index = 0;
  unsigned int partlen = 0;

  index = (context->count[0] >> 3) & 0x3F;
  partlen = 64 - index;
  context->count[0] += inputlen << 3;

  if(context->count[0] < (inputlen << 3))
    context->count[1]++;
  context->count[1] += inputlen >> 29;

  if(inputlen >= partlen)
  {
    memcpy(&context->buffer[index], input,partlen);
    MD5Transform(context->state, context->buffer);

    for(i = partlen; i+64 <= inputlen; i+=64)
      MD5Transform(context->state, &input[i]);

    index = 0;
  }
  else
  {
    i = 0;
  }
  memcpy(&context->buffer[index], &input[i], inputlen-i);
}

void MD5Final(MD5_CTX *context, unsigned char digest[16])
{
  unsigned int index = 0,padlen = 0;
  unsigned char bits[8];

  index = (context->count[0] >> 3) & 0x3F;
  padlen = (index < 56)?(56-index):(120-index);
  MD5Encode(bits, context->count, 8);
  MD5Update(context, PADDING, padlen);
  MD5Update(context, bits, 8);
  MD5Encode(digest, context->state, 16);
}

void MD5Encode(unsigned char *output,unsigned int *input,unsigned int len)
{
  unsigned int i = 0;
  unsigned int j = 0;

  while(j < len)
  {
    output[j] = input[i] & 0xFF;
    output[j+1] = (input[i] >> 8) & 0xFF;
    output[j+2] = (input[i] >> 16) & 0xFF;
    output[j+3] = (input[i] >> 24) & 0xFF;
    i++;
    j += 4;
  }
}

void MD5Decode(unsigned int *output, unsigned char *input, unsigned int len)
{
  unsigned int i = 0;
  unsigned int j = 0;

  while(j < len)
  {
    output[i] = (input[j]) |
      (input[j+1] << 8) |
      (input[j+2] << 16) |
      (input[j+3] << 24);
    i++;
    j += 4;
  }
}

void MD5Transform(unsigned int state[4], unsigned char block[64])
{
  unsigned int a = state[0];
  unsigned int b = state[1];
  unsigned int c = state[2];
  unsigned int d = state[3];
  unsigned int x[64];

  MD5Decode(x,block,64);

  FF(a, b, c, d, x[ 0], 7, 0xd76aa478); /* 1 */
  FF(d, a, b, c, x[ 1], 12, 0xe8c7b756); /* 2 */
  FF(c, d, a, b, x[ 2], 17, 0x242070db); /* 3 */
  FF(b, c, d, a, x[ 3], 22, 0xc1bdceee); /* 4 */
  FF(a, b, c, d, x[ 4], 7, 0xf57c0faf); /* 5 */
  FF(d, a, b, c, x[ 5], 12, 0x4787c62a); /* 6 */
  FF(c, d, a, b, x[ 6], 17, 0xa8304613); /* 7 */
  FF(b, c, d, a, x[ 7], 22, 0xfd469501); /* 8 */
  FF(a, b, c, d, x[ 8], 7, 0x698098d8); /* 9 */
  FF(d, a, b, c, x[ 9], 12, 0x8b44f7af); /* 10 */
  FF(c, d, a, b, x[10], 17, 0xffff5bb1); /* 11 */
  FF(b, c, d, a, x[11], 22, 0x895cd7be); /* 12 */
  FF(a, b, c, d, x[12], 7, 0x6b901122); /* 13 */
  FF(d, a, b, c, x[13], 12, 0xfd987193); /* 14 */
  FF(c, d, a, b, x[14], 17, 0xa679438e); /* 15 */
  FF(b, c, d, a, x[15], 22, 0x49b40821); /* 16 */

  /* Round 2 */
  GG(a, b, c, d, x[ 1], 5, 0xf61e2562); /* 17 */
  GG(d, a, b, c
  • 0
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 3
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值