📄 cast_8cpp-source.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++: cast.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 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 List</span></a></li> <li><a href="globals.html"><span>File Members</span></a></li> </ul></div><h1>cast.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// cast.cpp - written and placed in the public domain by Wei Dai and Leonard Janke</span><a name="l00002"></a>00002 <span class="comment">// based on Steve Reid's public domain cast.c</span><a name="l00003"></a>00003 <a name="l00004"></a>00004 <span class="preprocessor">#include "pch.h"</span><a name="l00005"></a>00005 <span class="preprocessor">#include "<a class="code" href="cast_8h.html">cast.h</a>"</span><a name="l00006"></a>00006 <span class="preprocessor">#include "misc.h"</span><a name="l00007"></a>00007 <a name="l00008"></a>00008 NAMESPACE_BEGIN(CryptoPP)<a name="l00009"></a>00009 <a name="l00010"></a>00010 <span class="comment">/* Macros to access 8-bit bytes out of a 32-bit word */</span><a name="l00011"></a>00011 <span class="preprocessor">#define U8a(x) GETBYTE(x,3)</span><a name="l00012"></a>00012 <span class="preprocessor"></span><span class="preprocessor">#define U8b(x) GETBYTE(x,2)</span><a name="l00013"></a>00013 <span class="preprocessor"></span><span class="preprocessor">#define U8c(x) GETBYTE(x,1)</span><a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#define U8d(x) GETBYTE(x,0)</span><a name="l00015"></a>00015 <span class="preprocessor"></span><a name="l00016"></a>00016 <span class="comment">/* CAST uses three different round functions */</span><a name="l00017"></a>00017 <span class="preprocessor">#define f1(l, r, km, kr) \</span><a name="l00018"></a>00018 <span class="preprocessor"> t = rotlVariable(km + r, kr); \</span><a name="l00019"></a>00019 <span class="preprocessor"> l ^= ((S[0][U8a(t)] ^ S[1][U8b(t)]) - \</span><a name="l00020"></a>00020 <span class="preprocessor"> S[2][U8c(t)]) + S[3][U8d(t)];</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define f2(l, r, km, kr) \</span><a name="l00022"></a>00022 <span class="preprocessor"> t = rotlVariable(km ^ r, kr); \</span><a name="l00023"></a>00023 <span class="preprocessor"> l ^= ((S[0][U8a(t)] - S[1][U8b(t)]) + \</span><a name="l00024"></a>00024 <span class="preprocessor"> S[2][U8c(t)]) ^ S[3][U8d(t)];</span><a name="l00025"></a>00025 <span class="preprocessor"></span><span class="preprocessor">#define f3(l, r, km, kr) \</span><a name="l00026"></a>00026 <span class="preprocessor"> t = rotlVariable(km - r, kr); \</span><a name="l00027"></a>00027 <span class="preprocessor"> l ^= ((S[0][U8a(t)] + S[1][U8b(t)]) ^ \</span><a name="l00028"></a>00028 <span class="preprocessor"> S[2][U8c(t)]) - S[3][U8d(t)];</span><a name="l00029"></a>00029 <span class="preprocessor"></span><a name="l00030"></a>00030 <span class="preprocessor">#define F1(l, r, i, j) f1(l, r, K[i], K[i+j])</span><a name="l00031"></a>00031 <span class="preprocessor"></span><span class="preprocessor">#define F2(l, r, i, j) f2(l, r, K[i], K[i+j])</span><a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#define F3(l, r, i, j) f3(l, r, K[i], K[i+j])</span><a name="l00033"></a>00033 <span class="preprocessor"></span><a name="l00034"></a>00034 <span class="keyword">typedef</span> <a class="code" href="struct_block_get_and_put.html">BlockGetAndPut<word32, BigEndian></a> <a class="code" href="struct_block_get_and_put.html">Block</a>;<a name="l00035"></a>00035 <a name="l00036"></a>00036 <span class="keywordtype">void</span> CAST128::Enc::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span><a name="l00037"></a>00037 <span class="keyword"></span>{<a name="l00038"></a>00038 word32 t, l, r;<a name="l00039"></a>00039 <a name="l00040"></a>00040 <span class="comment">/* Get inblock into l,r */</span><a name="l00041"></a>00041 <a class="code" href="struct_block_get_and_put.html#07781cc0817613fe47e8070999cf4b95">Block::Get</a>(inBlock)(l)(r);<a name="l00042"></a>00042 <span class="comment">/* Do the work */</span><a name="l00043"></a>00043 F1(l, r, 0, 16);<a name="l00044"></a>00044 F2(r, l, 1, 16);<a name="l00045"></a>00045 F3(l, r, 2, 16);<a name="l00046"></a>00046 F1(r, l, 3, 16);<a name="l00047"></a>00047 F2(l, r, 4, 16);<a name="l00048"></a>00048 F3(r, l, 5, 16);<a name="l00049"></a>00049 F1(l, r, 6, 16);<a name="l00050"></a>00050 F2(r, l, 7, 16);<a name="l00051"></a>00051 F3(l, r, 8, 16);<a name="l00052"></a>00052 F1(r, l, 9, 16);<a name="l00053"></a>00053 F2(l, r, 10, 16);<a name="l00054"></a>00054 F3(r, l, 11, 16);<a name="l00055"></a>00055 <span class="comment">/* Only do full 16 rounds if key length > 80 bits */</span><a name="l00056"></a>00056 <span class="keywordflow">if</span> (!reduced) {<a name="l00057"></a>00057 F1(l, r, 12, 16);<a name="l00058"></a>00058 F2(r, l, 13, 16);<a name="l00059"></a>00059 F3(l, r, 14, 16);<a name="l00060"></a>00060 F1(r, l, 15, 16);<a name="l00061"></a>00061 }<a name="l00062"></a>00062 <span class="comment">/* Put l,r into outblock */</span><a name="l00063"></a>00063 <a class="code" href="struct_block_get_and_put.html#63d96a17e8118407e02896d0b0f8d92d">Block::Put</a>(xorBlock, outBlock)(r)(l);<a name="l00064"></a>00064 }<a name="l00065"></a>00065 <a name="l00066"></a>00066 <span class="keywordtype">void</span> CAST128::Dec::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span><a name="l00067"></a>00067 <span class="keyword"></span>{<a name="l00068"></a>00068 word32 t, l, r;<a name="l00069"></a>00069 <a name="l00070"></a>00070 <span class="comment">/* Get inblock into l,r */</span><a name="l00071"></a>00071 <a class="code" href="struct_block_get_and_put.html#07781cc0817613fe47e8070999cf4b95">Block::Get</a>(inBlock)(r)(l);<a name="l00072"></a>00072 <span class="comment">/* Only do full 16 rounds if key length > 80 bits */</span><a name="l00073"></a>00073 <span class="keywordflow">if</span> (!reduced) {<a name="l00074"></a>00074 F1(r, l, 15, 16);<a name="l00075"></a>00075 F3(l, r, 14, 16);<a name="l00076"></a>00076 F2(r, l, 13, 16);<a name="l00077"></a>00077 F1(l, r, 12, 16);<a name="l00078"></a>00078 }<a name="l00079"></a>00079 F3(r, l, 11, 16);<a name="l00080"></a>00080 F2(l, r, 10, 16);<a name="l00081"></a>00081 F1(r, l, 9, 16);<a name="l00082"></a>00082 F3(l, r, 8, 16);<a name="l00083"></a>00083 F2(r, l, 7, 16);<a name="l00084"></a>00084 F1(l, r, 6, 16);<a name="l00085"></a>00085 F3(r, l, 5, 16);<a name="l00086"></a>00086 F2(l, r, 4, 16);<a name="l00087"></a>00087 F1(r, l, 3, 16);<a name="l00088"></a>00088 F3(l, r, 2, 16);<a name="l00089"></a>00089 F2(r, l, 1, 16);<a name="l00090"></a>00090 F1(l, r, 0, 16);<a name="l00091"></a>00091 <span class="comment">/* Put l,r into outblock */</span><a name="l00092"></a>00092 <a class="code" href="struct_block_get_and_put.html#63d96a17e8118407e02896d0b0f8d92d">Block::Put</a>(xorBlock, outBlock)(l)(r);<a name="l00093"></a>00093 <span class="comment">/* Wipe clean */</span><a name="l00094"></a>00094 t = l = r = 0;<a name="l00095"></a>00095 }<a name="l00096"></a>00096 <a name="l00097"></a>00097 <span class="keywordtype">void</span> CAST128::Base::UncheckedSetKey(<span class="keyword">const</span> byte *userKey, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> keylength, <span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &)<a name="l00098"></a>00098 {<a name="l00099"></a>00099 AssertValidKeyLength(keylength);<a name="l00100"></a>00100 <a name="l00101"></a>00101 reduced = (keylength <= 10);<a name="l00102"></a>00102 <a name="l00103"></a>00103 word32 X[4], Z[4];<a name="l00104"></a>00104 GetUserKey(<a class="code" href="cryptlib_8h.html#aeb92d42f5a6e27b8ba19f18d69d142bf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, X, 4, userKey, keylength);<a name="l00105"></a>00105 <a name="l00106"></a>00106 <span class="preprocessor">#define x(i) GETBYTE(X[i/4], 3-i%4)</span><a name="l00107"></a>00107 <span class="preprocessor"></span><span class="preprocessor">#define z(i) GETBYTE(Z[i/4], 3-i%4)</span><a name="l00108"></a>00108 <span class="preprocessor"></span><a name="l00109"></a>00109 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;<a name="l00110"></a>00110 <span class="keywordflow">for</span> (i=0; i<=16; i+=16)<a name="l00111"></a>00111 {<a name="l00112"></a>00112 <span class="comment">// this part is copied directly from RFC 2144 (with some search and replace) by Wei Dai</span><a name="l00113"></a>00113 Z[0] = X[0] ^ S[4][x(0xD)] ^ S[5][x(0xF)] ^ S[6][x(0xC)] ^ S[7][x(0xE)] ^ S[6][x(0x8)];<a name="l00114"></a>00114 Z[1] = X[2] ^ S[4][z(0x0)] ^ S[5][z(0x2)] ^ S[6][z(0x1)] ^ S[7][z(0x3)] ^ S[7][x(0xA)];<a name="l00115"></a>00115 Z[2] = X[3] ^ S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[4][x(0x9)];<a name="l00116"></a>00116 Z[3] = X[1] ^ S[4][z(0xA)] ^ S[5][z(0x9)] ^ S[6][z(0xB)] ^ S[7][z(0x8)] ^ S[5][x(0xB)];<a name="l00117"></a>00117 K[i+0] = S[4][z(0x8)] ^ S[5][z(0x9)] ^ S[6][z(0x7)] ^ S[7][z(0x6)] ^ S[4][z(0x2)];<a name="l00118"></a>00118 K[i+1] = S[4][z(0xA)] ^ S[5][z(0xB)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[5][z(0x6)];<a name="l00119"></a>00119 K[i+2] = S[4][z(0xC)] ^ S[5][z(0xD)] ^ S[6][z(0x3)] ^ S[7][z(0x2)] ^ S[6][z(0x9)];<a name="l00120"></a>00120 K[i+3] = S[4][z(0xE)] ^ S[5][z(0xF)] ^ S[6][z(0x1)] ^ S[7][z(0x0)] ^ S[7][z(0xC)];<a name="l00121"></a>00121 X[0] = Z[2] ^ S[4][z(0x5)] ^ S[5][z(0x7)] ^ S[6][z(0x4)] ^ S[7][z(0x6)] ^ S[6][z(0x0)];<a name="l00122"></a>00122 X[1] = Z[0] ^ S[4][x(0x0)] ^ S[5][x(0x2)] ^ S[6][x(0x1)] ^ S[7][x(0x3)] ^ S[7][z(0x2)];<a name="l00123"></a>00123 X[2] = Z[1] ^ S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x5)] ^ S[7][x(0x4)] ^ S[4][z(0x1)];<a name="l00124"></a>00124 X[3] = Z[3] ^ S[4][x(0xA)] ^ S[5][x(0x9)] ^ S[6][x(0xB)] ^ S[7][x(0x8)] ^ S[5][z(0x3)];<a name="l00125"></a>00125 K[i+4] = S[4][x(0x3)] ^ S[5][x(0x2)] ^ S[6][x(0xC)] ^ S[7][x(0xD)] ^ S[4][x(0x8)];<a name="l00126"></a>00126 K[i+5] = S[4][x(0x1)] ^ S[5][x(0x0)] ^ S[6][x(0xE)] ^ S[7][x(0xF)] ^ S[5][x(0xD)];<a name="l00127"></a>00127 K[i+6] = S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x8)] ^ S[7][x(0x9)] ^ S[6][x(0x3)];<a name="l00128"></a>00128 K[i+7] = S[4][x(0x5)] ^ S[5][x(0x4)] ^ S[6][x(0xA)] ^ S[7][x(0xB)] ^ S[7][x(0x7)];<a name="l00129"></a>00129 Z[0] = X[0] ^ S[4][x(0xD)] ^ S[5][x(0xF)] ^ S[6][x(0xC)] ^ S[7][x(0xE)] ^ S[6][x(0x8)];<a name="l00130"></a>00130 Z[1] = X[2] ^ S[4][z(0x0)] ^ S[5][z(0x2)] ^ S[6][z(0x1)] ^ S[7][z(0x3)] ^ S[7][x(0xA)];<a name="l00131"></a>00131 Z[2] = X[3] ^ S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[4][x(0x9)];<a name="l00132"></a>00132 Z[3] = X[1] ^ S[4][z(0xA)] ^ S[5][z(0x9)] ^ S[6][z(0xB)] ^ S[7][z(0x8)] ^ S[5][x(0xB)];<a name="l00133"></a>00133 K[i+8] = S[4][z(0x3)] ^ S[5][z(0x2)] ^ S[6][z(0xC)] ^ S[7][z(0xD)] ^ S[4][z(0x9)];<a name="l00134"></a>00134 K[i+9] = S[4][z(0x1)] ^ S[5][z(0x0)] ^ S[6][z(0xE)] ^ S[7][z(0xF)] ^ S[5][z(0xC)];<a name="l00135"></a>00135 K[i+10] = S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x8)] ^ S[7][z(0x9)] ^ S[6][z(0x2)];<a name="l00136"></a>00136 K[i+11] = S[4][z(0x5)] ^ S[5][z(0x4)] ^ S[6][z(0xA)] ^ S[7][z(0xB)] ^ S[7][z(0x6)];<a name="l00137"></a>00137 X[0] = Z[2] ^ S[4][z(0x5)] ^ S[5][z(0x7)] ^ S[6][z(0x4)] ^ S[7][z(0x6)] ^ S[6][z(0x0)];<a name="l00138"></a>00138 X[1] = Z[0] ^ S[4][x(0x0)] ^ S[5][x(0x2)] ^ S[6][x(0x1)] ^ S[7][x(0x3)] ^ S[7][z(0x2)];<a name="l00139"></a>00139 X[2] = Z[1] ^ S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x5)] ^ S[7][x(0x4)] ^ S[4][z(0x1)];<a name="l00140"></a>00140 X[3] = Z[3] ^ S[4][x(0xA)] ^ S[5][x(0x9)] ^ S[6][x(0xB)] ^ S[7][x(0x8)] ^ S[5][z(0x3)];<a name="l00141"></a>00141 K[i+12] = S[4][x(0x8)] ^ S[5][x(0x9)] ^ S[6][x(0x7)] ^ S[7][x(0x6)] ^ S[4][x(0x3)];⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -