📄 safer_8cpp-source.html
字号:
<a name="l00070"></a>00070 kb[BLOCKSIZE] = 0;<a name="l00071"></a>00071 <span class="keywordflow">for</span> (j = 0; j < BLOCKSIZE; j++)<a name="l00072"></a>00072 {<a name="l00073"></a>00073 ka[BLOCKSIZE] ^= ka[j] = rotlFixed(userkey_1[j], 5U);<a name="l00074"></a>00074 kb[BLOCKSIZE] ^= kb[j] = *key++ = userkey_2[j];<a name="l00075"></a>00075 }<a name="l00076"></a>00076 <a name="l00077"></a>00077 <span class="keywordflow">for</span> (i = 1; i <= nof_rounds; i++)<a name="l00078"></a>00078 {<a name="l00079"></a>00079 <span class="keywordflow">for</span> (j = 0; j < BLOCKSIZE + 1; j++)<a name="l00080"></a>00080 {<a name="l00081"></a>00081 ka[j] = rotlFixed(ka[j], 6U);<a name="l00082"></a>00082 kb[j] = rotlFixed(kb[j], 6U);<a name="l00083"></a>00083 }<a name="l00084"></a>00084 <span class="keywordflow">for</span> (j = 0; j < BLOCKSIZE; j++)<a name="l00085"></a>00085 <span class="keywordflow">if</span> (strengthened)<a name="l00086"></a>00086 *key++ = (ka[(j + 2 * i - 1) % (BLOCKSIZE + 1)]<a name="l00087"></a>00087 + <a class="code" href="class_s_a_f_e_r_1_1_base.html#fc85e8b4c25fa113bfd17e030b376b33">exp_tab</a>[<a class="code" href="class_s_a_f_e_r_1_1_base.html#fc85e8b4c25fa113bfd17e030b376b33">exp_tab</a>[18 * i + j + 1]]) & 0xFF;<a name="l00088"></a>00088 <span class="keywordflow">else</span><a name="l00089"></a>00089 *key++ = (ka[j] + <a class="code" href="class_s_a_f_e_r_1_1_base.html#fc85e8b4c25fa113bfd17e030b376b33">exp_tab</a>[<a class="code" href="class_s_a_f_e_r_1_1_base.html#fc85e8b4c25fa113bfd17e030b376b33">exp_tab</a>[18 * i + j + 1]]) & 0xFF;<a name="l00090"></a>00090 <span class="keywordflow">for</span> (j = 0; j < BLOCKSIZE; j++)<a name="l00091"></a>00091 <span class="keywordflow">if</span> (strengthened)<a name="l00092"></a>00092 *key++ = (kb[(j + 2 * i) % (BLOCKSIZE + 1)]<a name="l00093"></a>00093 + <a class="code" href="class_s_a_f_e_r_1_1_base.html#fc85e8b4c25fa113bfd17e030b376b33">exp_tab</a>[<a class="code" href="class_s_a_f_e_r_1_1_base.html#fc85e8b4c25fa113bfd17e030b376b33">exp_tab</a>[18 * i + j + 10]]) & 0xFF;<a name="l00094"></a>00094 <span class="keywordflow">else</span><a name="l00095"></a>00095 *key++ = (kb[j] + <a class="code" href="class_s_a_f_e_r_1_1_base.html#fc85e8b4c25fa113bfd17e030b376b33">exp_tab</a>[<a class="code" href="class_s_a_f_e_r_1_1_base.html#fc85e8b4c25fa113bfd17e030b376b33">exp_tab</a>[18 * i + j + 10]]) & 0xFF;<a name="l00096"></a>00096 }<a name="l00097"></a>00097 }<a name="l00098"></a>00098 <a name="l00099"></a>00099 <span class="keyword">typedef</span> <a class="code" href="struct_block_get_and_put.html">BlockGetAndPut<byte, BigEndian></a> <a class="code" href="struct_block_get_and_put.html">Block</a>;<a name="l00100"></a>00100 <a name="l00101"></a><a class="code" href="class_s_a_f_e_r_1_1_enc.html#300fcdad081a887bcd9c37bb6e950b0d">00101</a> <span class="keywordtype">void</span> <a class="code" href="class_s_a_f_e_r_1_1_enc.html#300fcdad081a887bcd9c37bb6e950b0d" title="encrypt or decrypt inBlock, xor with xorBlock, and write to outBlock">SAFER::Enc::ProcessAndXorBlock</a>(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span><a name="l00102"></a>00102 <span class="keyword"></span>{<a name="l00103"></a>00103 byte a, b, c, d, e, f, g, h, t;<a name="l00104"></a>00104 <span class="keyword">const</span> byte *key = <a class="code" href="class_s_a_f_e_r_1_1_base.html#7a0b1cf722b42cbadc175cf6ff93366d">keySchedule</a>+1;<a name="l00105"></a>00105 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> round = <a class="code" href="class_s_a_f_e_r_1_1_base.html#7a0b1cf722b42cbadc175cf6ff93366d">keySchedule</a>[0];<a name="l00106"></a>00106 <a name="l00107"></a>00107 <a class="code" href="struct_block_get_and_put.html#07781cc0817613fe47e8070999cf4b95">Block::Get</a>(inBlock)(a)(b)(c)(d)(e)(f)(g)(h);<a name="l00108"></a>00108 <span class="keywordflow">while</span>(round--)<a name="l00109"></a>00109 {<a name="l00110"></a>00110 a ^= key[0]; b += key[1]; c += key[2]; d ^= key[3];<a name="l00111"></a>00111 e ^= key[4]; f += key[5]; g += key[6]; h ^= key[7];<a name="l00112"></a>00112 a = EXP(a) + key[ 8]; b = LOG(b) ^ key[ 9];<a name="l00113"></a>00113 c = LOG(c) ^ key[10]; d = EXP(d) + key[11];<a name="l00114"></a>00114 e = EXP(e) + key[12]; f = LOG(f) ^ key[13];<a name="l00115"></a>00115 g = LOG(g) ^ key[14]; h = EXP(h) + key[15];<a name="l00116"></a>00116 key += 16;<a name="l00117"></a>00117 PHT(a, b); PHT(c, d); PHT(e, f); PHT(g, h);<a name="l00118"></a>00118 PHT(a, c); PHT(e, g); PHT(b, d); PHT(f, h);<a name="l00119"></a>00119 PHT(a, e); PHT(b, f); PHT(c, g); PHT(d, h);<a name="l00120"></a>00120 t = b; b = e; e = c; c = t; t = d; d = f; f = g; g = t;<a name="l00121"></a>00121 }<a name="l00122"></a>00122 a ^= key[0]; b += key[1]; c += key[2]; d ^= key[3];<a name="l00123"></a>00123 e ^= key[4]; f += key[5]; g += key[6]; h ^= key[7];<a name="l00124"></a>00124 <a class="code" href="struct_block_get_and_put.html#63d96a17e8118407e02896d0b0f8d92d">Block::Put</a>(xorBlock, outBlock)(a)(b)(c)(d)(e)(f)(g)(h);<a name="l00125"></a>00125 }<a name="l00126"></a>00126 <a name="l00127"></a><a class="code" href="class_s_a_f_e_r_1_1_dec.html#e6bc60a72b987972953da0e386e01dd0">00127</a> <span class="keywordtype">void</span> <a class="code" href="class_s_a_f_e_r_1_1_dec.html#e6bc60a72b987972953da0e386e01dd0" title="encrypt or decrypt inBlock, xor with xorBlock, and write to outBlock">SAFER::Dec::ProcessAndXorBlock</a>(<span class="keyword">const</span> byte *inBlock, <span class="keyword">const</span> byte *xorBlock, byte *outBlock)<span class="keyword"> const</span><a name="l00128"></a>00128 <span class="keyword"></span>{<a name="l00129"></a>00129 byte a, b, c, d, e, f, g, h, t;<a name="l00130"></a>00130 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> round = <a class="code" href="class_s_a_f_e_r_1_1_base.html#7a0b1cf722b42cbadc175cf6ff93366d">keySchedule</a>[0];<a name="l00131"></a>00131 <span class="keyword">const</span> byte *key = <a class="code" href="class_s_a_f_e_r_1_1_base.html#7a0b1cf722b42cbadc175cf6ff93366d">keySchedule</a> + BLOCKSIZE * (1 + 2 * round) - 7;<a name="l00132"></a>00132 <a name="l00133"></a>00133 <a class="code" href="struct_block_get_and_put.html#07781cc0817613fe47e8070999cf4b95">Block::Get</a>(inBlock)(a)(b)(c)(d)(e)(f)(g)(h);<a name="l00134"></a>00134 h ^= key[7]; g -= key[6]; f -= key[5]; e ^= key[4];<a name="l00135"></a>00135 d ^= key[3]; c -= key[2]; b -= key[1]; a ^= key[0];<a name="l00136"></a>00136 <span class="keywordflow">while</span> (round--)<a name="l00137"></a>00137 {<a name="l00138"></a>00138 key -= 16;<a name="l00139"></a>00139 t = e; e = b; b = c; c = t; t = f; f = d; d = g; g = t;<a name="l00140"></a>00140 IPHT(a, e); IPHT(b, f); IPHT(c, g); IPHT(d, h);<a name="l00141"></a>00141 IPHT(a, c); IPHT(e, g); IPHT(b, d); IPHT(f, h);<a name="l00142"></a>00142 IPHT(a, b); IPHT(c, d); IPHT(e, f); IPHT(g, h);<a name="l00143"></a>00143 h -= key[15]; g ^= key[14]; f ^= key[13]; e -= key[12];<a name="l00144"></a>00144 d -= key[11]; c ^= key[10]; b ^= key[9]; a -= key[8];<a name="l00145"></a>00145 h = LOG(h) ^ key[7]; g = EXP(g) - key[6];<a name="l00146"></a>00146 f = EXP(f) - key[5]; e = LOG(e) ^ key[4];<a name="l00147"></a>00147 d = LOG(d) ^ key[3]; c = EXP(c) - key[2];<a name="l00148"></a>00148 b = EXP(b) - key[1]; a = LOG(a) ^ key[0];<a name="l00149"></a>00149 }<a name="l00150"></a>00150 <a class="code" href="struct_block_get_and_put.html#63d96a17e8118407e02896d0b0f8d92d">Block::Put</a>(xorBlock, outBlock)(a)(b)(c)(d)(e)(f)(g)(h);<a name="l00151"></a>00151 }<a name="l00152"></a>00152 <a name="l00153"></a>00153 NAMESPACE_END</pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:24 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 + -