AppNinja 开发手记2: QQ iOS版 表情加密解密算法

AppNinja 开发手记2:QQ iOS版 表情加密解密算法

学习心得:  遇到有明文有密文的文件数据，需要考虑到分段加解密的情况。

http://blog.csdn.net/a2831942318

Written by AppNinja 开发手记

void tea_encode(int* v, int* k);
void tea_decode(int* v, int* k);

void tea_encode_buffer(char* in_buffer, off_t in_size, int* key, int cipherRemains);
void tea_decode_buffer(char* in_buffer, off_t in_size, int* key, int cipherRemains);

 

#include <sys/types.h>
#include <stddef.h>

#ifdef NPK_DEV
void tea_encode(int* v, int* k)
{
	unsigned int y=v[0],z=v[1], sum=0,   /* set up */
		delta=0x9e3779b9, n=32 ;             /* a key schedule constant */
	while (n-->0) {                       /* basic cycle start */
		sum += delta ;
		y += (z<<4)+k[0] ^ z+sum ^ (z>>5)+k[1] ;
		z += (y<<4)+k[2] ^ y+sum ^ (y>>5)+k[3] ;   /* end cycle */
	}
	v[0]=y ; v[1]=z ;
}

void tea_encode_byte(char* v, int* k, off_t p)
{
	char y[] = "NpK!TeA";
    *v = *v^y[p]^(char)(k[p%4]%0xFF);
}

void tea_encode_buffer(char* in_buffer, off_t in_size, int* key, int cipherRemains)
{
	char *p;
	off_t remain = in_size % 8;
	off_t align_size = in_size - remain;
	for (p = in_buffer; p < in_buffer + align_size; p += 8)
		tea_encode( (int*)p, key);
    if( remain > 0 && cipherRemains )
        for (p = in_buffer + align_size; p < in_buffer + in_size; p += 1)
            tea_encode_byte( p, key, --remain );
}
#endif

void tea_decode(int* v,int* k)
{
	unsigned int n=32, sum, y=v[0], z=v[1],
		delta=0x9e3779b9 ;
	sum=delta<<5 ;
	/* start cycle */
	while (n-->0) {
		z-= (y<<4)+k[2] ^ y+sum ^ (y>>5)+k[3] ;
		y-= (z<<4)+k[0] ^ z+sum ^ (z>>5)+k[1] ;
		sum-=delta ;  }
	/* end cycle */
	v[0]=y ; v[1]=z ;
}

void tea_decode_byte(char* v, int* k, off_t p)
{
	char y[] = "NpK!TeA";
    *v = *v^(char)(k[p%4]%0xFF)^y[p];
}

void tea_decode_buffer(char* in_buffer, off_t in_size, int* key, int cipherRemains)
{
	char *p;
	off_t remain = in_size % 8;
	off_t align_size = in_size - remain;
	for (p = in_buffer; p < in_buffer + align_size; p += 8)
		tea_decode( (int*)p, key);
    if( remain > 0 && cipherRemains )
        for (p = in_buffer + align_size; p < in_buffer + in_size; p += 1)
            tea_decode_byte( p, key, --remain );
}

核心算法:分段异或

	int i = 0;
	int nStep = 0;
	while (i + nStep < nLen)
	{
		if (i < 0x14)
		{
			pszData[nStep + i] = ~(pszData[nStep+i]);
			i++;
		}
		else
		{
			nStep += 0x32;
			i = 0;
		}
	}