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

📄 md2_8cpp-source.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: md2.cpp Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.2 --><div class="tabs">  <ul>    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>    <li><a href="namespaces.html"><span>Namespaces</span></a></li>    <li><a href="classes.html"><span>Classes</span></a></li>    <li class="current"><a href="files.html"><span>Files</span></a></li>  </ul></div><div class="tabs">  <ul>    <li><a href="files.html"><span>File&nbsp;List</span></a></li>    <li><a href="globals.html"><span>File&nbsp;Members</span></a></li>  </ul></div><h1>md2.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// md2.cpp - modified by Wei Dai from Andrew M. Kuchling's md2.c</span><a name="l00002"></a>00002 <span class="comment">// The original code and all modifications are in the public domain.</span><a name="l00003"></a>00003 <a name="l00004"></a>00004 <span class="comment">// This is the original introductory comment:</span><a name="l00005"></a>00005 <a name="l00006"></a>00006 <span class="comment">/*</span><a name="l00007"></a>00007 <span class="comment"> *  md2.c : MD2 hash algorithm.</span><a name="l00008"></a>00008 <span class="comment"> *</span><a name="l00009"></a>00009 <span class="comment"> * Part of the Python Cryptography Toolkit, version 1.1</span><a name="l00010"></a>00010 <span class="comment"> *</span><a name="l00011"></a>00011 <span class="comment"> * Distribute and use freely; there are no restrictions on further </span><a name="l00012"></a>00012 <span class="comment"> * dissemination and usage except those imposed by the laws of your </span><a name="l00013"></a>00013 <span class="comment"> * country of residence.</span><a name="l00014"></a>00014 <span class="comment"> *</span><a name="l00015"></a>00015 <span class="comment"> */</span><a name="l00016"></a>00016 <a name="l00017"></a>00017 <span class="preprocessor">#include "pch.h"</span><a name="l00018"></a>00018 <span class="preprocessor">#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1</span><a name="l00019"></a>00019 <span class="preprocessor"></span><span class="preprocessor">#include "md2.h"</span><a name="l00020"></a>00020 <a name="l00021"></a>00021 NAMESPACE_BEGIN(CryptoPP)<a name="l00022"></a>00022 namespace Weak1 {<a name="l00023"></a>00023         <a name="l00024"></a><a class="code" href="class_weak1_1_1_m_d2.html#c7203cafa38757c8655453c7ea1cc0d1">00024</a> MD2::MD2()<a name="l00025"></a>00025         : m_X(48), m_C(16), m_buf(16)<a name="l00026"></a>00026 {<a name="l00027"></a>00027         Init();<a name="l00028"></a>00028 }<a name="l00029"></a>00029 <a name="l00030"></a>00030 <span class="keywordtype">void</span> MD2::Init()<a name="l00031"></a>00031 {<a name="l00032"></a>00032         memset(m_X, 0, 48);<a name="l00033"></a>00033         memset(m_C, 0, 16);<a name="l00034"></a>00034         memset(m_buf, 0, 16);<a name="l00035"></a>00035         m_count = 0;<a name="l00036"></a>00036 }<a name="l00037"></a>00037 <a name="l00038"></a><a class="code" href="class_weak1_1_1_m_d2.html#accb13508264bff36fd08553d41408c2">00038</a> <span class="keywordtype">void</span> <a class="code" href="class_weak1_1_1_m_d2.html#accb13508264bff36fd08553d41408c2" title="process more input">MD2::Update</a>(<span class="keyword">const</span> byte *buf, <span class="keywordtype">size_t</span> len)<a name="l00039"></a>00039 {<a name="l00040"></a>00040         <span class="keyword">static</span> <span class="keyword">const</span> byte S[256] = {<a name="l00041"></a>00041                 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6,<a name="l00042"></a>00042                 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188,<a name="l00043"></a>00043                 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24,<a name="l00044"></a>00044                 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251,<a name="l00045"></a>00045                 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63,<a name="l00046"></a>00046                 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50,<a name="l00047"></a>00047                 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165,<a name="l00048"></a>00048                 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210,<a name="l00049"></a>00049                 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,<a name="l00050"></a>00050                 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27,<a name="l00051"></a>00051                 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15,<a name="l00052"></a>00052                 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197,<a name="l00053"></a>00053                 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65,<a name="l00054"></a>00054                 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123,<a name="l00055"></a>00055                 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233,<a name="l00056"></a>00056                 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228,<a name="l00057"></a>00057                 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237,<a name="l00058"></a>00058                 31, 26, 219, 153, 141, 51, 159, 17, 131, 20<a name="l00059"></a>00059         };<a name="l00060"></a>00060 <a name="l00061"></a>00061         <span class="keywordflow">while</span> (len) <a name="l00062"></a>00062     {<a name="l00063"></a>00063                 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> L = UnsignedMin(16U-m_count, len);<a name="l00064"></a>00064                 memcpy(m_buf+m_count, buf, L);<a name="l00065"></a>00065                 m_count+=L;<a name="l00066"></a>00066                 buf+=L;<a name="l00067"></a>00067                 len-=L;<a name="l00068"></a>00068                 <span class="keywordflow">if</span> (m_count==16) <a name="l00069"></a>00069                 {<a name="l00070"></a>00070                         byte t;<a name="l00071"></a>00071                         <span class="keywordtype">int</span> i,j;<a name="l00072"></a>00072                         <a name="l00073"></a>00073                         m_count=0;<a name="l00074"></a>00074                         memcpy(m_X+16, m_buf, 16);<a name="l00075"></a>00075                         t=m_C[15];<a name="l00076"></a>00076                         <span class="keywordflow">for</span>(i=0; i&lt;16; i++)<a name="l00077"></a>00077                         {<a name="l00078"></a>00078                                 m_X[32+i]=m_X[16+i]^m_X[i];<a name="l00079"></a>00079                                 t=m_C[i]^=S[m_buf[i]^t];<a name="l00080"></a>00080                         }<a name="l00081"></a>00081                         <a name="l00082"></a>00082                         t=0;<a name="l00083"></a>00083                         <span class="keywordflow">for</span>(i=0; i&lt;18; i++)<a name="l00084"></a>00084                         {<a name="l00085"></a>00085                                 <span class="keywordflow">for</span>(j=0; j&lt;48; j+=8)<a name="l00086"></a>00086                                 {<a name="l00087"></a>00087                                         t=m_X[j+0]^=S[t];<a name="l00088"></a>00088                                         t=m_X[j+1]^=S[t];<a name="l00089"></a>00089                                         t=m_X[j+2]^=S[t];<a name="l00090"></a>00090                                         t=m_X[j+3]^=S[t];<a name="l00091"></a>00091                                         t=m_X[j+4]^=S[t];<a name="l00092"></a>00092                                         t=m_X[j+5]^=S[t];<a name="l00093"></a>00093                                         t=m_X[j+6]^=S[t];<a name="l00094"></a>00094                                         t=m_X[j+7]^=S[t];<a name="l00095"></a>00095                                 }<a name="l00096"></a>00096                                 t=(t+i) &amp; 0xFF;<a name="l00097"></a>00097                         }<a name="l00098"></a>00098                 }<a name="l00099"></a>00099     }<a name="l00100"></a>00100 }<a name="l00101"></a>00101 <a name="l00102"></a><a class="code" href="class_weak1_1_1_m_d2.html#bc251bec5e961a8c1a5e0c241f06dd41">00102</a> <span class="keywordtype">void</span> <a class="code" href="class_weak1_1_1_m_d2.html#bc251bec5e961a8c1a5e0c241f06dd41" title="truncated version of Final()">MD2::TruncatedFinal</a>(byte *hash, <span class="keywordtype">size_t</span> size)<a name="l00103"></a>00103 {<a name="l00104"></a>00104         <a class="code" href="class_hash_transformation.html#64ba03d31c489dc32b50e00d377d8032">ThrowIfInvalidTruncatedSize</a>(size);<a name="l00105"></a>00105 <a name="l00106"></a>00106         byte padding[16];<a name="l00107"></a>00107         word32 padlen;<a name="l00108"></a>00108         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;<a name="l00109"></a>00109 <a name="l00110"></a>00110         padlen= 16-m_count;<a name="l00111"></a>00111         <span class="keywordflow">for</span>(i=0; i&lt;padlen; i++) padding[i]=(byte)padlen;<a name="l00112"></a>00112         <a class="code" href="class_weak1_1_1_m_d2.html#accb13508264bff36fd08553d41408c2" title="process more input">Update</a>(padding, padlen);<a name="l00113"></a>00113         <a class="code" href="class_weak1_1_1_m_d2.html#accb13508264bff36fd08553d41408c2" title="process more input">Update</a>(m_C, 16);<a name="l00114"></a>00114         memcpy(hash, m_X, size);<a name="l00115"></a>00115 <a name="l00116"></a>00116         Init();<a name="l00117"></a>00117 }<a name="l00118"></a>00118 <a name="l00119"></a>00119 }<a name="l00120"></a>00120 NAMESPACE_END</pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:22 2007 for Crypto++ by&nbsp;<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.2 </small></address></body></html>

⌨️ 快捷键说明

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