<!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++: gost.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">gost.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="preprocessor">#include "<a class="code" href="pch_8h.html">pch.h</a>"</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="preprocessor">#include "<a class="code" href="gost_8h.html">gost.h</a>"</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor">#include "<a class="code" href="misc_8h.html">misc.h</a>"</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> </div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> </div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// these are the S-boxes given in Applied Cryptography 2nd Ed., p. 333</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="keyword">const</span> byte GOST::Base::sBox[8][16]={</div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span>  {4, 10, 9, 2, 13, 8, 0, 14, 6, 11, 1, 12, 7, 15, 5, 3},</div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>  {14, 11, 4, 12, 6, 13, 15, 10, 2, 3, 8, 1, 0, 7, 5, 9},</div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span>  {5, 8, 1, 13, 10, 3, 4, 2, 14, 15, 12, 7, 6, 0, 9, 11},</div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span>  {7, 13, 10, 1, 0, 8, 9, 15, 14, 4, 6, 12, 11, 2, 5, 3},</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  {6, 12, 7, 1, 5, 15, 13, 8, 4, 10, 9, 14, 0, 3, 11, 2},</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>  {4, 11, 10, 0, 7, 2, 1, 13, 3, 6, 8, 5, 9, 12, 15, 14},</div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  {13, 11, 4, 1, 3, 15, 5, 9, 0, 10, 14, 7, 6, 8, 2, 12},</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  {1, 15, 13, 0, 5, 7, 10, 4, 9, 2, 3, 14, 6, 11, 8, 12}};</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">/* // these are the S-boxes given in the GOST source code listing in Applied</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> // Cryptography 2nd Ed., p. 644. they appear to be from the DES S-boxes</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> {13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7 },</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> { 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1 },</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> {12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11 },</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> { 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9 },</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> { 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15 },</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> {10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8 },</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> {15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10 },</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> {14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7 }};</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">*/</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">volatile</span> <span class="keywordtype">bool</span> GOST::Base::sTableCalculated = <span class="keyword">false</span>;</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> word32 GOST::Base::sTable[4][256];</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keywordtype">void</span> GOST::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="l00034"></a><span class="lineno"> 34</span> {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  AssertValidKeyLength(length);</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  PrecalculateSTable();</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  GetUserKey(<a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a>, m_key.begin(), 8, userKey, KEYLENGTH);</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</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> <span class="keywordtype">void</span> GOST::Base::PrecalculateSTable()</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>  <span class="keywordflow">if</span> (!sTableCalculated)</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < 4; i++)</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0; j < 256; j++)</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>  word32 temp = sBox[2*i][j%16] | (sBox[2*i+1][j/16] << 4);</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  sTable[i][j] = <a class="code" href="misc_8h.html#ad31fe5d559d014085c6a49594b817196">rotlMod</a>(temp, 11+8*i);</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>  sTableCalculated=<span class="keyword">true</span>;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</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> <span class="preprocessor">#define f(x) ( t=x, \</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor"> sTable[3][GETBYTE(t, 3)] ^ sTable[2][GETBYTE(t, 2)] \</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor"> ^ sTable[1][GETBYTE(t, 1)] ^ sTable[0][GETBYTE(t, 0)] )</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">typedef</span> <a class="code" href="struct_block_get_and_put.html">BlockGetAndPut<word32, LittleEndian></a> <a class="code" href="struct_block_get_and_put.html">Block</a>;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">void</span> GOST::Enc::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="l00064"></a><span class="lineno"> 64</span> <span class="keyword"></span>{</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  word32 n1, n2, t;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  Block::Get(inBlock)(n1)(n2);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<3; i++)</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  n2 ^= f(n1+m_key[0]);</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  n1 ^= f(n2+m_key[1]);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  n2 ^= f(n1+m_key[2]);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  n1 ^= f(n2+m_key[3]);</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  n2 ^= f(n1+m_key[4]);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  n1 ^= f(n2+m_key[5]);</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  n2 ^= f(n1+m_key[6]);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  n1 ^= f(n2+m_key[7]);</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> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  n2 ^= f(n1+m_key[7]);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  n1 ^= f(n2+m_key[6]);</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  n2 ^= f(n1+m_key[5]);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  n1 ^= f(n2+m_key[4]);</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  n2 ^= f(n1+m_key[3]);</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  n1 ^= f(n2+m_key[2]);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  n2 ^= f(n1+m_key[1]);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  n1 ^= f(n2+m_key[0]);</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>  <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(n2)(n1);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> }</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="keywordtype">void</span> GOST::Dec::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="l00094"></a><span class="lineno"> 94</span> <span class="keyword"></span>{</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  word32 n1, n2, t;</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>  Block::Get(inBlock)(n1)(n2);</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  n2 ^= f(n1+m_key[0]);</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  n1 ^= f(n2+m_key[1]);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  n2 ^= f(n1+m_key[2]);</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  n1 ^= f(n2+m_key[3]);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  n2 ^= f(n1+m_key[4]);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  n1 ^= f(n2+m_key[5]);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  n2 ^= f(n1+m_key[6]);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  n1 ^= f(n2+m_key[7]);</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<3; i++)</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>  n2 ^= f(n1+m_key[7]);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  n1 ^= f(n2+m_key[6]);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  n2 ^= f(n1+m_key[5]);</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  n1 ^= f(n2+m_key[4]);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  n2 ^= f(n1+m_key[3]);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  n1 ^= f(n2+m_key[2]);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  n2 ^= f(n1+m_key[1]);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  n1 ^= f(n2+m_key[0]);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</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>  <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(n2)(n1);</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> 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="gost_8h_html"><div class="ttname"><a href="gost_8h.html">gost.h</a></div><div class="ttdoc">Classes for the GIST block cipher. </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="cryptlib_8h_html_aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2"><div class="ttname"><a href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a></div><div class="ttdoc">byte order is little-endian </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00142">cryptlib.h:142</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_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_ad31fe5d559d014085c6a49594b817196"><div class="ttname"><a href="misc_8h.html#ad31fe5d559d014085c6a49594b817196">rotlMod</a></div><div class="ttdeci">T rotlMod(T x, unsigned int y)</div><div class="ttdoc">Performs a left rotate. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l01502">misc.h:1502</a></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:53 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
>
2372
