📄 gost_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++: gost.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>gost.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#include "pch.h"</span><a name="l00002"></a>00002 <span class="preprocessor">#include "<a class="code" href="gost_8h.html">gost.h</a>"</span><a name="l00003"></a>00003 <span class="preprocessor">#include "misc.h"</span><a name="l00004"></a>00004 <a name="l00005"></a>00005 NAMESPACE_BEGIN(CryptoPP)<a name="l00006"></a>00006 <a name="l00007"></a>00007 <span class="comment">// these are the S-boxes given in Applied Cryptography 2nd Ed., p. 333</span><a name="l00008"></a>00008 const byte <a class="code" href="class_g_o_s_t.html" title="GOST">GOST</a>::Base::sBox[8][16]={<a name="l00009"></a>00009 {4, 10, 9, 2, 13, 8, 0, 14, 6, 11, 1, 12, 7, 15, 5, 3},<a name="l00010"></a>00010 {14, 11, 4, 12, 6, 13, 15, 10, 2, 3, 8, 1, 0, 7, 5, 9},<a name="l00011"></a>00011 {5, 8, 1, 13, 10, 3, 4, 2, 14, 15, 12, 7, 6, 0, 9, 11},<a name="l00012"></a>00012 {7, 13, 10, 1, 0, 8, 9, 15, 14, 4, 6, 12, 11, 2, 5, 3},<a name="l00013"></a>00013 {6, 12, 7, 1, 5, 15, 13, 8, 4, 10, 9, 14, 0, 3, 11, 2},<a name="l00014"></a>00014 {4, 11, 10, 0, 7, 2, 1, 13, 3, 6, 8, 5, 9, 12, 15, 14},<a name="l00015"></a>00015 {13, 11, 4, 1, 3, 15, 5, 9, 0, 10, 14, 7, 6, 8, 2, 12},<a name="l00016"></a>00016 {1, 15, 13, 0, 5, 7, 10, 4, 9, 2, 3, 14, 6, 11, 8, 12}};<a name="l00017"></a>00017 <a name="l00018"></a>00018 <span class="comment">/* // these are the S-boxes given in the GOST source code listing in Applied</span><a name="l00019"></a>00019 <span class="comment"> // Cryptography 2nd Ed., p. 644. they appear to be from the DES S-boxes</span><a name="l00020"></a>00020 <span class="comment"> {13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7 },</span><a name="l00021"></a>00021 <span class="comment"> { 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1 },</span><a name="l00022"></a>00022 <span class="comment"> {12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11 },</span><a name="l00023"></a>00023 <span class="comment"> { 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9 },</span><a name="l00024"></a>00024 <span class="comment"> { 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15 },</span><a name="l00025"></a>00025 <span class="comment"> {10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8 },</span><a name="l00026"></a>00026 <span class="comment"> {15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10 },</span><a name="l00027"></a>00027 <span class="comment"> {14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7 }}; </span><a name="l00028"></a>00028 <span class="comment">*/</span><a name="l00029"></a>00029 <a name="l00030"></a>00030 <span class="keywordtype">bool</span> GOST::Base::sTableCalculated = <span class="keyword">false</span>;<a name="l00031"></a>00031 word32 GOST::Base::sTable[4][256];<a name="l00032"></a>00032 <a name="l00033"></a>00033 <span class="keywordtype">void</span> GOST::Base::UncheckedSetKey(<span class="keyword">const</span> byte *userKey, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> length, <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="l00034"></a>00034 {<a name="l00035"></a>00035 AssertValidKeyLength(length);<a name="l00036"></a>00036 <a name="l00037"></a>00037 PrecalculateSTable();<a name="l00038"></a>00038 <a name="l00039"></a>00039 GetUserKey(<a class="code" href="cryptlib_8h.html#aeb92d42f5a6e27b8ba19f18d69d142bccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a>, key.begin(), 8, userKey, KEYLENGTH);<a name="l00040"></a>00040 }<a name="l00041"></a>00041 <a name="l00042"></a>00042 <span class="keywordtype">void</span> GOST::Base::PrecalculateSTable()<a name="l00043"></a>00043 {<a name="l00044"></a>00044 <span class="keywordflow">if</span> (!sTableCalculated)<a name="l00045"></a>00045 {<a name="l00046"></a>00046 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < 4; i++)<a name="l00047"></a>00047 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0; j < 256; j++) <a name="l00048"></a>00048 {<a name="l00049"></a>00049 word32 temp = sBox[2*i][j%16] | (sBox[2*i+1][j/16] << 4);<a name="l00050"></a>00050 sTable[i][j] = rotlMod(temp, 11+8*i);<a name="l00051"></a>00051 }<a name="l00052"></a>00052 <a name="l00053"></a>00053 sTableCalculated=<span class="keyword">true</span>;<a name="l00054"></a>00054 }<a name="l00055"></a>00055 }<a name="l00056"></a>00056 <a name="l00057"></a>00057 <span class="preprocessor">#define f(x) ( t=x, \</span><a name="l00058"></a>00058 <span class="preprocessor"> sTable[3][GETBYTE(t, 3)] ^ sTable[2][GETBYTE(t, 2)] \</span><a name="l00059"></a>00059 <span class="preprocessor"> ^ sTable[1][GETBYTE(t, 1)] ^ sTable[0][GETBYTE(t, 0)] )</span><a name="l00060"></a>00060 <span class="preprocessor"></span><a name="l00061"></a>00061 <span class="keyword">typedef</span> <a class="code" href="struct_block_get_and_put.html">BlockGetAndPut<word32, LittleEndian></a> <a class="code" href="struct_block_get_and_put.html">Block</a>;<a name="l00062"></a>00062 <a name="l00063"></a>00063 <span class="keywordtype">void</span> GOST::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="l00064"></a>00064 <span class="keyword"></span>{<a name="l00065"></a>00065 word32 n1, n2, t;<a name="l00066"></a>00066 <a name="l00067"></a>00067 <a class="code" href="struct_block_get_and_put.html#07781cc0817613fe47e8070999cf4b95">Block::Get</a>(inBlock)(n1)(n2);<a name="l00068"></a>00068 <a name="l00069"></a>00069 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<3; i++)<a name="l00070"></a>00070 {<a name="l00071"></a>00071 n2 ^= f(n1+key[0]);<a name="l00072"></a>00072 n1 ^= f(n2+key[1]);<a name="l00073"></a>00073 n2 ^= f(n1+key[2]);<a name="l00074"></a>00074 n1 ^= f(n2+key[3]);<a name="l00075"></a>00075 n2 ^= f(n1+key[4]);<a name="l00076"></a>00076 n1 ^= f(n2+key[5]);<a name="l00077"></a>00077 n2 ^= f(n1+key[6]);<a name="l00078"></a>00078 n1 ^= f(n2+key[7]);<a name="l00079"></a>00079 }<a name="l00080"></a>00080 <a name="l00081"></a>00081 n2 ^= f(n1+key[7]);<a name="l00082"></a>00082 n1 ^= f(n2+key[6]);<a name="l00083"></a>00083 n2 ^= f(n1+key[5]);<a name="l00084"></a>00084 n1 ^= f(n2+key[4]);<a name="l00085"></a>00085 n2 ^= f(n1+key[3]);<a name="l00086"></a>00086 n1 ^= f(n2+key[2]);<a name="l00087"></a>00087 n2 ^= f(n1+key[1]);<a name="l00088"></a>00088 n1 ^= f(n2+key[0]);<a name="l00089"></a>00089 <a name="l00090"></a>00090 <a class="code" href="struct_block_get_and_put.html#63d96a17e8118407e02896d0b0f8d92d">Block::Put</a>(xorBlock, outBlock)(n2)(n1);<a name="l00091"></a>00091 }<a name="l00092"></a>00092 <a name="l00093"></a>00093 <span class="keywordtype">void</span> GOST::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="l00094"></a>00094 <span class="keyword"></span>{<a name="l00095"></a>00095 word32 n1, n2, t;<a name="l00096"></a>00096 <a name="l00097"></a>00097 <a class="code" href="struct_block_get_and_put.html#07781cc0817613fe47e8070999cf4b95">Block::Get</a>(inBlock)(n1)(n2);<a name="l00098"></a>00098 <a name="l00099"></a>00099 n2 ^= f(n1+key[0]);<a name="l00100"></a>00100 n1 ^= f(n2+key[1]);<a name="l00101"></a>00101 n2 ^= f(n1+key[2]);<a name="l00102"></a>00102 n1 ^= f(n2+key[3]);<a name="l00103"></a>00103 n2 ^= f(n1+key[4]);<a name="l00104"></a>00104 n1 ^= f(n2+key[5]);<a name="l00105"></a>00105 n2 ^= f(n1+key[6]);<a name="l00106"></a>00106 n1 ^= f(n2+key[7]);<a name="l00107"></a>00107 <a name="l00108"></a>00108 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<3; i++)<a name="l00109"></a>00109 {<a name="l00110"></a>00110 n2 ^= f(n1+key[7]);<a name="l00111"></a>00111 n1 ^= f(n2+key[6]);<a name="l00112"></a>00112 n2 ^= f(n1+key[5]);<a name="l00113"></a>00113 n1 ^= f(n2+key[4]);<a name="l00114"></a>00114 n2 ^= f(n1+key[3]);<a name="l00115"></a>00115 n1 ^= f(n2+key[2]);<a name="l00116"></a>00116 n2 ^= f(n1+key[1]);<a name="l00117"></a>00117 n1 ^= f(n2+key[0]);<a name="l00118"></a>00118 }<a name="l00119"></a>00119 <a name="l00120"></a>00120 <a class="code" href="struct_block_get_and_put.html#63d96a17e8118407e02896d0b0f8d92d">Block::Put</a>(xorBlock, outBlock)(n2)(n1);<a name="l00121"></a>00121 }<a name="l00122"></a>00122 <a name="l00123"></a>00123 NAMESPACE_END</pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:21 2007 for Crypto++ by <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 + -