<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Crypto++: mars.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.15 -->
<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">mars.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">// mars.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="comment">// includes IBM's key setup "tweak" proposed in August 1999 (http://www.research.ibm.com/security/key-setup.txt)</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> <span class="preprocessor">#include "<a class="code" href="pch_8h.html">pch.h</a>"</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#include "<a class="code" href="mars_8h.html">mars.h</a>"</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include "<a class="code" href="misc_8h.html">misc.h</a>"</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="keywordtype">void</span> MARS::Base::UncheckedSetKey(<span class="keyword">const</span> <span class="keywordtype">byte</span> *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="l00012"></a><span class="lineno"> 12</span> {</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  AssertValidKeyLength(length);</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>  <span class="comment">// Initialize T[] with the key data</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  <a class="code" href="class_fixed_size_sec_block.html">FixedSizeSecBlock<word32, 15></a> T;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  GetUserKey(<a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a>, T.begin(), 15, userKey, length);</div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  T[length/4] = length/4;</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j=0; j<4; j++) <span class="comment">// compute 10 words of K[] in each iteration</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  {</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="comment">// Do linear transformation</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordflow">for</span> (i=0; i<15; i++)</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  T[i] = T[i] ^ rotlConstant<3>(T[(i + 8) % 15] ^ T[(i + 13) % 15]) ^ (4 * i + j);</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="comment">// Do four rounds of stirring</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> k=0; k<4; k++)</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">for</span> (i=0; i<15; i++)</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  T[i] = rotlConstant<9>(T[i] + Sbox[T[(i + 14) % 15] % 512]);</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="comment">// Store next 10 key words into K[]</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">for</span> (i=0; i<10; i++)</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  m_k[10*j+i] = T[4*i%15];</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> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// Modify multiplication key-words</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 5; i < 37; i += 2)</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  word32 m, w = m_k[i] | 3;</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  m = (~w ^ (w<<1)) & (~w ^ (w>>1)) & 0x7ffffffe;</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  m &= m>>1; m &= m>>2; m &= m>>4;</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  m |= m<<1; m |= m<<2; m |= m<<4;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  m &= 0x7ffffffc;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  w ^= <a class="code" href="misc_8h.html#ad31fe5d559d014085c6a49594b817196">rotlMod</a>(Sbox[265 + (m_k[i] & 3)], m_k[i-1]) & m;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  m_k[i] = w;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  }</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> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#define S(a) Sbox[(a)&0x1ff]</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#define S0(a) Sbox[(a)&0xff]</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#define S1(a) Sbox[((a)&0xff) + 256]</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</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="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="keywordtype">void</span> MARS::Enc::ProcessAndXorBlock(<span class="keyword">const</span> <span class="keywordtype">byte</span> *inBlock, <span class="keyword">const</span> <span class="keywordtype">byte</span> *xorBlock, <span class="keywordtype">byte</span> *outBlock)<span class="keyword"> const</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="keyword"></span>{</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  word32 a, b, c, d, l, m, r, t;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> word32 *k = m_k;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  Block::Get(inBlock)(a)(b)(c)(d);</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>  a += k[0]; b += k[1]; c += k[2]; d += k[3];</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">for</span> (i=0; i<8; i++)</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  b = (b ^ S0(a)) + S1(a>>8);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  c += S0(a>>16);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  a = rotrConstant<24>(a);</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  d ^= S1(a);</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  a += (i%4==0) ? d : 0;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  a += (i%4==1) ? b : 0;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  t = a; a = b; b = c; c = d; d = t;</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> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">for</span> (i=0; i<16; i++)</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  t = rotlConstant<13>(a);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  r = rotlConstant<10>(t * k[2 * i + 5]);</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  m = a + k[2*i+4];</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  l = <a class="code" href="misc_8h.html#ad31fe5d559d014085c6a49594b817196">rotlMod</a>((S(m) ^ rotrConstant<5>(r) ^ r), r);</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  c += <a class="code" href="misc_8h.html#ad31fe5d559d014085c6a49594b817196">rotlMod</a>(m, rotrConstant<5>(r));</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  (i<8 ? b : d) += l;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  (i<8 ? d : b) ^= r;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  a = b; b = c; c = d; d = t;</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> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">for</span> (i=0; i<8; i++)</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  {</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  a -= (i%4==2) ? d : 0;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  a -= (i%4==3) ? b : 0;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  b ^= S1(a);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  c -= S0(a>>24);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  t = rotlConstant<24>(a);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  d = (d - S1(a>>16)) ^ S0(t);</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  a = b; b = c; c = d; d = t;</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> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  a -= k[36]; b -= k[37]; c -= k[38]; d -= k[39];</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>  <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(a)(b)(c)(d);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> }</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="keywordtype">void</span> MARS::Dec::ProcessAndXorBlock(<span class="keyword">const</span> <span class="keywordtype">byte</span> *inBlock, <span class="keyword">const</span> <span class="keywordtype">byte</span> *xorBlock, <span class="keywordtype">byte</span> *outBlock)<span class="keyword"> const</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="keyword"></span>{</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  word32 a, b, c, d, l, m, r, t;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">const</span> word32 *k = m_k;</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>  Block::Get(inBlock)(d)(c)(b)(a);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  d += k[36]; c += k[37]; b += k[38]; a += k[39];</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">for</span> (i=0; i<8; 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>  b = (b ^ S0(a)) + S1(a>>8);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  c += S0(a>>16);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  a = rotrConstant<24>(a);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  d ^= S1(a);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  a += (i%4==0) ? d : 0;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  a += (i%4==1) ? b : 0;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  t = a; a = b; b = c; c = d; d = t;</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> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">for</span> (i=0; i<16; i++)</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>  t = rotrConstant<13>(a);</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  r = rotlConstant<10>(a * k[35 - 2 * i]);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  m = t + k[34-2*i];</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  l = <a class="code" href="misc_8h.html#ad31fe5d559d014085c6a49594b817196">rotlMod</a>((S(m) ^ rotrConstant<5>(r) ^ r), r);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  c -= <a class="code" href="misc_8h.html#ad31fe5d559d014085c6a49594b817196">rotlMod</a>(m, rotrConstant<5>(r));</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  (i<8 ? b : d) -= l;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  (i<8 ? d : b) ^= r;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  a = b; b = c; c = d; d = t;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">for</span> (i=0; i<8; i++)</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  a -= (i%4==2) ? d : 0;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  a -= (i%4==3) ? b : 0;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  b ^= S1(a);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  c -= S0(a>>24);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  t = rotlConstant<24>(a);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  d = (d - S1(a>>16)) ^ S0(t);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  a = b; b = c; c = d; d = t;</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> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  d -= k[0]; c -= k[1]; b -= k[2]; a -= k[3];</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>  <a class="code" href="class_put_block.html">Block::Put</a>(xorBlock, outBlock)(d)(c)(b)(a);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> }</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</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="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="mars_8h_html"><div class="ttname"><a href="mars_8h.html">mars.h</a></div><div class="ttdoc">Classes for the MARS block cipher (IBM AES submission)</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_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 Wed Nov 27 2019 15:03:37 for Crypto++ by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.15
</small></address>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
17f48c047155a7d4c992d6a672acd57f
>
files
>
2421
