C语言 MD5源码

这是一个C语言实现的MD5(Message-Digest Algorithm 5)算法库,包括MD5Init、MD5Update、MD5Final等核心函数,用于计算字符串或文件的哈希值。代码中详细定义了MD5变换过程,适用于数据完整性校验和安全存储场景。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

//md5c.h
#ifndef MD5_H
#define MD5_H

#ifdef __cplusplus
extern "C" {
#endif

/* POINTER defines a generic pointer type */
typedef unsigned char * POINTER;

/* UINT2 defines a two byte word */
//typedef unsigned short int UINT2;

/* UINT4 defines a four byte word */
typedef unsigned long int UINT4;


/* MD5 context. */
typedef struct
{
    UINT4 state[4];         /* state (ABCD) */
    UINT4 count[2];  /* number of bits, modulo 2^64 (lsb first) */
    unsigned char buffer[64];       /* input buffer */
} MD5_CTX;

void MD5Init ( MD5_CTX *context );
void MD5Update ( MD5_CTX *context, unsigned char *input, unsigned int inputLen );
void MD5UpdaterString( MD5_CTX *context, const char *str );
int MD5FileUpdateFile ( MD5_CTX *context, char *filename );
void MD5Final ( unsigned char digest[16], MD5_CTX *context );
void MD5String ( char *str, unsigned char digest[16] );
int MD5File ( char *filename, unsigned char digest[16] );
void MD5print( unsigned char digest[16] );

#ifdef __cplusplus
}
#endif

#endif // MD5_H

/* MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
 */

/* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
rights reserved.

License to copy and use this software is granted provided that it
is identified as the "RSA Data Security, Inc. MD5 Message-Digest
Algorithm" in all material mentioning or referencing this software
or this function.

License is also granted to make and use derivative works provided
that such works are identified as "derived from the RSA Data
Security, Inc. MD5 Message-Digest Algorithm" in all material
mentioning or referencing the derived work.

RSA Data Security, Inc. makes no representations concerning either
the merchantability of this software or the suitability of this
software for any particular purpose. It is provided "as is"
without express or implied warranty of any kind.

These notices must be retained in any copies of any part of this
documentation and/or software.
 */
//md5c.c
#include "md5c.h"
#include <string.h>
#include <stdio.h>
#include <stdlib.h>

/* Constants for MD5Transform routine.
*/
#ifdef __cplusplus
extern "C" {
#endif

#define S11 7
#define S12 12
#define S13 17
#define S14 22
#define S21 5
#define S22 9
#define S23 14
#define S24 20
#define S31 4
#define S32 11
#define S33 16
#define S34 23
#define S41 6
#define S42 10
#define S43 15
#define S44 21

static void MD5_memcpy ( POINTER output, POINTER input, unsigned int len );
static void MD5Transform ( UINT4 state[4], unsigned char block[64] );
static void Encode ( unsigned char *output, UINT4 *input, unsigned int len );
static void MD5_memset ( POINTER output, int value, unsigned int len );
static void Decode ( UINT4 *output, unsigned char *input, unsigned int len );

static unsigned char PADDING[64] = {0x80};
//{
//    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
//};

/* F, G, H and I are basic MD5 functions.
*/
#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)))

/* ROTATE_LEFT rotates x left n bits.
*/
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))

/* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
Rotation is separate from addition to prevent recomputation.
*/
#define FF(a, b, c, d, x, s, ac) { \
 (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
 (a) = ROTATE_LEFT ((a), (s)); \
 (a) += (b); \
 }
#define GG(a, b, c, d, x, s, ac) { \
 (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
 (a) = ROTATE_LEFT ((a), (s)); \
 (a) += (b); \
 }
#define HH(a, b, c, d, x, s, ac) { \
 (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
 (a) = ROTATE_LEFT ((a), (s)); \
 (a) += (b); \
 }
#define II(a, b, c, d, x, s, ac) { \
 (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
 (a) = ROTATE_LEFT ((a), (s)); \
 (a) += (b); \
 }

/* MD5 initialization. Begins an MD5 operation, writing a new context.
 */
void MD5Init ( MD5_CTX *context )        /* context */
{
    context->count[0] = context->count[1] = 0;
    /* Load magic initialization constants.
    */
    context->state[0] = 0x67452301;
    context->state[1] = 0xefcdab89;
    context->state[2] = 0x98badcfe;
    context->state[3] = 0x10325476;
}

/* MD5 block update operation. Continues an MD5 message-digest
 operation, processing another message block, and updating the
 context.
 */
void MD5Update ( MD5_CTX *context, unsigned char *input, unsigned int inputLen )

{
    unsigned int i, index, partLen;

    /* Compute number of bytes mod 64 */
    index = ( unsigned int )( ( context->count[0] >> 3 ) & 0x3F );

    /* Update number of bits */
    if ( ( context->count[0] += ( ( UINT4 )inputLen << 3 ) )
            < ( ( UINT4 )inputLen << 3 ) )
        context->count[1]++;
    context->count[1] += ( ( UINT4 )inputLen >> 29 );

    partLen = 64 - index;

    /* Transform as many times as possible.
    */
    if ( inputLen >= partLen )
    {
        MD5_memcpy( ( POINTER )&context->buffer[index], ( POINTER )input, partLen );
        MD5Transform ( context->state, context->buffer );

        for ( i = partLen; i + 63 < inputLen; i += 64 )
            MD5Transform ( context->state, &input[i] );

        index = 0;
    }
    else
        i = 0;

    /* Buffer remaining input */
    MD5_memcpy( ( POINTER )&context->buffer[index], ( POINTER )&input[i], inputLen - i );
}

/* MD5 finalization. Ends an MD5 message-digest operation, writing the
 the message digest and zeroizing the context.
 */
void MD5Final ( unsigned char digest[16], MD5_CTX *context )
{
    unsigned char bits[8];
    unsigned int index, padLen;

    /* Save number of bits */
    Encode ( bits, context->count, 8 );

    /* Pad out to 56 mod 64.
    */
    index = ( unsigned int )( ( context->count[0] >> 3 ) & 0x3f );
    padLen = ( index < 56 ) ? ( 56 - index ) : ( 120 - index );
    MD5Update ( context, PADDING, padLen );

    /* Append length (before padding) */
    MD5Update ( context, bits, 8 );

    /* Store state in digest */
    Encode ( digest, context->state, 16 );

    /* Zeroize sensitive information.
    */
    MD5_memset ( ( POINTER )context, 0, sizeof ( *context ) );
}

/* MD5 basic transformation. Transforms state based on block.
 */
static void MD5Transform ( UINT4 state[4], unsigned char block[64] )
{
    UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];

    Decode ( x, block, 64 );

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

    /* Round 2 */
    GG ( a, b, c, d, x[ 1], S21, 0xf61e2562 ); /* 17 */
    GG ( d, a, b, c, x[ 6], S22, 0xc040b340 ); /* 18 */
    GG ( c, d, a, b, x[11], S23, 0x265e5a51 ); /* 19 */
    GG ( b, c, d, a, x[ 0], S24, 0xe9b6c7aa ); /* 20 */
    GG ( a, b, c, d, x[ 5], S21, 0xd62f105d ); /* 21 */
    GG ( d, a, b, c, x[10], S22, 0x2441453 ); /* 22 */
    GG ( c, d, a, b, x[15], S23, 0xd8a1e681 ); /* 23 */
    GG ( b, c, d, a, x[ 4], S24, 0xe7d3fbc8 ); /* 24 */
    GG ( a, b, c, d, x[ 9], S21, 0x21e1cde6 ); /* 25 */
    GG ( d, a, b, c, x[14], S22, 0xc33707d6 ); /* 26 */
    GG ( c, d, a, b, x[ 3], S23, 0xf4d50d87 ); /* 27 */
    GG ( b, c, d, a, x[ 8], S24, 0x455a14ed ); /* 28 */
    GG ( a, b, c, d, x[13], S21, 0xa9e3e905 ); /* 29 */
    GG ( d, a, b, c, x[ 2], S22, 0xfcefa3f8 ); /* 30 */
    GG ( c, d, a, b, x[ 7], S23, 0x676f02d9 ); /* 31 */
    GG ( b, c, d, a, x[12], S24, 0x8d2a4c8a ); /* 32 */

    /* Round 3 */
    HH ( a, b, c, d, x[ 5], S31, 0xfffa3942 ); /* 33 */
    HH ( d, a, b, c, x[ 8], S32, 0x8771f681 ); /* 34 */
    HH ( c, d, a, b, x[11], S33, 0x6d9d6122 ); /* 35 */
    HH ( b, c, d, a, x[14], S34, 0xfde5380c ); /* 36 */
    HH ( a, b, c, d, x[ 1], S31, 0xa4beea44 ); /* 37 */
    HH ( d, a, b, c, x[ 4], S32, 0x4bdecfa9 ); /* 38 */
    HH ( c, d, a, b, x[ 7], S33, 0xf6bb4b60 ); /* 39 */
    HH ( b, c, d, a, x[10], S34, 0xbebfbc70 ); /* 40 */
    HH ( a, b, c, d, x[13], S31, 0x289b7ec6 ); /* 41 */
    HH ( d, a, b, c, x[ 0], S32, 0xeaa127fa ); /* 42 */
    HH ( c, d, a, b, x[ 3], S33, 0xd4ef3085 ); /* 43 */
    HH ( b, c, d, a, x[ 6], S34, 0x4881d05 ); /* 44 */
    HH ( a, b, c, d, x[ 9], S31, 0xd9d4d039 ); /* 45 */
    HH ( d, a, b, c, x[12], S32, 0xe6db99e5 ); /* 46 */
    HH ( c, d, a, b, x[15], S33, 0x1fa27cf8 ); /* 47 */
    HH ( b, c, d, a, x[ 2], S34, 0xc4ac5665 ); /* 48 */

    /* Round 4 */
    II ( a, b, c, d, x[ 0], S41, 0xf4292244 ); /* 49 */
    II ( d, a, b, c, x[ 7], S42, 0x432aff97 ); /* 50 */
    II ( c, d, a, b, x[14], S43, 0xab9423a7 ); /* 51 */
    II ( b, c, d, a, x[ 5], S44, 0xfc93a039 ); /* 52 */
    II ( a, b, c, d, x[12], S41, 0x655b59c3 ); /* 53 */
    II ( d, a, b, c, x[ 3], S42, 0x8f0ccc92 ); /* 54 */
    II ( c, d, a, b, x[10], S43, 0xffeff47d ); /* 55 */
    II ( b, c, d, a, x[ 1], S44, 0x85845dd1 ); /* 56 */
    II ( a, b, c, d, x[ 8], S41, 0x6fa87e4f ); /* 57 */
    II ( d, a, b, c, x[15], S42, 0xfe2ce6e0 ); /* 58 */
    II ( c, d, a, b, x[ 6], S43, 0xa3014314 ); /* 59 */
    II ( b, c, d, a, x[13], S44, 0x4e0811a1 ); /* 60 */
    II ( a, b, c, d, x[ 4], S41, 0xf7537e82 ); /* 61 */
    II ( d, a, b, c, x[11], S42, 0xbd3af235 ); /* 62 */
    II ( c, d, a, b, x[ 2], S43, 0x2ad7d2bb ); /* 63 */
    II ( b, c, d, a, x[ 9], S44, 0xeb86d391 ); /* 64 */

    state[0] += a;
    state[1] += b;
    state[2] += c;
    state[3] += d;

    /* Zeroize sensitive information.
    */
    MD5_memset ( ( POINTER )x, 0, sizeof ( x ) );
}

/* Encodes input (UINT4) into output (unsigned char). Assumes len is
 a multiple of 4.
 */
static void Encode ( unsigned char *output, UINT4 *input, unsigned int len )
{
    unsigned int i, j;

    for ( i = 0, j = 0; j < len; i++, j += 4 )
    {
        output[j] = ( unsigned char )( input[i] & 0xff );
        output[j + 1] = ( unsigned char )( ( input[i] >> 8 ) & 0xff );
        output[j + 2] = ( unsigned char )( ( input[i] >> 16 ) & 0xff );
        output[j + 3] = ( unsigned char )( ( input[i] >> 24 ) & 0xff );
    }
}

/* Decodes input (unsigned char) into output (UINT4). Assumes len is
 a multiple of 4.
 */
static void Decode ( UINT4 *output, unsigned char *input, unsigned int len )
{
    unsigned int i, j;

    for ( i = 0, j = 0; j < len; i++, j += 4 )
        output[i] = ( ( UINT4 )input[j] ) | ( ( ( UINT4 )input[j + 1] ) << 8 ) |
                    ( ( ( UINT4 )input[j + 2] ) << 16 ) | ( ( ( UINT4 )input[j + 3] ) << 24 );
}

/* Note: Replace "for loop" with standard memcpy if possible.
 */

static void MD5_memcpy ( POINTER output, POINTER input, unsigned int len )
{
    unsigned int i;

    for ( i = 0; i < len; i++ )
        output[i] = input[i];
}

/* Note: Replace "for loop" with standard memset if possible.
 */
static void MD5_memset ( POINTER output, int value, unsigned int len )
{
    unsigned int i;

    for ( i = 0; i < len; i++ )
        ( ( char * )output )[i] = ( char )value;
}
/* Digests a string and prints the result.
 */
void MD5String ( char *str, unsigned char digest[16] )
{
    MD5_CTX context;
    unsigned int len = strlen ( str );

    MD5Init ( &context );
    MD5Update ( &context, ( unsigned char * )str, len );
    MD5Final ( digest, &context );
}
/* Digests a file and prints the result.
 */
int MD5File ( char *filename, unsigned char digest[16] )
{
    FILE *file;
    MD5_CTX context;
    int len;
    unsigned char buffer[1024];

    if ( ( file = fopen ( filename, "rb" ) ) == NULL )
        return -1;
    else
    {
        MD5Init ( &context );
        while ( len = fread ( buffer, 1, 1024, file ) )
            MD5Update ( &context, buffer, len );
        MD5Final ( digest, &context );

        fclose ( file );
    }
    return 0;
}
void MD5UpdaterString( MD5_CTX *context, const char *str )
{
    unsigned int len = strlen ( str );
    MD5Update ( context, ( unsigned char * )str, len );
}
int MD5FileUpdateFile ( MD5_CTX *context, char *filename )
{
    FILE *file;
    int len;
    unsigned char buffer[1024];

    if ( ( file = fopen ( filename, "rb" ) ) == NULL )
        return -1;
    else
    {
        while ( len = fread ( buffer, 1, 1024, file ) )
            MD5Update ( context, buffer, len );
        fclose ( file );
    }
    return 0;
}

void MD5print( unsigned char digest[16] )
{
    char* result = ( char* )calloc( 33, sizeof( char ) );
    int j = 0;
    for( int i = 0; i < 16; i++ )
    {
        sprintf( result + j, "%02X", digest[i] );
        j += 2;
    }
    puts( result );
    free( result );
}

#ifdef __cplusplus
}
#endif

#include "md5c.h"
#include "md5c.c"
#include <stdlib.h>

int main()
{
    unsigned char digest[16]; //存放结果

    //第一种用法:

    MD5_CTX md5c;
    MD5Init( &md5c ); //初始化
//    MD5UpdaterString( &md5c, "你要测试的字符串" );
    MD5FileUpdateFile( &md5c, "D:\\测试文件.exe" );
    MD5Final( digest, &md5c );
    MD5print(digest);


    //第二种用法:
    MD5String( "你要测试的字符串", digest ); //直接输入字符串并得出结果
    MD5print(digest);
//第三种用法:
    MD5File( "D:\\测试文件.exe", digest ); //直接输入文件路径并得出结果
    MD5print(digest);

    return 0;
}

MD5的全称是Message-digest Algorithm 5(信息-摘要算法),用于确保信息传输完整一致。在90年代初由MIT Laboratory for Computer Science和RSA Data Security Inc,的Ronald L. Rivest开发出来,经MD2、MD3和MD4发展而来。它的作用是让大容量信息在用数字签名软件签署私人密钥前被"压缩"成一种保密的格式(就是把一个任意长度的字节串变换成一定长的大整数)。不管是MD2、MD4还是MD5,它们都需要获得一个随机长度的信息并产生一个128位的信息摘要。虽然这些算法的结构或多或少有些相似,但MD2的设计与MD4和MD5完全不同,那是因为MD2是为8位机器做过设计优化的,而MD4和MD5却是面向32位的电脑。这三个算法的描述和c语言源代码在Internet RFC 1321中有详细的描述(http://www.ietf.org/rfc/rfc1321.txt),这是一份最权威的文档,由Ronald L. Rivest在1992年8月向IETF提交。   MD5最广泛被用于各种软件的密码认证和钥匙识别上。通俗的讲就是人们讲的序列号,   Rivest在1989年开发MD2算法。在这个算法中,首先对信息进行数据补位,使信息的字节长度是16的倍数。然后,以一个16位的检验和追加到信息末尾。并且根据这个新产生的信息计算出散列值。后来,Rogier和Chauvaud发现如果忽略了检验和将产生MD2冲突。MD2算法的加密后结果是唯一的--即没有重复。   为了加强算法的安全性,Rivest在1990年又开发MD4算法。MD4算法同样需要填补信息以确保信息的字节长度加上448后能被512整除(信息字节长度mod 512 = 448)。然后,一个以64位二进制表示的信息的最初长度被添加进来。信息被处理成512位damg?rd/merkle迭代结构的区块,而且每个区块要通过三个不同步骤的处理。Den boer和Bosselaers以及其他人很快的发现了攻击MD4版本中第一步和第三步的漏洞。Dobbertin向大家演示了如何利用一部普通的个人电脑在几分钟内找到MD4完整版本中的冲突(这个冲突实际上是一种漏洞,它将导致对不同的内容进行加密却可能得到相同的加密后结果)。毫无疑问,MD4就此被淘汰掉了。   尽管MD4算法在安全上有个这么大的漏洞,但它对在其后才被开发出来的好几种信息安全加密算法的出现却有着不可忽视的引导作用。除了MD5以外,其中比较有名的还有sha-1、RIPEMD以及Haval等。   一年以后,即1991年,Rivest开发出技术上更为趋近成熟的md5算法。它在MD4的基础上增加了"安全-带子"(safety-belts)的概念。虽然MD5MD4稍微慢一些,但却更为安全。这个算法很明显的由四个和MD4设计有少许不同的步骤组成。在MD5算法中,信息-摘要的大小和填充的必要条件与MD5完全相同。Den boer和Bosselaers曾发现MD5算法中的假冲突(pseudo-collisions),但除此之外就没有其他被发现的加密后结果了。   Van oorschot和Wiener曾经考虑过一个在散列中暴力搜寻冲突的函数(brute-force hash function),而且他们猜测一个被设计专门用来搜索MD5冲突的机器(这台机器在1994年的制造成本大约是一百万美元)可以平均每24天就找到一个冲突。但单从1991年到2001年这10年间,竟没有出现替代MD5算法的MD6或被叫做其他什么名字的新算法这一点,我们就可以看出这个瑕疵并没有太多的影响MD5的安全性。上面所有这些都不足以成为MD5的在实际应用中的问题。并且,由于MD5算法的使用不需要支付任何版权费用的,所以在一般的情况下(非绝密应用领域。但即便是应用在绝密领域内,MD5也不失为一种非常优秀的中间技术),MD5怎么都应该算得上是非常安全的了。   2004年8月17日的美国加州圣巴巴拉的国际密码学会议(Crypto’2004)上,来自中国山东大学的王小云教授做了破译MD5、HAVAL-128、 MD4和RIPEMD算法的报告,公布了MD系列算法的破解结果。宣告了固若金汤的世界通行密码标准MD5的堡垒轰然倒塌,引发了密码学界的轩然大波。   令世界顶尖密码学家想象不到的是,破解MD5之后,2005年2月,王小云教授又破解了另一国际密码SHA-1。因为SHA-1在美国等国际社会有更加广泛的应用,密码被破的消息一出,在国际社会的反响可谓石破天惊。换句话说,王小云的研究成果表明了从理论上讲电子签名可以伪造,必须及时添加限制条件,或者重新选用更为安全的密码标准,以保证电子商务的安全。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值