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

📄 rijndael_8cpp-source.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 4 页
字号:
<a name="l00508"></a>00508 <a name="l00509"></a>00509                 t0 = rk[4]; t1 = rk[5]; t2 = rk[6]; t3 = rk[7];<a name="l00510"></a>00510 <a name="l00511"></a>00511                 QUARTER_ROUND(s3, t0, t1, t2, t3)<a name="l00512"></a>00512                 QUARTER_ROUND(s2, t3, t0, t1, t2)<a name="l00513"></a>00513                 QUARTER_ROUND(s1, t2, t3, t0, t1)<a name="l00514"></a>00514                 QUARTER_ROUND(s0, t1, t2, t3, t0)<a name="l00515"></a>00515 <span class="preprocessor">#undef QUARTER_ROUND</span><a name="l00516"></a>00516 <span class="preprocessor"></span><a name="l00517"></a>00517         rk += 8;<a name="l00518"></a>00518     } <span class="keywordflow">while</span> (--r);<a name="l00519"></a>00519 <a name="l00520"></a>00520         <span class="comment">// timing attack countermeasure. see comments at top for more details</span><a name="l00521"></a>00521         u = 0;<a name="l00522"></a>00522         <span class="keywordflow">for</span> (i=0; i&lt;256; i+=cacheLineSize)<a name="l00523"></a>00523                 u &amp;= *(<span class="keyword">const</span> word32 *)(Se+i);<a name="l00524"></a>00524         u &amp;= *(<span class="keyword">const</span> word32 *)(Se+252);<a name="l00525"></a>00525         t0 |= u; t1 |= u; t2 |= u; t3 |= u;<a name="l00526"></a>00526 <a name="l00527"></a>00527         word32 tbw[4];<a name="l00528"></a>00528         byte *<span class="keyword">const</span> tempBlock = (byte *)tbw;<a name="l00529"></a>00529         word32 *<span class="keyword">const</span> obw = (word32 *)outBlock;<a name="l00530"></a>00530         <span class="keyword">const</span> word32 *<span class="keyword">const</span> xbw = (<span class="keyword">const</span> word32 *)xorBlock;<a name="l00531"></a>00531 <a name="l00532"></a>00532 <span class="preprocessor">#define QUARTER_ROUND(t, a, b, c, d)    \</span><a name="l00533"></a>00533 <span class="preprocessor">        tempBlock[a] = Se[byte(t)]; t &gt;&gt;= 8;\</span><a name="l00534"></a>00534 <span class="preprocessor">        tempBlock[b] = Se[byte(t)]; t &gt;&gt;= 8;\</span><a name="l00535"></a>00535 <span class="preprocessor">        tempBlock[c] = Se[byte(t)]; t &gt;&gt;= 8;\</span><a name="l00536"></a>00536 <span class="preprocessor">        tempBlock[d] = Se[t];</span><a name="l00537"></a>00537 <span class="preprocessor"></span><a name="l00538"></a>00538         QUARTER_ROUND(t2, 15, 2, 5, 8)<a name="l00539"></a>00539         QUARTER_ROUND(t1, 11, 14, 1, 4)<a name="l00540"></a>00540         QUARTER_ROUND(t0, 7, 10, 13, 0)<a name="l00541"></a>00541         QUARTER_ROUND(t3, 3, 6, 9, 12)<a name="l00542"></a>00542 <span class="preprocessor">#undef QUARTER_ROUND</span><a name="l00543"></a>00543 <span class="preprocessor"></span><a name="l00544"></a>00544         <span class="keywordflow">if</span> (xbw)<a name="l00545"></a>00545         {<a name="l00546"></a>00546                 obw[0] = tbw[0] ^ xbw[0] ^ rk[0];<a name="l00547"></a>00547                 obw[1] = tbw[1] ^ xbw[1] ^ rk[1];<a name="l00548"></a>00548                 obw[2] = tbw[2] ^ xbw[2] ^ rk[2];<a name="l00549"></a>00549                 obw[3] = tbw[3] ^ xbw[3] ^ rk[3];<a name="l00550"></a>00550         }<a name="l00551"></a>00551         <span class="keywordflow">else</span><a name="l00552"></a>00552         {<a name="l00553"></a>00553                 obw[0] = tbw[0] ^ rk[0];<a name="l00554"></a>00554                 obw[1] = tbw[1] ^ rk[1];<a name="l00555"></a>00555                 obw[2] = tbw[2] ^ rk[2];<a name="l00556"></a>00556                 obw[3] = tbw[3] ^ rk[3];<a name="l00557"></a>00557         }<a name="l00558"></a>00558         }<a name="l00559"></a>00559 }<a name="l00560"></a>00560 <a name="l00561"></a>00561 <span class="keywordtype">void</span> Rijndael::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="l00562"></a>00562 <span class="keyword"></span>{<a name="l00563"></a>00563         word32 s0, s1, s2, s3, t0, t1, t2, t3;<a name="l00564"></a>00564         <span class="keyword">const</span> word32 *rk = m_key;<a name="l00565"></a>00565 <a name="l00566"></a>00566         s0 = ((<span class="keyword">const</span> word32 *)inBlock)[0] ^ rk[0];<a name="l00567"></a>00567         s1 = ((<span class="keyword">const</span> word32 *)inBlock)[1] ^ rk[1];<a name="l00568"></a>00568         s2 = ((<span class="keyword">const</span> word32 *)inBlock)[2] ^ rk[2];<a name="l00569"></a>00569         s3 = ((<span class="keyword">const</span> word32 *)inBlock)[3] ^ rk[3];<a name="l00570"></a>00570         t0 = rk[4];<a name="l00571"></a>00571         t1 = rk[5];<a name="l00572"></a>00572         t2 = rk[6];<a name="l00573"></a>00573         t3 = rk[7];<a name="l00574"></a>00574         rk += 8;<a name="l00575"></a>00575 <a name="l00576"></a>00576         <span class="comment">// timing attack countermeasure. see comments at top for more details</span><a name="l00577"></a>00577         <span class="keyword">const</span> <span class="keywordtype">int</span> cacheLineSize = GetCacheLineSize();<a name="l00578"></a>00578         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;<a name="l00579"></a>00579         word32 u = 0;<a name="l00580"></a>00580         <span class="keywordflow">for</span> (i=0; i&lt;1024; i+=cacheLineSize)<a name="l00581"></a>00581                 u &amp;= *(<span class="keyword">const</span> word32 *)(((<span class="keyword">const</span> byte *)Td)+i);<a name="l00582"></a>00582         u &amp;= Td[255];<a name="l00583"></a>00583         s0 |= u; s1 |= u; s2 |= u; s3 |= u;<a name="l00584"></a>00584 <a name="l00585"></a>00585         <span class="comment">// first round</span><a name="l00586"></a>00586 <span class="preprocessor">#ifdef IS_BIG_ENDIAN</span><a name="l00587"></a>00587 <span class="preprocessor"></span><span class="preprocessor">#define QUARTER_ROUND(t, a, b, c, d)    \</span><a name="l00588"></a>00588 <span class="preprocessor">                a ^= rotrFixed(Td[byte(t)], 24);        t &gt;&gt;= 8;\</span><a name="l00589"></a>00589 <span class="preprocessor">                b ^= rotrFixed(Td[byte(t)], 16);        t &gt;&gt;= 8;\</span><a name="l00590"></a>00590 <span class="preprocessor">                c ^= rotrFixed(Td[byte(t)], 8);         t &gt;&gt;= 8;\</span><a name="l00591"></a>00591 <span class="preprocessor">                d ^= Td[t];</span><a name="l00592"></a>00592 <span class="preprocessor"></span><span class="preprocessor">#else</span><a name="l00593"></a>00593 <span class="preprocessor"></span><span class="preprocessor">#define QUARTER_ROUND(t, a, b, c, d)    \</span><a name="l00594"></a>00594 <span class="preprocessor">                d ^= Td[byte(t)];                                       t &gt;&gt;= 8;\</span><a name="l00595"></a>00595 <span class="preprocessor">                c ^= rotrFixed(Td[byte(t)], 8);         t &gt;&gt;= 8;\</span><a name="l00596"></a>00596 <span class="preprocessor">                b ^= rotrFixed(Td[byte(t)], 16);        t &gt;&gt;= 8;\</span><a name="l00597"></a>00597 <span class="preprocessor">                a ^= rotrFixed(Td[t], 24);</span><a name="l00598"></a>00598 <span class="preprocessor"></span><span class="preprocessor">#endif</span><a name="l00599"></a>00599 <span class="preprocessor"></span><a name="l00600"></a>00600         QUARTER_ROUND(s3, t2, t1, t0, t3)<a name="l00601"></a>00601         QUARTER_ROUND(s2, t1, t0, t3, t2)<a name="l00602"></a>00602         QUARTER_ROUND(s1, t0, t3, t2, t1)<a name="l00603"></a>00603         QUARTER_ROUND(s0, t3, t2, t1, t0)<a name="l00604"></a>00604 <span class="preprocessor">#undef QUARTER_ROUND</span><a name="l00605"></a>00605 <span class="preprocessor"></span><a name="l00606"></a>00606         <span class="comment">// Nr - 2 full rounds:</span><a name="l00607"></a>00607     <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> r = m_rounds/2 - 1;<a name="l00608"></a>00608     <span class="keywordflow">do</span><a name="l00609"></a>00609         {<a name="l00610"></a>00610 <span class="preprocessor">#define QUARTER_ROUND(t, a, b, c, d)    \</span><a name="l00611"></a>00611 <span class="preprocessor">                a ^= Td[3*256+byte(t)]; t &gt;&gt;= 8;\</span><a name="l00612"></a>00612 <span class="preprocessor">                b ^= Td[2*256+byte(t)]; t &gt;&gt;= 8;\</span><a name="l00613"></a>00613 <span class="preprocessor">                c ^= Td[1*256+byte(t)]; t &gt;&gt;= 8;\</span><a name="l00614"></a>00614 <span class="preprocessor">                d ^= Td[t];</span><a name="l00615"></a>00615 <span class="preprocessor"></span><a name="l00616"></a>00616                 s0 = rk[0]; s1 = rk[1]; s2 = rk[2]; s3 = rk[3];<a name="l00617"></a>00617 <a name="l00618"></a>00618                 QUARTER_ROUND(t3, s2, s1, s0, s3)<a name="l00619"></a>00619                 QUARTER_ROUND(t2, s1, s0, s3, s2)<a name="l00620"></a>00620                 QUARTER_ROUND(t1, s0, s3, s2, s1)<a name="l00621"></a>00621                 QUARTER_ROUND(t0, s3, s2, s1, s0)<a name="l00622"></a>00622 <a name="l00623"></a>00623                 t0 = rk[4]; t1 = rk[5]; t2 = rk[6]; t3 = rk[7];<a name="l00624"></a>00624 <a name="l00625"></a>00625                 QUARTER_ROUND(s3, t2, t1, t0, t3)<a name="l00626"></a>00626                 QUARTER_ROUND(s2, t1, t0, t3, t2)<a name="l00627"></a>00627                 QUARTER_ROUND(s1, t0, t3, t2, t1)<a name="l00628"></a>00628                 QUARTER_ROUND(s0, t3, t2, t1, t0)<a name="l00629"></a>00629 <span class="preprocessor">#undef QUARTER_ROUND</span><a name="l00630"></a>00630 <span class="preprocessor"></span><a name="l00631"></a>00631         rk += 8;<a name="l00632"></a>00632     } <span class="keywordflow">while</span> (--r);<a name="l00633"></a>00633 <a name="l00634"></a>00634         <span class="comment">// timing attack countermeasure. see comments at top for more details</span><a name="l00635"></a>00635         u = 0;<a name="l00636"></a>00636         <span class="keywordflow">for</span> (i=0; i&lt;256; i+=cacheLineSize)<a name="l00637"></a>00637                 u &amp;= *(<span class="keyword">const</span> word32 *)(Sd+i);<a name="l00638"></a>00638         u &amp;= *(<span class="keyword">const</span> word32 *)(Sd+252);<a name="l00639"></a>00639         t0 |= u; t1 |= u; t2 |= u; t3 |= u;<a name="l00640"></a>00640 <a name="l00641"></a>00641         word32 tbw[4];<a name="l00642"></a>00642         byte *<span class="keyword">const</span> tempBlock = (byte *)tbw;<a name="l00643"></a>00643         word32 *<span class="keyword">const</span> obw = (word32 *)outBlock;<a name="l00644"></a>00644         <span class="keyword">const</span> word32 *<span class="keyword">const</span> xbw = (<span class="keyword">const</span> word32 *)xorBlock;<a name="l00645"></a>00645 <a name="l00646"></a>00646 <span class="preprocessor">#define QUARTER_ROUND(t, a, b, c, d)    \</span><a name="l00647"></a>00647 <span class="preprocessor">        tempBlock[a] = Sd[byte(t)]; t &gt;&gt;= 8;\</span><a name="l00648"></a>00648 <span class="preprocessor">        tempBlock[b] = Sd[byte(t)]; t &gt;&gt;= 8;\</span><a name="l00649"></a>00649 <span class="preprocessor">        tempBlock[c] = Sd[byte(t)]; t &gt;&gt;= 8;\</span><a name="l00650"></a>00650 <span class="preprocessor">        tempBlock[d] = Sd[t];</span><a name="l00651"></a>00651 <span class="preprocessor"></span><a name="l00652"></a>00652         QUARTER_ROUND(t2, 7, 2, 13, 8)<a name="l00653"></a>00653         QUARTER_ROUND(t1, 3, 14, 9, 4)<a name="l00654"></a>00654         QUARTER_ROUND(t0, 15, 10, 5, 0)<a name="l00655"></a>00655         QUARTER_ROUND(t3, 11, 6, 1, 12)<a name="l00656"></a>00656 <span class="preprocessor">#undef QUARTER_ROUND</span><a name="l00657"></a>00657 <span class="preprocessor"></span><a name="l00658"></a>00658         <span class="keywordflow">if</span> (xbw)<a name="l00659"></a>00659         {<a name="l00660"></a>00660                 obw[0] = tbw[0] ^ xbw[0] ^ rk[0];<a name="l00661"></a>00661                 obw[1] = tbw[1] ^ xbw[1] ^ rk[1];<a name="l00662"></a>00662                 obw[2] = tbw[2] ^ xbw[2] ^ rk[2];<a name="l00663"></a>00663                 obw[3] = tbw[3] ^ xbw[3] ^ rk[3];<a name="l00664"></a>00664         }<a name="l00665"></a>00665         <span class="keywordflow">else</span><a name="l00666"></a>00666         {<a name="l00667"></a>00667                 obw[0] = tbw[0] ^ rk[0];<a name="l00668"></a>00668                 obw[1] = tbw[1] ^ rk[1];<a name="l00669"></a>00669                 obw[2] = tbw[2] ^ rk[2];<a name="l00670"></a>00670                 obw[3] = tbw[3] ^ rk[3];<a name="l00671"></a>00671         }<a name="l00672"></a>00672 }<a name="l00673"></a>00673 <a name="l00674"></a>00674 NAMESPACE_END<a name="l00675"></a>00675 <a name="l00676"></a>00676 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:24 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 + -