⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 rfc1321---md5报文摘要算法--中文版.htm

📁 MD5算法的相关资料
💻 HTM
📖 第 1 页 / 共 3 页
字号:
<P>#if MD == 2<BR>#define MD_CTX MD2_CTX<BR>#define MDInit MD2Init<BR>#define 
MDUpdate MD2Update<BR>#define MDFinal MD2Final<BR>#endif<BR>#if MD == 
4<BR>#define MD_CTX MD4_CTX<BR>#define MDInit MD4Init<BR>#define MDUpdate 
MD4Update<BR>#define MDFinal MD4Final<BR>#endif<BR>#if MD == 5<BR>#define MD_CTX 
MD5_CTX<BR>#define MDInit MD5Init<BR>#define MDUpdate MD5Update<BR>#define 
MDFinal MD5Final<BR>#endif</P>
<P>/* 主程序.<BR>变量:<BR>&nbsp; -sstring – 摘要字符串<BR>&nbsp; 
-t&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; - 运行时间测试<BR>&nbsp; 
-x&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; - 运行测试脚本<BR>&nbsp; filename – 
摘要文件<BR>&nbsp; (none)&nbsp;&nbsp; - 摘要标准输入<BR>&nbsp;*/<BR>int main (argc, 
argv)<BR>int argc;</P>
<P>char *argv[];<BR>{<BR>&nbsp; int i;</P>
<P>&nbsp; if (argc &gt; 1)<BR>&nbsp;for (i = 1; i &lt; argc; 
i++)<BR>&nbsp;&nbsp; if (argv[i][0] == '-' &amp;&amp; argv[i][1] == 
's')<BR>&nbsp;&nbsp;&nbsp;&nbsp; MDString (argv[i] + 2);<BR>&nbsp;&nbsp; else if 
(strcmp (argv[i], "-t") == 0)<BR>&nbsp;&nbsp;&nbsp;&nbsp; MDTimeTrial 
();<BR>&nbsp;&nbsp; else if (strcmp (argv[i], "-x") == 
0)<BR>&nbsp;&nbsp;&nbsp;&nbsp; MDTestSuite ();<BR>&nbsp;&nbsp; 
else<BR>&nbsp;&nbsp;&nbsp;&nbsp; MDFile (argv[i]);<BR>&nbsp; 
else<BR>&nbsp;MDFilter ();</P>
<P>&nbsp; return (0);<BR>}</P>
<P>/* 计算字符串的摘要并打印其值 */<BR>static void MDString (string)<BR>char 
*string;<BR>{<BR>&nbsp; MD_CTX context;<BR>&nbsp; unsigned char 
digest[16];<BR>&nbsp; unsigned int len = strlen (string);</P>
<P>&nbsp; MDInit (&amp;context);<BR>&nbsp; MDUpdate (&amp;context, string, 
len);<BR>&nbsp; MDFinal (digest, &amp;context);</P>
<P>&nbsp; printf ("MD%d (\"%s\") = ", MD, string);<BR>&nbsp; MDPrint 
(digest);<BR>&nbsp; printf ("\n");<BR>}</P>
<P>/* 测试计算 TEST_BLOCK_COUNT TEST_BLOCK_LEN-byte<BR>&nbsp;&nbsp; 分组摘要的时间 
*/<BR>static void MDTimeTrial ()<BR>{<BR>&nbsp; MD_CTX context;<BR>&nbsp; time_t 
endTime, startTime;<BR>&nbsp; unsigned char block[TEST_BLOCK_LEN], 
digest[16];<BR>&nbsp; unsigned int i;</P>
<P>&nbsp; printf<BR>&nbsp;("MD%d time trial. Digesting %d %d-byte blocks ...", 
MD,<BR>&nbsp; TEST_BLOCK_LEN, TEST_BLOCK_COUNT);</P>
<P>&nbsp; /* 初始化分组*/<BR>&nbsp; for (i = 0; i &lt; TEST_BLOCK_LEN; 
i++)<BR>&nbsp;block[i] = (unsigned char)(i &amp; 0xff);</P>
<P>&nbsp; /* 开始时钟 */<BR>&nbsp; time (&amp;startTime);</P>
<P>&nbsp;&nbsp;&nbsp; /* 摘要分组 */<BR>&nbsp; MDInit (&amp;context);<BR>&nbsp; for 
(i = 0; i &lt; TEST_BLOCK_COUNT; i++)<BR>&nbsp;MDUpdate (&amp;context, block, 
TEST_BLOCK_LEN);<BR>&nbsp; MDFinal (digest, &amp;context);</P>
<P>&nbsp;&nbsp;&nbsp; /* 停止时钟 */<BR>&nbsp; time (&amp;endTime);</P>
<P>&nbsp; printf (" done\n");<BR>&nbsp; printf ("Digest = ");<BR>&nbsp; MDPrint 
(digest);<BR>&nbsp; printf ("\nTime = %ld seconds\n", 
(long)(endTime-startTime));<BR>&nbsp; printf<BR>&nbsp;("Speed = %ld 
bytes/second\n",<BR>&nbsp; (long)TEST_BLOCK_LEN * 
(long)TEST_BLOCK_COUNT/(endTime-startTime));<BR>}</P>
<P>/* 计算一个参考组件串的摘要并打印结果*/<BR>static void MDTestSuite ()<BR>{<BR>&nbsp; printf 
("MD%d test suite:\n", MD);</P>
<P>&nbsp; MDString ("");<BR>&nbsp; MDString ("a");<BR>&nbsp; MDString 
("abc");<BR>&nbsp; MDString ("message digest");<BR>&nbsp; MDString 
("abcdefghijklmnopqrstuvwxyz");<BR>&nbsp; 
MDString<BR>&nbsp;("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789");<BR>&nbsp; 
MDString<BR>&nbsp;("1234567890123456789012345678901234567890\<BR>1234567890123456789012345678901234567890");<BR>}</P>
<P>/*计算一个文件的摘要并打印结果 */<BR>static void MDFile (filename)<BR>char 
*filename;<BR>{<BR>&nbsp; FILE *file;<BR>&nbsp; MD_CTX context;<BR>&nbsp; int 
len;<BR>&nbsp; unsigned char buffer[1024], digest[16];</P>
<P>&nbsp; if ((file = fopen (filename, "rb")) == NULL)<BR>&nbsp;printf ("%s 
can't be opened\n", filename);</P>
<P>&nbsp; else {<BR>&nbsp;MDInit (&amp;context);<BR>&nbsp;while (len = fread 
(buffer, 1, 1024, file))<BR>&nbsp;&nbsp; MDUpdate (&amp;context, buffer, 
len);<BR>&nbsp;MDFinal (digest, &amp;context);</P>
<P>&nbsp;fclose (file);</P>
<P>&nbsp;printf ("MD%d (%s) = ", MD, filename);<BR>&nbsp;MDPrint 
(digest);<BR>&nbsp;printf ("\n");<BR>&nbsp; }<BR>}</P>
<P>/* 计算标准输入的摘要并打印结果*/<BR>static void MDFilter ()<BR>{<BR>&nbsp; MD_CTX 
context;<BR>&nbsp; int len;<BR>&nbsp; unsigned char buffer[16], digest[16];</P>
<P>&nbsp; MDInit (&amp;context);<BR>&nbsp; while (len = fread (buffer, 1, 16, 
stdin))<BR>&nbsp;MDUpdate (&amp;context, buffer, len);<BR>&nbsp; MDFinal 
(digest, &amp;context);</P>
<P>&nbsp; MDPrint (digest);<BR>&nbsp; printf ("\n");<BR>}</P>
<P>/* 打印一个16进制的摘要*/<BR>static void MDPrint (digest)<BR>unsigned char 
digest[16];<BR>{</P>
<P>&nbsp; unsigned int i;</P>
<P>&nbsp; for (i = 0; i &lt; 16; i++)<BR>&nbsp;printf ("%02x", 
digest[i]);<BR>}</P>
<P>A.5 测试组件</P>
<P>&nbsp;&nbsp; MD5 测试组件(驱动程序选项"-x")应打印以下值:</P>
<P>MD5 test suite:<BR>MD5 ("") = d41d8cd98f00b204e9800998ecf8427e<BR>MD5 ("a") = 
0cc175b9c0f1b6a831c399e269772661<BR>MD5 ("abc") = 
900150983cd24fb0d6963f7d28e17f72<BR>MD5 ("message digest") = 
f96b697d7cb7938d525a2f31aaf161d0<BR>MD5 ("abcdefghijklmnopqrstuvwxyz") = 
c3fcd3d76192e4007dfb496cca67e13b<BR>MD5 
("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789") 
=<BR>d174ab98d277d9f5a5611c2c9f419d9f<BR>MD5 
("123456789012345678901234567890123456789012345678901234567890123456<BR>78901234567890") 
= 57edf4a22be3c955ac49da2e2107b67a</P>
<P>8&nbsp;安全事项<BR>本文中讨论的安全标准被认为已足够实现很高要求的基于公用密钥系统和MD5算法的数字签名<BR>系统中。&nbsp;&nbsp; 
<BR>9&nbsp;作者地址</P>
<P>&nbsp;&nbsp; Ronald L. Rivest<BR>&nbsp;&nbsp; Massachusetts Institute of 
Technology<BR>&nbsp;&nbsp; Laboratory for Computer Science<BR>&nbsp;&nbsp; 
NE43-324<BR>&nbsp;&nbsp; 545 Technology Square<BR>&nbsp;&nbsp; Cambridge, 
MA&nbsp; 02139-1986</P>
<P>&nbsp;&nbsp; Phone: (617) 253-5880<BR>&nbsp;&nbsp; EMail: <A 
href="mailto:rivest@theory.lcs.mit.edu">rivest@theory.lcs.mit.edu</A></P>
<P><BR>RFC1321——The MD5 Message-Digest 
Algorithm&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
MD5 报文摘要算法<BR><A></A></P>
<P></P>
<P class=diaryFoot>- 作者: <A 
onclick="window.open('http://publishblog.blogchina.com/blog/postMessage.b?receiver=318470','发送短消息','width=520, height=455')" 
href="javascript:void(0);">shiyiwan</A> 访问统计:
<SCRIPT language=JavaScript 
src="RFC1321---MD5报文摘要算法--追风小屋.files/PageServlet"></SCRIPT>
 2005年09月29日, 星期四 10:20 <A 
href="javascript:void(keyit=window.open('http://blogmark.blogchina.com/jsp/key/quickaddkey.jsp?k='+encodeURI('RFC1321---MD5报文摘要算法')+'&amp;u='+encodeURI('http://shiyiwan.blogchina.com/shiyiwan/3071370.html')+'&amp;c='+encodeURI(''),'keyit','scrollbars=no,width=500,height=430,status=no,resizable=yes'));keyit.focus();">加入博采</A> 
</P></DIV>
<DIV class=operation><A name=trackback>
<H3>Trackback</H3></A>
<P class=trackback>你可以使用这个链接引用该篇文章 
http://publishblog.blogchina.com/blog/tb.b?diaryID=3071370 </P></DIV>
<DIV class=operation><A name=relatedDiary>
<H3>博客手拉手</H3></A>
<P class=comment>[2005-08-13 00:00:00.0]&nbsp;&nbsp;&nbsp;&nbsp;<A 
title=基本算法(pascal版) href="http://zouyu9631.blogchina.com/2579728.html" 
target=_blank>基本算法(pascal版)</A></P>
<P class=comment>[2005-08-22 00:00:00.0]&nbsp;&nbsp;&nbsp;&nbsp;<A 
title=换个摘要吧,来点新意思 href="http://juliewitch.blogchina.com/2662080.html" 
target=_blank>换个摘要吧,来点新意思</A></P>
<P class=comment>[2005-09-23 11:48:46.0]&nbsp;&nbsp;&nbsp;&nbsp;<A 
title="Dijkstra 最短路径算法的一种高效率实现" href="http://wolfhai.blogchina.com/3010469.html" 
target=_blank>Dijkstra 最短路径算法的一种高效率实现</A></P>
<P class=comment>[2005-08-12 00:00:00.0]&nbsp;&nbsp;&nbsp;&nbsp;<A title=如何写好摘要 
href="http://yjsnudt.blogchina.com/2563716.html" target=_blank>如何写好摘要</A></P>
<P class=comment>[2005-08-13 00:00:00.0]&nbsp;&nbsp;&nbsp;&nbsp;<A 
title=各种排序算法的比较 href="http://zouyu9631.blogchina.com/2575487.html" 
target=_blank>各种排序算法的比较</A></P></DIV>
<DIV class=operation><A name=comment>
<H3>回复</H3></A>
<TABLE cellSpacing=0 cellPadding=0 width=700 border=0>
  <TBODY></TBODY></TABLE></DIV>
<DIV class=operation>
<TABLE class=comment cellSpacing=0 cellPadding=0 width=700 border=0>
  <FORM id=replyForm method=post><INPUT type=hidden value=318835 name=blogID> 
  <INPUT type=hidden value=3071370 name=diaryID> <INPUT type=hidden 
  value=shiyiwan name=blogDomino>
  <SCRIPT>
if(getCookie('userID') == null){        
document.write('<tr><td width="70">发布人:</td>');
document.write('<td width="150"> <input name="remark.authorNameFUI" type="text" size="20" class="inputStyle" maxlength="20"></td>');
document.write('<td width="70">邮箱:</td>');
document.write('<td width="435"> <input name="remark.authorEmail" type="text" size="20" class="inputStyle" maxlength="40"></td>');
document.write('</tr><tr><td>主 页:</td>');
document.write('<td colspan="3"> <input name="remark.authorURL" type="text" class="inputStyle" value="HTTP://" size="63" maxlength="100"></td></tr>');
}else{
document.write('<input type="hidden" name="remark.authorNameFUI" value="Blogchina网友">');
}
</SCRIPT>
   
  <TBODY>
  <TR align=left>
    <TD colSpan=4>评论内容:<BR><TEXTAREA class=textStyle id=remark name=remark.remarkFUI rows=8 cols=60>          </TEXTAREA> 
    </TD></TR>
  <TR align=left>
    <TD colSpan=4>              <INPUT onclick=reply() type=button value=提交>   
<INPUT type=reset value=重置> </TD></TR></FORM></TBODY></TABLE></DIV></DIV>
<SCRIPT src="RFC1321---MD5报文摘要算法--追风小屋.files/extend3.js" 
type=text/javascript></SCRIPT>

<DIV id=footer><A href="http://blog.blogchina.com/">2003-2004 BlogChina.COM All 
rights reserved</A><BR><A href="http://www.blogdriver.com/">Powered by 
BlogDriver 2.1</A> </DIV></BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -