📄 square_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++: square.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>square.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// square.cpp - written and placed in the public domain by Wei Dai</span><a name="l00002"></a>00002 <span class="comment">// Based on Paulo S.L.M. Barreto's public domain implementation</span><a name="l00003"></a>00003 <a name="l00004"></a>00004 <span class="preprocessor">#include "pch.h"</span><a name="l00005"></a>00005 <span class="preprocessor">#include "<a class="code" href="square_8h.html">square.h</a>"</span><a name="l00006"></a>00006 <span class="preprocessor">#include "misc.h"</span><a name="l00007"></a>00007 <span class="preprocessor">#include "gf256.h"</span><a name="l00008"></a>00008 <a name="l00009"></a>00009 NAMESPACE_BEGIN(CryptoPP)<a name="l00010"></a>00010 <a name="l00011"></a>00011 <span class="comment">// apply theta to a roundkey</span><a name="l00012"></a>00012 static <span class="keywordtype">void</span> SquareTransform (word32 in[4], word32 out[4])<a name="l00013"></a>00013 {<a name="l00014"></a>00014 <span class="keyword">static</span> <span class="keyword">const</span> byte G[4][4] = <a name="l00015"></a>00015 {<a name="l00016"></a>00016 0x02U, 0x01U, 0x01U, 0x03U, <a name="l00017"></a>00017 0x03U, 0x02U, 0x01U, 0x01U, <a name="l00018"></a>00018 0x01U, 0x03U, 0x02U, 0x01U, <a name="l00019"></a>00019 0x01U, 0x01U, 0x03U, 0x02U<a name="l00020"></a>00020 };<a name="l00021"></a>00021 <a name="l00022"></a>00022 <a class="code" href="class_g_f256.html" title="GF(256) with polynomial basis.">GF256</a> gf256(0xf5);<a name="l00023"></a>00023 <a name="l00024"></a>00024 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 4; i++)<a name="l00025"></a>00025 {<a name="l00026"></a>00026 word32 temp = 0;<a name="l00027"></a>00027 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < 4; j++)<a name="l00028"></a>00028 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k < 4; k++)<a name="l00029"></a>00029 temp ^= (word32)gf256.Multiply(GETBYTE(in[i], 3-k), G[k][j]) << ((3-j)*8);<a name="l00030"></a>00030 out[i] = temp;<a name="l00031"></a>00031 }<a name="l00032"></a>00032 }<a name="l00033"></a>00033 <a name="l00034"></a>00034 <span class="keywordtype">void</span> Square::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="l00035"></a>00035 {<a name="l00036"></a>00036 AssertValidKeyLength(length);<a name="l00037"></a>00037 <a name="l00038"></a>00038 <span class="keyword">static</span> <span class="keyword">const</span> word32 offset[ROUNDS] = {<a name="l00039"></a>00039 0x01000000UL, 0x02000000UL, 0x04000000UL, 0x08000000UL,<a name="l00040"></a>00040 0x10000000UL, 0x20000000UL, 0x40000000UL, 0x80000000UL,<a name="l00041"></a>00041 };<a name="l00042"></a>00042 <a name="l00043"></a>00043 GetUserKey(<a class="code" href="cryptlib_8h.html#aeb92d42f5a6e27b8ba19f18d69d142bf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, roundkeys[0], KEYLENGTH/4, userKey, KEYLENGTH);<a name="l00044"></a>00044 <a name="l00045"></a>00045 <span class="comment">/* apply the key evolution function */</span><a name="l00046"></a>00046 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < ROUNDS+1; i++)<a name="l00047"></a>00047 {<a name="l00048"></a>00048 roundkeys[i][0] = roundkeys[i-1][0] ^ rotlFixed(roundkeys[i-1][3], 8U) ^ offset[i-1];<a name="l00049"></a>00049 roundkeys[i][1] = roundkeys[i-1][1] ^ roundkeys[i][0];<a name="l00050"></a>00050 roundkeys[i][2] = roundkeys[i-1][2] ^ roundkeys[i][1];<a name="l00051"></a>00051 roundkeys[i][3] = roundkeys[i-1][3] ^ roundkeys[i][2];<a name="l00052"></a>00052 } <a name="l00053"></a>00053 <a name="l00054"></a>00054 <span class="comment">/* produce the round keys */</span><a name="l00055"></a>00055 <span class="keywordflow">if</span> (IsForwardTransformation())<a name="l00056"></a>00056 {<a name="l00057"></a>00057 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ROUNDS; i++)<a name="l00058"></a>00058 SquareTransform (roundkeys[i], roundkeys[i]);<a name="l00059"></a>00059 }<a name="l00060"></a>00060 <span class="keywordflow">else</span><a name="l00061"></a>00061 {<a name="l00062"></a>00062 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ROUNDS/2; i++)<a name="l00063"></a>00063 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < 4; j++)<a name="l00064"></a>00064 <a class="code" href="gf2n_8h.html#cd9c045f0b5c2a7595a8a0872dc80f59">std::swap</a>(roundkeys[i][j], roundkeys[ROUNDS-i][j]);<a name="l00065"></a>00065 SquareTransform (roundkeys[ROUNDS], roundkeys[ROUNDS]);<a name="l00066"></a>00066 }<a name="l00067"></a>00067 }<a name="l00068"></a>00068 <a name="l00069"></a>00069 <span class="preprocessor">#define MSB(x) (((x) >> 24) & 0xffU) </span><span class="comment">/* most significant byte */</span><a name="l00070"></a>00070 <span class="preprocessor">#define SSB(x) (((x) >> 16) & 0xffU) </span><span class="comment">/* second in significance */</span><a name="l00071"></a>00071 <span class="preprocessor">#define TSB(x) (((x) >> 8) & 0xffU) </span><span class="comment">/* third in significance */</span><a name="l00072"></a>00072 <span class="preprocessor">#define LSB(x) (((x) ) & 0xffU) </span><span class="comment">/* least significant byte */</span><a name="l00073"></a>00073 <a name="l00074"></a>00074 <span class="preprocessor">#define squareRound(text, temp, T0, T1, T2, T3, roundkey) \</span><a name="l00075"></a>00075 <span class="preprocessor">{ \</span><a name="l00076"></a>00076 <span class="preprocessor"> temp[0] = T0[MSB (text[0])] \</span><a name="l00077"></a>00077 <span class="preprocessor"> ^ T1[MSB (text[1])] \</span><a name="l00078"></a>00078 <span class="preprocessor"> ^ T2[MSB (text[2])] \</span><a name="l00079"></a>00079 <span class="preprocessor"> ^ T3[MSB (text[3])] \</span><a name="l00080"></a>00080 <span class="preprocessor"> ^ roundkey[0]; \</span>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -