C-language MD5 main program

Source: Internet
Author: User
Tags include md5
Program #include <stdio.h>
#include <stdlib.h>
#include <memory.h>
#include <time.h>
#include <errno.h>
#include <string.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netdb.h>
#include ". /md5/md5.h "

#define T1 0xd76aa478
#define T2 0xe8c7b756
#define T3 0x242070db
#define T4 0xc1bdceee
#define T5 0XF57C0FAF
#define T6 0x4787c62a
#define T7 0xa8304613
#define T8 0xfd469501
#define T9 0x698098d8
#define T10 0X8B44F7AF
#define T11 0XFFFF5BB1
#define T12 0x895cd7be
#define T13 0x6b901122
#define T14 0xfd987193
#define T15 0xa679438e
#define T16 0x49b40821
#define T17 0xf61e2562
#define T18 0xc040b340
#define T19 0x265e5a51
#define T20 0XE9B6C7AA
#define T21 0xd62f105d
#define T22 0x02441453
#define T23 0xd8a1e681
#define T24 0xe7d3fbc8
#define T25 0x21e1cde6
#define T26 0xc33707d6
#define T27 0xf4d50d87
#define T28 0x455a14ed
#define T29 0xa9e3e905
#define T30 0xfcefa3f8
#define T31 0X676F02D9
#define T32 0x8d2a4c8a
#define T33 0xfffa3942
#define T34 0x8771f681
#define T35 0x6d9d6122
#define T36 0xfde5380c
#define T37 0xa4beea44
#define T38 0X4BDECFA9
#define T39 0xf6bb4b60
#define T40 0xbebfbc70
#define T41 0X289B7EC6
#define T42 0XEAA127FA
#define T43 0xd4ef3085
#define T44 0X04881D05
#define T45 0xd9d4d039
#define T46 0xe6db99e5
#define T47 0x1fa27cf8
#define T48 0xc4ac5665
#define T49 0xf4292244
#define T50 0X432AFF97
#define T51 0XAB9423A7
#define T52 0xfc93a039
#define T53 0X655B59C3
#define T54 0x8f0ccc92
#define T55 0xffeff47d
#define T56 0X85845DD1
#define T57 0x6fa87e4f
#define T58 0XFE2CE6E0
#define T59 0xa3014314
#define T60 0X4E0811A1
#define T61 0xf7537e82
#define T62 0xbd3af235
#define T63 0X2AD7D2BB
#define T64 0xeb86d391

static void Md5_process (md5_state_t *pms, const md5_byte_t *data/*[64]*/)
{
md5_word_t
A = Pms->abcd[0], B = pms->abcd[1],
c = pms->abcd[2], d = pms->abcd[3];
md5_word_t T;

#ifndef Arch_is_big_endian
# define Arch_is_big_endian 1/* Slower, default implementation * *
#endif
#if Arch_is_big_endian

/*
* On Big-endian machines, we must arrange the "bytes in" right
* Order. (This also works on machines of unknown byte.)
*/
md5_word_t x[16];
Const md5_byte_t *XP = data;
int i;

for (i = 0; i < ++i, XP + + 4)
X[i] = xp[0] + (Xp[1] << 8) + (Xp[2] <<) + (Xp[3] << 24);

#else/*! Arch_is_big_endian *

/*
* On Little-endian machines, we can process properly aligned data
* Without copying it.
*/
md5_word_t xbuf[16];
Const md5_word_t *X;

if (!) ( (Data-(const md5_byte_t *) 0) & 3)) {
/* data are properly aligned * *
X = (const md5_word_t *) data;
} else {
* Not aligned * *
memcpy (XBUF, data, 64);
X = Xbuf;
}
#endif

#define ROTATE_LEFT (x, N) (((x) << (n)) | ((x) >> (C-(n)))

/* Round 1. */
* Let [ABCD K s i] denote the operation
A = B + ((A + F (b,c,d) + x[k] + t[i]) <<< s). */
#define F (x, Y, Z) (((x) & (y)) | (~ (x) & (z))
#define SET (A, B, C, D, K, S, Ti) \
t = a + F (b,c,d) + x[k] + ti;\
A = Rotate_left (t, s) + b
/* Do the following operations. */
SET (A, B, C, D, 0, 7, &n



Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.