<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.14"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Crypto++: idea.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Crypto++
 <span id="projectnumber">7.0</span>
</div>
<div id="projectbrief">Free C++ class library of cryptographic schemes</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.14 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">idea.cpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// idea.cpp - originally written and placed in the public domain by Wei Dai</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor">#include "<a class="code" href="pch_8h.html">pch.h</a>"</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="preprocessor">#include "<a class="code" href="idea_8h.html">idea.h</a>"</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#include "<a class="code" href="misc_8h.html">misc.h</a>"</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#include "<a class="code" href="secblock_8h.html">secblock.h</a>"</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> IDEA_KEYLEN=(6*<a class="code" href="class_fixed_rounds.html#a910701ff30c578368793f5faae246108">IDEA::ROUNDS</a>+4); <span class="comment">// key schedule length in # of word16s</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#define low16(x) ((x)&0xffff) // compiler should be able to optimize this away if word is 16 bits</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#define high16(x) ((x)>>16)</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <a class="code" href="misc_8h.html#a6b378b1b9b2d4654cc852c088742ba70">CRYPTOPP_COMPILE_ASSERT</a>(<span class="keyword">sizeof</span>(IDEA::Word) >= 2);</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// should use an inline function but macros are still faster in MSVC 4.0</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#define DirectMUL(a,b) \</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">{ \</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor"> word32 p=(word32)low16(a)*b; \</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor"> \</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor"> if (p) \</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor"> { \</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor"> p = low16(p) - high16(p); \</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor"> a = (IDEA::Word)p - (IDEA::Word)high16(p); \</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor"> else \</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor"> a = 1-a-b; \</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">}</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#ifdef IDEA_LARGECACHE</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">volatile</span> <span class="keywordtype">bool</span> IDEA::Base::tablesBuilt = <span class="keyword">false</span>;</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> word16 IDEA::Base::log[0x10000];</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> word16 IDEA::Base::antilog[0x10000];</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keywordtype">void</span> IDEA::Base::BuildLogTables()</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> {</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> (tablesBuilt)</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  tablesBuilt = <span class="keyword">true</span>;</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  IDEA::Word x=1;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  word32 i;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">for</span> (i=0; i<0x10000; i++)</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  antilog[i] = (word16)x;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  DirectMUL(x, 3);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  }</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">for</span> (i=0; i<0x10000; i++)</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  log[antilog[i]] = (word16)i;</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> }</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="keywordtype">void</span> IDEA::Base::LookupKeyLogs()</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> {</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  IDEA::Word* Z=key;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordtype">int</span> r=ROUNDS;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">do</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  Z[0] = log[Z[0]];</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  Z[3] = log[Z[3]];</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  Z[4] = log[Z[4]];</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  Z[5] = log[Z[5]];</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  Z+=6;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  } <span class="keywordflow">while</span> (--r);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  Z[0] = log[Z[0]];</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  Z[3] = log[Z[3]];</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> }</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> IDEA::Base::LookupMUL(IDEA::Word &a, IDEA::Word b)</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> {</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  a = antilog[low16(log[low16(a)]+b)];</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> }</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor">#endif // IDEA_LARGECACHE</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="keywordtype">void</span> IDEA::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">NameValuePairs</a> &)</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  AssertValidKeyLength(length);</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor">#ifdef IDEA_LARGECACHE</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  BuildLogTables();</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  EnKey(userKey);</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span> (!IsForwardTransformation())</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  DeKey();</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor">#ifdef IDEA_LARGECACHE</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  LookupKeyLogs();</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="keywordtype">void</span> IDEA::Base::EnKey (<span class="keyword">const</span> byte *userKey)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">for</span> (i=0; i<8; i++)</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  m_key[i] = ((IDEA::Word)userKey[2*i]<<8) | userKey[2*i+1];</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">for</span> (; i<IDEA_KEYLEN; i++)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j = <a class="code" href="misc_8h.html#aa2ac57210cb6796eced074e6d2e294fb">RoundDownToMultipleOf</a>(i,8U)-8;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  m_key[i] = low16((m_key[j+(i+1)%8] << 9) | (m_key[j+(i+2)%8] >> 7));</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="keyword">static</span> IDEA::Word MulInv(IDEA::Word x)</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> {</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  IDEA::Word y=x;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=0; i<15; i++)</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  DirectMUL(y,low16(y));</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  DirectMUL(y,x);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span> low16(y);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> }</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="keyword">static</span> <span class="keyword">inline</span> IDEA::Word AddInv(IDEA::Word x)</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> {</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">return</span> low16(0-x);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="keywordtype">void</span> IDEA::Base::DeKey()</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="class_fixed_size_sec_block.html">FixedSizeSecBlock<IDEA::Word, 6*ROUNDS+4></a> tempkey;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordtype">size_t</span> i;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">for</span> (i=0; i<ROUNDS; i++)</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  tempkey[i*6+0] = MulInv(m_key[(ROUNDS-i)*6+0]);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  tempkey[i*6+1] = AddInv(m_key[(ROUNDS-i)*6+1+(i>0)]);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  tempkey[i*6+2] = AddInv(m_key[(ROUNDS-i)*6+2-(i>0)]);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  tempkey[i*6+3] = MulInv(m_key[(ROUNDS-i)*6+3]);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  tempkey[i*6+4] = m_key[(ROUNDS-1-i)*6+4];</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  tempkey[i*6+5] = m_key[(ROUNDS-1-i)*6+5];</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  tempkey[i*6+0] = MulInv(m_key[(ROUNDS-i)*6+0]);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  tempkey[i*6+1] = AddInv(m_key[(ROUNDS-i)*6+1]);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  tempkey[i*6+2] = AddInv(m_key[(ROUNDS-i)*6+2]);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  tempkey[i*6+3] = MulInv(m_key[(ROUNDS-i)*6+3]);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  m_key = tempkey;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="preprocessor">#ifdef IDEA_LARGECACHE</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor">#define MUL(a,b) LookupMUL(a,b)</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="preprocessor">#define MUL(a,b) DirectMUL(a,b)</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <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></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="keyword"></span>{</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <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>;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">const</span> IDEA::Word *key = m_key;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  IDEA::Word x0,x1,x2,x3,t0,t1;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  Block::Get(inBlock)(x0)(x1)(x2)(x3);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<ROUNDS; i++)</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  {</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  MUL(x0, key[i*6+0]);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  x1 += key[i*6+1];</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  x2 += key[i*6+2];</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  MUL(x3, key[i*6+3]);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  t0 = x0^x2;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  MUL(t0, key[i*6+4]);</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  t1 = t0 + (x1^x3);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  MUL(t1, key[i*6+5]);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  t0 += t1;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  x0 ^= t1;</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  x3 ^= t0;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  t0 ^= x1;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  x1 = x2^t1;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  x2 = t0;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  MUL(x0, key[ROUNDS*6+0]);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  x2 += key[ROUNDS*6+1];</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  x1 += key[ROUNDS*6+2];</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  MUL(x3, key[ROUNDS*6+3]);</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(x0)(x2)(x1)(x3);</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> }</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> NAMESPACE_END</div><div class="ttc" id="misc_8h_html"><div class="ttname"><a href="misc_8h.html">misc.h</a></div><div class="ttdoc">Utility functions for the Crypto++ library. </div></div>
<div class="ttc" id="struct_block_get_and_put_html"><div class="ttname"><a href="struct_block_get_and_put.html">BlockGetAndPut</a></div><div class="ttdoc">Access a block of memory. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l02402">misc.h:2402</a></div></div>
<div class="ttc" id="secblock_8h_html"><div class="ttname"><a href="secblock_8h.html">secblock.h</a></div><div class="ttdoc">Classes and functions for secure memory allocations. </div></div>
<div class="ttc" id="misc_8h_html_a6b378b1b9b2d4654cc852c088742ba70"><div class="ttname"><a href="misc_8h.html#a6b378b1b9b2d4654cc852c088742ba70">CRYPTOPP_COMPILE_ASSERT</a></div><div class="ttdeci">#define CRYPTOPP_COMPILE_ASSERT(expr)</div><div class="ttdoc">Compile time assertion. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00144">misc.h:144</a></div></div>
<div class="ttc" id="pch_8h_html"><div class="ttname"><a href="pch_8h.html">pch.h</a></div><div class="ttdoc">Precompiled header file. </div></div>
<div class="ttc" id="class_fixed_size_sec_block_html"><div class="ttname"><a href="class_fixed_size_sec_block.html">FixedSizeSecBlock</a></div><div class="ttdoc">Fixed size stack-based SecBlock. </div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00841">secblock.h:841</a></div></div>
<div class="ttc" id="class_fixed_rounds_html_a910701ff30c578368793f5faae246108"><div class="ttname"><a href="class_fixed_rounds.html#a910701ff30c578368793f5faae246108">FixedRounds< 8 >::ROUNDS</a></div><div class="ttdeci">static const int ROUNDS</div><div class="ttdoc">The number of rounds for the algorithm provided as a constant. </div><div class="ttdef"><b>Definition:</b> <a href="seckey_8h_source.html#l00079">seckey.h:79</a></div></div>
<div class="ttc" id="class_put_block_html"><div class="ttname"><a href="class_put_block.html">PutBlock</a></div><div class="ttdoc">Access a block of memory. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l02365">misc.h:2365</a></div></div>
<div class="ttc" id="namespace_crypto_p_p_html"><div class="ttname"><a href="namespace_crypto_p_p.html">CryptoPP</a></div><div class="ttdoc">Crypto++ library namespace. </div></div>
<div class="ttc" id="misc_8h_html_aa2ac57210cb6796eced074e6d2e294fb"><div class="ttname"><a href="misc_8h.html#aa2ac57210cb6796eced074e6d2e294fb">RoundDownToMultipleOf</a></div><div class="ttdeci">T1 RoundDownToMultipleOf(const T1 &n, const T2 &m)</div><div class="ttdoc">Rounds a value down to a multiple of a second value. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00941">misc.h:941</a></div></div>
<div class="ttc" id="idea_8h_html"><div class="ttname"><a href="idea_8h.html">idea.h</a></div><div class="ttdoc">Classes for the IDEA block cipher. </div></div>
<div class="ttc" id="class_name_value_pairs_html"><div class="ttname"><a href="class_name_value_pairs.html">NameValuePairs</a></div><div class="ttdoc">Interface for retrieving values given their names. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00290">cryptlib.h:290</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Sun Sep 16 2018 07:57:54 for Crypto++ by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.14
</small></address>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-release
>
by-pkgid
>
0a67b807a02637f2cae68649d519a89d
>
files
>
2396
