📄 idea_8cpp-source.html
字号:
<a name="l00090"></a>00090 <a name="l00091"></a>00091 <span class="keywordflow">if</span> (!IsForwardTransformation())<a name="l00092"></a>00092 DeKey();<a name="l00093"></a>00093 <a name="l00094"></a>00094 <span class="preprocessor">#ifdef IDEA_LARGECACHE</span><a name="l00095"></a>00095 <span class="preprocessor"></span> LookupKeyLogs();<a name="l00096"></a>00096 <span class="preprocessor">#endif</span><a name="l00097"></a>00097 <span class="preprocessor"></span>}<a name="l00098"></a>00098 <a name="l00099"></a>00099 <span class="keywordtype">void</span> IDEA::Base::EnKey (<span class="keyword">const</span> byte *userKey)<a name="l00100"></a>00100 {<a name="l00101"></a>00101 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;<a name="l00102"></a>00102 <a name="l00103"></a>00103 <span class="keywordflow">for</span> (i=0; i<8; i++)<a name="l00104"></a>00104 m_key[i] = ((<a class="code" href="class_i_d_e_a.html#3ec08f4e29ea15045274d857582b07ab">IDEA::Word</a>)userKey[2*i]<<8) | userKey[2*i+1];<a name="l00105"></a>00105 <a name="l00106"></a>00106 <span class="keywordflow">for</span> (; i<IDEA_KEYLEN; i++)<a name="l00107"></a>00107 {<a name="l00108"></a>00108 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j = RoundDownToMultipleOf(i,8U)-8;<a name="l00109"></a>00109 m_key[i] = low16((m_key[j+(i+1)%8] << 9) | (m_key[j+(i+2)%8] >> 7));<a name="l00110"></a>00110 }<a name="l00111"></a>00111 }<a name="l00112"></a>00112 <a name="l00113"></a>00113 <span class="keyword">static</span> <a class="code" href="class_i_d_e_a.html#3ec08f4e29ea15045274d857582b07ab">IDEA::Word</a> MulInv(<a class="code" href="class_i_d_e_a.html#3ec08f4e29ea15045274d857582b07ab">IDEA::Word</a> x)<a name="l00114"></a>00114 {<a name="l00115"></a>00115 <a class="code" href="class_i_d_e_a.html#3ec08f4e29ea15045274d857582b07ab">IDEA::Word</a> y=x;<a name="l00116"></a>00116 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=0; i<15; i++)<a name="l00117"></a>00117 {<a name="l00118"></a>00118 DirectMUL(y,low16(y));<a name="l00119"></a>00119 DirectMUL(y,x);<a name="l00120"></a>00120 }<a name="l00121"></a>00121 <span class="keywordflow">return</span> low16(y);<a name="l00122"></a>00122 }<a name="l00123"></a>00123 <a name="l00124"></a>00124 <span class="keyword">static</span> <span class="keyword">inline</span> <a class="code" href="class_i_d_e_a.html#3ec08f4e29ea15045274d857582b07ab">IDEA::Word</a> AddInv(<a class="code" href="class_i_d_e_a.html#3ec08f4e29ea15045274d857582b07ab">IDEA::Word</a> x)<a name="l00125"></a>00125 {<a name="l00126"></a>00126 <span class="keywordflow">return</span> low16(0-x);<a name="l00127"></a>00127 }<a name="l00128"></a>00128 <a name="l00129"></a>00129 <span class="keywordtype">void</span> IDEA::Base::DeKey()<a name="l00130"></a>00130 {<a name="l00131"></a>00131 <a class="code" href="class_fixed_size_sec_block.html" title="a SecBlock with fixed size, allocated statically">FixedSizeSecBlock<IDEA::Word, 6*ROUNDS+4></a> tempkey;<a name="l00132"></a>00132 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;<a name="l00133"></a>00133 <a name="l00134"></a>00134 <span class="keywordflow">for</span> (i=0; i<ROUNDS; i++)<a name="l00135"></a>00135 {<a name="l00136"></a>00136 tempkey[i*6+0] = MulInv(m_key[(ROUNDS-i)*6+0]);<a name="l00137"></a>00137 tempkey[i*6+1] = AddInv(m_key[(ROUNDS-i)*6+1+(i>0)]);<a name="l00138"></a>00138 tempkey[i*6+2] = AddInv(m_key[(ROUNDS-i)*6+2-(i>0)]);<a name="l00139"></a>00139 tempkey[i*6+3] = MulInv(m_key[(ROUNDS-i)*6+3]);<a name="l00140"></a>00140 tempkey[i*6+4] = m_key[(ROUNDS-1-i)*6+4];<a name="l00141"></a>00141 tempkey[i*6+5] = m_key[(ROUNDS-1-i)*6+5];<a name="l00142"></a>00142 }<a name="l00143"></a>00143 <a name="l00144"></a>00144 tempkey[i*6+0] = MulInv(m_key[(ROUNDS-i)*6+0]);<a name="l00145"></a>00145 tempkey[i*6+1] = AddInv(m_key[(ROUNDS-i)*6+1]);<a name="l00146"></a>00146 tempkey[i*6+2] = AddInv(m_key[(ROUNDS-i)*6+2]);<a name="l00147"></a>00147 tempkey[i*6+3] = MulInv(m_key[(ROUNDS-i)*6+3]);<a name="l00148"></a>00148 <a name="l00149"></a>00149 m_key = tempkey;<a name="l00150"></a>00150 }<a name="l00151"></a>00151 <a name="l00152"></a>00152 <span class="preprocessor">#ifdef IDEA_LARGECACHE</span><a name="l00153"></a>00153 <span class="preprocessor"></span><span class="preprocessor">#define MUL(a,b) LookupMUL(a,b)</span><a name="l00154"></a>00154 <span class="preprocessor"></span><span class="preprocessor">#else</span><a name="l00155"></a>00155 <span class="preprocessor"></span><span class="preprocessor">#define MUL(a,b) DirectMUL(a,b)</span><a name="l00156"></a>00156 <span class="preprocessor"></span><span class="preprocessor">#endif</span><a name="l00157"></a>00157 <span class="preprocessor"></span><a name="l00158"></a>00158 <span class="keywordtype">void</span> IDEA::Base::ProcessAndXorBlock(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span><a name="l00159"></a>00159 <span class="keyword"></span>{<a name="l00160"></a>00160 <span class="keyword">typedef</span> <a class="code" href="struct_block_get_and_put.html">BlockGetAndPut<word16, BigEndian></a> <a class="code" href="struct_block_get_and_put.html">Block</a>;<a name="l00161"></a>00161 <a name="l00162"></a>00162 <span class="keyword">const</span> <a class="code" href="class_i_d_e_a.html#3ec08f4e29ea15045274d857582b07ab">IDEA::Word</a> *key = m_key;<a name="l00163"></a>00163 <a class="code" href="class_i_d_e_a.html#3ec08f4e29ea15045274d857582b07ab">IDEA::Word</a> x0,x1,x2,x3,t0,t1;<a name="l00164"></a>00164 <a class="code" href="struct_block_get_and_put.html#07781cc0817613fe47e8070999cf4b95">Block::Get</a>(inBlock)(x0)(x1)(x2)(x3);<a name="l00165"></a>00165 <a name="l00166"></a>00166 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<ROUNDS; i++)<a name="l00167"></a>00167 {<a name="l00168"></a>00168 MUL(x0, key[i*6+0]);<a name="l00169"></a>00169 x1 += key[i*6+1];<a name="l00170"></a>00170 x2 += key[i*6+2];<a name="l00171"></a>00171 MUL(x3, key[i*6+3]);<a name="l00172"></a>00172 t0 = x0^x2; <a name="l00173"></a>00173 MUL(t0, key[i*6+4]);<a name="l00174"></a>00174 t1 = t0 + (x1^x3);<a name="l00175"></a>00175 MUL(t1, key[i*6+5]);<a name="l00176"></a>00176 t0 += t1;<a name="l00177"></a>00177 x0 ^= t1;<a name="l00178"></a>00178 x3 ^= t0;<a name="l00179"></a>00179 t0 ^= x1;<a name="l00180"></a>00180 x1 = x2^t1;<a name="l00181"></a>00181 x2 = t0;<a name="l00182"></a>00182 }<a name="l00183"></a>00183 <a name="l00184"></a>00184 MUL(x0, key[ROUNDS*6+0]);<a name="l00185"></a>00185 x2 += key[ROUNDS*6+1];<a name="l00186"></a>00186 x1 += key[ROUNDS*6+2];<a name="l00187"></a>00187 MUL(x3, key[ROUNDS*6+3]);<a name="l00188"></a>00188 <a name="l00189"></a>00189 <a class="code" href="struct_block_get_and_put.html#63d96a17e8118407e02896d0b0f8d92d">Block::Put</a>(xorBlock, outBlock)(x0)(x2)(x1)(x3);<a name="l00190"></a>00190 }<a name="l00191"></a>00191 <a name="l00192"></a>00192 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 <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 + -