UUID-C算法实现(3)

2020-05-23 15:39

return md5_str; }

#pragma warning(pop) /* C4996 */

/* MD5 basic transformation. Transforms state based on block. */

static void _MD5Transform(unsigned int state[4], const unsigned char block[64]) {

unsigned int 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. */ memset((void *) x, 0, sizeof (x)); }

/* Encodes input (unsigned int) into output (unsigned char). Assumes len is a multiple of 4. */

static void _Encode(unsigned char *output, unsigned int *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 (unsigned int). Assumes len is a multiple of 4.*/

static void _Decode(unsigned int *output, const unsigned char *input, unsigned int len) {

unsigned int i, j;

for (i = 0, j = 0; j < len; i++, j += 4) {

output[i] = ((unsigned int) input[j]) | (((unsigned int) input[j + 1]) << 8) |

(((unsigned int) input[j + 2]) << 16) | (((unsigned int) input[j + 3]) << 24); } }

uuid32.c文件如下:

/* uuid32.c

2007-09-15 Last created by cheungmine. Partly rights reserved by cheungmine.

*/

#include #include

#include

#include #include

#include \#include \

#define MD5_LEN 16 #define UUID_LEN 36

/* microsecond per second. 1s=1000000us=1000000000ns*/ #define NSec100_Per_Sec 10000000 #define USec_Per_Sec 1000000 #define USec_Per_MSec 1000

#define NSec_Since_1582 ((uint64)(0x01B21DD213814000))

/*======================================================================================== Private Functions

========================================================================================*/ static BOOL isbigendian() {

int c = 1;

return ( *((unsigned char *) &c) == 1 )? FALSE: TRUE; };

static void swap_word( int size_bytes, void * ptr_word ) {

int i;

unsigned char temp;

for( i=0; i < size_bytes/2; i++ ) {

temp = ((unsigned char *) ptr_word)[i];

((unsigned char *) ptr_word)[i] = ((unsigned char *) ptr_word)[size_bytes-i-1];

((unsigned char *) ptr_word)[size_bytes-i-1] = temp;

} };

static void write_word( unsigned char* stream, word_t val ) {

memcpy(stream, &val, 2);

if( isbigendian() ) swap_word( 2, stream ); };

static void write_dword( unsigned char* stream, dword_t val ) {

memcpy(stream, &val, 4);

if( isbigendian() ) swap_word( 4, stream ); };

static void read_word( const unsigned char* stream, word_t* val ) {

memcpy( val, stream, 2 );

if( isbigendian() ) swap_word( 2, val ); };

static void read_dword( const unsigned char* stream, dword_t* val ) {

memcpy( val, stream, 4 );

if( isbigendian() ) swap_word( 4, val ); };

static BOOL is_xdigit(char c) {

/* isxdigit returns a non-zero value if c is a hexadecimal digi

t (A – F, a – f, or 0 – 9). */

return ((c>='A'&&c<='F')||(c>='a'&&c<='f')||(c>='0'&&c<='9'))? TRUE : FALSE; };

/* make a pseudorandom numbel based on current time*/ static int pseudo_rand() {

#ifdef _USE_32BIT_TIME_T assert(0); #endif

struct _timeb timebuf;


UUID-C算法实现(3).doc 将本文的Word文档下载到电脑 下载失败或者文档不完整,请联系客服人员解决!

下一篇:2016年秋西南大学网教[0621]《消费者行为学》作业及参考答案

相关阅读
本类排行
× 注册会员免费下载(下载后可以自由复制和排版)

马上注册会员

注:下载文档有可能“只有目录或者内容不全”等情况,请下载之前注意辨别,如果您已付费且无法下载或内容有问题,请联系我们协助你处理。
微信: QQ: