求s60 2nd上MD5实现(MD5.cpp以及MD5.h)

Paip_Ceser 2008-03-31 03:59:33
这两天看了MD5算法,本来想自己移植的,水平不够,感觉很烦。
有没有高手有现成的分享一下,或好心移植一下,好用立即给分。先谢过了
...全文
251 12 打赏 收藏 转发到动态 举报
写回复
用AI写文章
12 条回复
切换为时间正序
请发表友善的回复…
发表回复
Paip_Ceser 2008-04-01
  • 打赏
  • 举报
回复
To yyc520:
看见的话,发我一份,谢谢了
lspo816 2008-04-01
  • 打赏
  • 举报
回复
自己用的 :), ps:dyw的方法可行,不过hash.lib不算是public sdk
lspo816 2008-04-01
  • 打赏
  • 举报
回复

void CDTMd5::Decode(TUint32 *output, TUint8 *input,TUint len)
{
TUint i, j;

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


/* MD5 initialization. Begins an MD5 operation, writing a new context. */
void CDTMd5::MD5Init (MD5_CTX *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 CDTMd5::MD5Update(MD5_CTX *context,TUint8 * input,TUint inputLen)
{
TUint i, index, partLen;

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

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

/* Transform as many times as possible.*/
if(inputLen >= partLen)
{
R_memcpy((TUint8*)&context->buffer[index], (TUint8*)input, partLen);
MD5Transform(context->state, context->buffer);
for(i = partLen; i + 63 < inputLen; i += 64)/*把i+63<inputlen改为i+64<=inputlen更容易理解*/
MD5Transform(context->state, &input[i]);

index = 0;
}
else
i = 0;
R_memcpy((TUint8*)&context->buffer[index], (TUint8*)&input[i], inputLen-i);
}

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

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

/* Pad out to 56 mod 64. */
index = (TUint)((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. */
R_memset((TUint8*)context, 0, sizeof(*context));
}

EXPORT_C void CDTMd5::Md5DigestL(TDes8& aDest, const TDesC8& aSrc )
{
if (aDest.MaxLength()<32)
{
CLog("InDate is not enough!");
return;
}
_LIT8( KDigestFormat, "%02X" );
aDest.Zero();

MD5_CTX md5;
MD5Init(&md5);
TUint8 digest[17];
MD5Update(&md5,(TUint8*)aSrc.Ptr(),aSrc.Length());
MD5Final(digest,&md5);

for( TInt i=0; i < 16; i++ )
{
aDest.AppendFormat( KDigestFormat, digest[i]);
}
}

EXPORT_C void CDTMd5::Md5DigestL(TDes& aDest, const TDesC& aSrc )
{
if (aDest.MaxLength()<32)
{
CLog("InDate is not enough!");
return;
}
_LIT( KDigestFormat, "%02X" );
aDest.Zero();

HBufC8* src = CDTStringUtils::ConvertToUtf8CL(aSrc);
if (!src)
CLog("ConvertToUtf8CL Error!");
MD5_CTX md5;
MD5Init(&md5);
TUint8 digest[17];
MD5Update(&md5,(TUint8*)src->Ptr(),src->Length());
MD5Final(digest,&md5);

for( TInt i=0; i < 16; i++ )
{
aDest.AppendFormat( KDigestFormat, digest[i]);
}
delete src;
src = NULL;

}
lspo816 2008-04-01
  • 打赏
  • 举报
回复

//CDTMD5.cpp
/*
============================================================================
Name : DTMD5.cpp
Author : lspo816@hotmail.com
Version :
Copyright :
Description : CDTMD5 implementation
============================================================================
*/
#include <libc/string.h>
#include "DTStringUtils.h"
#include "DTMD5.h"

#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

TUint8 PADDING[64] =
{
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) + (TUint32)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define GG(a, b, c, d, x, s, ac) { \
(a) += G ((b), (c), (d)) + (x) + (TUint32)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define HH(a, b, c, d, x, s, ac) { \
(a) += H ((b), (c), (d)) + (x) + (TUint32)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define II(a, b, c, d, x, s, ac) { \
(a) += I ((b), (c), (d)) + (x) + (TUint32)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}

/* MD5 basic transformation. Transforms state based on block. */
void CDTMd5::MD5Transform (TUint32 state[4], TUint8 block[64])
{
TUint32 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. */
R_memset((TUint8*)x, 0, sizeof(x));
}

/* Encodes input (TUint32) into output (TUint8). Assumes len is
a multiple of 4. */
void CDTMd5::Encode(TUint8 *output, TUint32 *input,TUint len)
{
TUint i, j;

for(i = 0, j = 0; j < len; i++, j += 4)
{
output[j] = (TUint8)(input[i] & 0xff);
output[j+1] = (TUint8)((input[i] >> 8) & 0xff);
output[j+2] = (TUint8)((input[i] >> 16) & 0xff);
output[j+3] = (TUint8)((input[i] >> 24) & 0xff);
}
}
lspo816 2008-04-01
  • 打赏
  • 举报
回复
//CDTMD5.h
/*
============================================================================
Name : DTMD5.h
Author : lspo816@hotmail.com
Version :
Copyright :
Description : CDTMD5 declaration
============================================================================
*/

#ifndef DTMD5_H
#define DTMD5_H

#include <e32def.h>
#include <e32std.h>
#include "portab.h"

#define R_memset(x, y, z) memset(x, y, z)
#define R_memcpy(x, y, z) memcpy(x, y, z)
#define R_memcmp(x, y, z) memcmp(x, y, z)

class CDTMd5
{
/* MD5 context. */
class MD5_CTX
{
public:
TUint32 state[4];
TUint32 count[2];
TUint8 buffer[64];
};
public:
IMPORT_C static void Md5DigestL(TDes8& aDest, const TDesC8& aSrc );
IMPORT_C static void Md5DigestL(TDes& aDest, const TDesC& aSrc );

protected:
static void MD5Transform(TUint32 [4], TUint8 [64]);
static void Encode(TUint8 *, TUint32 *, TUint);
static void Decode(TUint32 *, TUint8 *, TUint);
static void MD5Init(MD5_CTX *);
static void MD5Update(MD5_CTX *, TUint8 *, TUint);
static void MD5Final(TUint8[16], MD5_CTX *);
};
#endif // DTMD5_H

Paip_Ceser 2008-04-01
  • 打赏
  • 举报
回复
[Quote=引用 4 楼 yyc520 的回复:]
o(∩_∩)o...,我有,100分全是我的么,我就给!
[/Quote]

给的话分全给。邮箱:yebingwei@foxmail.com

To dyw:
第三版的实现方式我看见过了,十分感谢
dyw 2008-03-31
  • 打赏
  • 举报
回复
在3rd版下拷贝hash.h, hash.lib文件应该也可以使用。以前没有公开,Symbian9之后公开了。
yyc520 2008-03-31
  • 打赏
  • 举报
回复
o(∩_∩)o...,开个玩笑,交个朋友也给。
yyc520 2008-03-31
  • 打赏
  • 举报
回复
o(∩_∩)o...,我有,100分全是我的么,我就给!
Paip_Ceser 2008-03-31
  • 打赏
  • 举报
回复
首先,谢谢dyw的关注。
算法的源码我看过,其实代码量也不是很大,但是有很多符号转换,想要移植的话,对我来现在水平来说还是比较麻烦的。
另外,由于这个比较急用,就想有没有人做过类似的项目,有的话就直接拿来用一下。
dyw 2008-03-31
  • 打赏
  • 举报
回复
考虑移植别人的实现,比如:
Implementing the MD5 Algorithm
http://www.codeguru.com/cpp/cpp/algorithms/article.php/c5087/
Atoric 2008-03-31
  • 打赏
  • 举报
回复
顶……

3,119

社区成员

发帖
与我相关
我的任务
社区描述
塞班系统(Symbian系统)是塞班公司为手机而设计的操作系统,它的前身是英国宝意昂公司的 EP ( Electronic Piece of cheese)操作系统。
社区管理员
  • Symbian社区
加入社区
  • 近7日
  • 近30日
  • 至今
社区公告
暂无公告

试试用AI创作助手写篇文章吧