📄 rijndael_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++: rijndael.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>rijndael.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// rijndael.cpp - modified by Chris Morgan <cmorgan@wpi.edu></span><a name="l00002"></a>00002 <span class="comment">// and Wei Dai from Paulo Baretto's Rijndael implementation</span><a name="l00003"></a>00003 <span class="comment">// The original code and all modifications are in the public domain.</span><a name="l00004"></a>00004 <a name="l00005"></a>00005 <span class="comment">/*</span><a name="l00006"></a>00006 <span class="comment">Defense against timing attacks was added in July 2006 by Wei Dai.</span><a name="l00007"></a>00007 <span class="comment"></span><a name="l00008"></a>00008 <span class="comment">The code now uses smaller tables in the first and last rounds,</span><a name="l00009"></a>00009 <span class="comment">and preloads them into L1 cache before usage (by loading at least </span><a name="l00010"></a>00010 <span class="comment">one element in each cache line). </span><a name="l00011"></a>00011 <span class="comment"></span><a name="l00012"></a>00012 <span class="comment">We try to delay subsequent accesses to each table (used in the first </span><a name="l00013"></a>00013 <span class="comment">and last rounds) until all of the table has been preloaded. Hopefully</span><a name="l00014"></a>00014 <span class="comment">the compiler isn't smart enough to optimize that code away.</span><a name="l00015"></a>00015 <span class="comment"></span><a name="l00016"></a>00016 <span class="comment">After preloading the table, we also try not to access any memory location</span><a name="l00017"></a>00017 <span class="comment">other than the table and the stack, in order to prevent table entries from </span><a name="l00018"></a>00018 <span class="comment">being unloaded from L1 cache, until that round is finished.</span><a name="l00019"></a>00019 <span class="comment">(Some popular CPUs have 2-way associative caches.)</span><a name="l00020"></a>00020 <span class="comment">*/</span><a name="l00021"></a>00021 <a name="l00022"></a>00022 <span class="comment">// This is the original introductory comment:</span><a name="l00023"></a>00023 <span class="comment"></span><a name="l00024"></a>00024 <span class="comment">/**</span><a name="l00025"></a>00025 <span class="comment"> * version 3.0 (December 2000)</span><a name="l00026"></a>00026 <span class="comment"> *</span><a name="l00027"></a>00027 <span class="comment"> * Optimised ANSI C code for the Rijndael cipher (now AES)</span><a name="l00028"></a>00028 <span class="comment"> *</span><a name="l00029"></a>00029 <span class="comment"> * author Vincent Rijmen <vincent.rijmen@esat.kuleuven.ac.be></span><a name="l00030"></a>00030 <span class="comment"> * author Antoon Bosselaers <antoon.bosselaers@esat.kuleuven.ac.be></span><a name="l00031"></a>00031 <span class="comment"> * author Paulo Barreto <paulo.barreto@terra.com.br></span><a name="l00032"></a>00032 <span class="comment"> *</span><a name="l00033"></a>00033 <span class="comment"> * This code is hereby placed in the public domain.</span><a name="l00034"></a>00034 <span class="comment"> *</span><a name="l00035"></a>00035 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS</span><a name="l00036"></a>00036 <span class="comment"> * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED</span><a name="l00037"></a>00037 <span class="comment"> * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span><a name="l00038"></a>00038 <span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE</span><a name="l00039"></a>00039 <span class="comment"> * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR</span><a name="l00040"></a>00040 <span class="comment"> * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF</span><a name="l00041"></a>00041 <span class="comment"> * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR</span><a name="l00042"></a>00042 <span class="comment"> * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,</span><a name="l00043"></a>00043 <span class="comment"> * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE</span><a name="l00044"></a>00044 <span class="comment"> * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,</span><a name="l00045"></a>00045 <span class="comment"> * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span><a name="l00046"></a>00046 <span class="comment"> */</span><a name="l00047"></a>00047 <a name="l00048"></a>00048 <span class="preprocessor">#include "pch.h"</span><a name="l00049"></a>00049 <a name="l00050"></a>00050 <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span><a name="l00051"></a>00051 <span class="preprocessor"></span><a name="l00052"></a>00052 <span class="preprocessor">#include "<a class="code" href="rijndael_8h.html">rijndael.h</a>"</span><a name="l00053"></a>00053 <span class="preprocessor">#include "misc.h"</span><a name="l00054"></a>00054 <span class="preprocessor">#include "cpu.h"</span><a name="l00055"></a>00055 <a name="l00056"></a>00056 NAMESPACE_BEGIN(CryptoPP)<a name="l00057"></a>00057 <a name="l00058"></a>00058 void <a class="code" href="class_rijndael.html" title="Rijndael">Rijndael</a>::Base::UncheckedSetKey(const byte *userKey, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> keylen, const <a class="code" href="class_name_value_pairs.html" title="interface for retrieving values given their names">NameValuePairs</a> &)<a name="l00059"></a>00059 {<a name="l00060"></a>00060 AssertValidKeyLength(keylen);<a name="l00061"></a>00061 <a name="l00062"></a>00062 m_rounds = keylen/4 + 6;<a name="l00063"></a>00063 m_key.New(4*(m_rounds+1));<a name="l00064"></a>00064 <a name="l00065"></a>00065 word32 temp, *rk = m_key;<a name="l00066"></a>00066 <span class="keyword">const</span> word32 *rc = rcon;<a name="l00067"></a>00067 <a name="l00068"></a>00068 GetUserKey(<a class="code" href="cryptlib_8h.html#aeb92d42f5a6e27b8ba19f18d69d142bf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, rk, keylen/4, userKey, keylen);<a name="l00069"></a>00069 <a name="l00070"></a>00070 <span class="keywordflow">while</span> (<span class="keyword">true</span>)<a name="l00071"></a>00071 {<a name="l00072"></a>00072 temp = rk[keylen/4-1];<a name="l00073"></a>00073 rk[keylen/4] = rk[0] ^<a name="l00074"></a>00074 (word32(Se[GETBYTE(temp, 2)]) << 24) ^<a name="l00075"></a>00075 (word32(Se[GETBYTE(temp, 1)]) << 16) ^<a name="l00076"></a>00076 (word32(Se[GETBYTE(temp, 0)]) << 8) ^<a name="l00077"></a>00077 Se[GETBYTE(temp, 3)] ^<a name="l00078"></a>00078 *(rc++);<a name="l00079"></a>00079 rk[keylen/4+1] = rk[1] ^ rk[keylen/4];<a name="l00080"></a>00080 rk[keylen/4+2] = rk[2] ^ rk[keylen/4+1];<a name="l00081"></a>00081 rk[keylen/4+3] = rk[3] ^ rk[keylen/4+2];<a name="l00082"></a>00082 <a name="l00083"></a>00083 <span class="keywordflow">if</span> (rk + keylen/4 + 4 == m_key.end())<a name="l00084"></a>00084 <span class="keywordflow">break</span>;<a name="l00085"></a>00085 <a name="l00086"></a>00086 <span class="keywordflow">if</span> (keylen == 24)<a name="l00087"></a>00087 {<a name="l00088"></a>00088 rk[10] = rk[ 4] ^ rk[ 9];<a name="l00089"></a>00089 rk[11] = rk[ 5] ^ rk[10];<a name="l00090"></a>00090 }<a name="l00091"></a>00091 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (keylen == 32)<a name="l00092"></a>00092 {<a name="l00093"></a>00093 temp = rk[11];<a name="l00094"></a>00094 rk[12] = rk[ 4] ^<a name="l00095"></a>00095 (word32(Se[GETBYTE(temp, 3)]) << 24) ^<a name="l00096"></a>00096 (word32(Se[GETBYTE(temp, 2)]) << 16) ^<a name="l00097"></a>00097 (word32(Se[GETBYTE(temp, 1)]) << 8) ^<a name="l00098"></a>00098 Se[GETBYTE(temp, 0)];<a name="l00099"></a>00099 rk[13] = rk[ 5] ^ rk[12];<a name="l00100"></a>00100 rk[14] = rk[ 6] ^ rk[13];<a name="l00101"></a>00101 rk[15] = rk[ 7] ^ rk[14];<a name="l00102"></a>00102 }<a name="l00103"></a>00103 rk += keylen/4;<a name="l00104"></a>00104 }<a name="l00105"></a>00105 <a name="l00106"></a>00106 <span class="keywordflow">if</span> (!IsForwardTransformation())<a name="l00107"></a>00107 {<a name="l00108"></a>00108 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, j;<a name="l00109"></a>00109 rk = m_key;<a name="l00110"></a>00110 <a name="l00111"></a>00111 <span class="comment">/* invert the order of the round keys: */</span><a name="l00112"></a>00112 <span class="keywordflow">for</span> (i = 0, j = 4*m_rounds; i < j; i += 4, j -= 4) {<a name="l00113"></a>00113 temp = rk[i ]; rk[i ] = rk[j ]; rk[j ] = temp;<a name="l00114"></a>00114 temp = rk[i + 1]; rk[i + 1] = rk[j + 1]; rk[j + 1] = temp;<a name="l00115"></a>00115 temp = rk[i + 2]; rk[i + 2] = rk[j + 2]; rk[j + 2] = temp;<a name="l00116"></a>00116 temp = rk[i + 3]; rk[i + 3] = rk[j + 3]; rk[j + 3] = temp;<a name="l00117"></a>00117 }<a name="l00118"></a>00118 <span class="comment">/* apply the inverse MixColumn transform to all round keys but the first and the last: */</span><a name="l00119"></a>00119 <span class="keywordflow">for</span> (i = 1; i < m_rounds; i++) {<a name="l00120"></a>00120 rk += 4;<a name="l00121"></a>00121 rk[0] =<a name="l00122"></a>00122 Td[0*256+Se[GETBYTE(rk[0], 3)]] ^<a name="l00123"></a>00123 Td[1*256+Se[GETBYTE(rk[0], 2)]] ^<a name="l00124"></a>00124 Td[2*256+Se[GETBYTE(rk[0], 1)]] ^<a name="l00125"></a>00125 Td[3*256+Se[GETBYTE(rk[0], 0)]];<a name="l00126"></a>00126 rk[1] =<a name="l00127"></a>00127 Td[0*256+Se[GETBYTE(rk[1], 3)]] ^<a name="l00128"></a>00128 Td[1*256+Se[GETBYTE(rk[1], 2)]] ^<a name="l00129"></a>00129 Td[2*256+Se[GETBYTE(rk[1], 1)]] ^<a name="l00130"></a>00130 Td[3*256+Se[GETBYTE(rk[1], 0)]];<a name="l00131"></a>00131 rk[2] =<a name="l00132"></a>00132 Td[0*256+Se[GETBYTE(rk[2], 3)]] ^<a name="l00133"></a>00133 Td[1*256+Se[GETBYTE(rk[2], 2)]] ^<a name="l00134"></a>00134 Td[2*256+Se[GETBYTE(rk[2], 1)]] ^<a name="l00135"></a>00135 Td[3*256+Se[GETBYTE(rk[2], 0)]];<a name="l00136"></a>00136 rk[3] =<a name="l00137"></a>00137 Td[0*256+Se[GETBYTE(rk[3], 3)]] ^<a name="l00138"></a>00138 Td[1*256+Se[GETBYTE(rk[3], 2)]] ^<a name="l00139"></a>00139 Td[2*256+Se[GETBYTE(rk[3], 1)]] ^<a name="l00140"></a>00140 Td[3*256+Se[GETBYTE(rk[3], 0)]];<a name="l00141"></a>00141 }<a name="l00142"></a>00142 }<a name="l00143"></a>00143 <a name="l00144"></a>00144 ConditionalByteReverse(<a class="code" href="cryptlib_8h.html#aeb92d42f5a6e27b8ba19f18d69d142bf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, m_key.begin(), m_key.begin(), 16);<a name="l00145"></a>00145 ConditionalByteReverse(<a class="code" href="cryptlib_8h.html#aeb92d42f5a6e27b8ba19f18d69d142bf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, m_key + m_rounds*4, m_key + m_rounds*4, 16);<a name="l00146"></a>00146 }<a name="l00147"></a>00147 <a name="l00148"></a>00148 <span class="preprocessor">#pragma warning(disable: 4731) // frame pointer register 'ebp' modified by inline assembly code</span><a name="l00149"></a>00149 <span class="preprocessor"></span><a name="l00150"></a>00150 <span class="keywordtype">void</span> Rijndael::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="l00151"></a>00151 <span class="keyword"></span>{<a name="l00152"></a>00152 <span class="preprocessor">#if defined(CRYPTOPP_X86_ASM_AVAILABLE)</span><a name="l00153"></a>00153 <span class="preprocessor"></span> <span class="keywordflow">if</span> (HasMMX())<a name="l00154"></a>00154 {<a name="l00155"></a>00155 <span class="keyword">const</span> word32 *k = m_key;⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -