<!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++: scrypt.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">scrypt.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">// scrypt.cpp - written and placed in public domain by Jeffrey Walton.</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Based on reference source code by Colin Percival for</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Scrypt and Daniel Bernstein for Salsa20 core.</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> </div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include "<a class="code" href="scrypt_8h.html">scrypt.h</a>"</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include "<a class="code" href="algparam_8h.html">algparam.h</a>"</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include "<a class="code" href="argnames_8h.html">argnames.h</a>"</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "<a class="code" href="pwdbased_8h.html">pwdbased.h</a>"</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include "<a class="code" href="stdcpp_8h.html">stdcpp.h</a>"</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include "<a class="code" href="salsa_8h.html">salsa.h</a>"</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include "<a class="code" href="misc_8h.html">misc.h</a>"</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="sha_8h.html">sha.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <sstream></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#ifdef _OPENMP</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor"># include <omp.h></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> ANONYMOUS_NAMESPACE_BEGIN</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">using</span> CryptoPP::byte;</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">using</span> CryptoPP::word32;</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">using</span> CryptoPP::word64;</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">using</span> <a class="code" href="misc_8h.html#a240e8e97f964626508362b59b78532d3">CryptoPP::GetWord</a>;</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">using</span> <a class="code" href="misc_8h.html#aef6a8d35198f71ff68811bacd599c664">CryptoPP::PutWord</a>;</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">using</span> <a class="code" href="salsa_8h.html#affb56f800a7c03d5b0b3d45afa785a49">CryptoPP::Salsa20_Core</a>;</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">using</span> <a class="code" href="misc_8h.html#a0ab6928faa40f6e56e7f4817d5d65a38">CryptoPP::rotlConstant</a>;</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">using</span> <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">CryptoPP::LITTLE_ENDIAN_ORDER</a>;</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">using</span> CryptoPP::AlignedSecByteBlock;</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="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> LE32ENC(byte* out, word32 in)</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>  <a class="code" href="misc_8h.html#aef6a8d35198f71ff68811bacd599c664">PutWord</a>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a>, out, in);</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> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="keyword">static</span> <span class="keyword">inline</span> word32 LE32DEC(<span class="keyword">const</span> byte* in)</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>  <span class="keywordflow">return</span> GetWord<word32>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a>, in);</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> </div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">static</span> <span class="keyword">inline</span> word64 LE64DEC(<span class="keyword">const</span> byte* in)</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> {</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">return</span> GetWord<word64>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baccd5b3585bd07d6bdae383aa8271b9d2">LITTLE_ENDIAN_ORDER</a>, in);</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> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> BlockCopy(byte* dest, byte* src, <span class="keywordtype">size_t</span> len)</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="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < len; ++i)</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  dest[i] = src[i];</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> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> BlockXOR(byte* dest, byte* src, <span class="keywordtype">size_t</span> len)</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="preprocessor"> #pragma omp simd</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < len; ++i)</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  dest[i] ^= src[i];</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> </div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> PBKDF2_SHA256(byte* buf, <span class="keywordtype">size_t</span> dkLen,</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">const</span> byte* passwd, <span class="keywordtype">size_t</span> passwdlen,</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">const</span> byte* salt, <span class="keywordtype">size_t</span> saltlen, byte count)</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">using</span> CryptoPP::SHA256;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">using</span> CryptoPP::PKCS5_PBKDF2_HMAC;</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>  <a class="code" href="class_p_k_c_s5___p_b_k_d_f2___h_m_a_c.html">PKCS5_PBKDF2_HMAC<SHA256></a> pbkdf;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  pbkdf.<a class="code" href="class_p_k_c_s5___p_b_k_d_f2___h_m_a_c.html#ac3b81a978c1d59da9a2d21535e7d5b36">DeriveKey</a>(buf, dkLen, 0, passwd, passwdlen, salt, saltlen, count, 0.0f);</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> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Salsa20_8(byte B[64])</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>  word32 B32[16];</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>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < 16; ++i)</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  B32[i] = LE32DEC(&B[i * 4]);</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>  <a class="code" href="salsa_8h.html#affb56f800a7c03d5b0b3d45afa785a49">Salsa20_Core</a>(B32, 8);</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>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < 16; ++i)</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  LE32ENC(&B[4 * i], B32[i]);</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> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> BlockMix(byte* B, byte* Y, <span class="keywordtype">size_t</span> r)</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  byte X[64];</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="comment">// 1: X <-- B_{2r - 1}</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  BlockCopy(X, &B[(2 * r - 1) * 64], 64);</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>  <span class="comment">// 2: for i = 0 to 2r - 1 do</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < 2 * r; ++i)</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// 3: X <-- H(X \xor B_i)</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  BlockXOR(X, &B[i * 64], 64);</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  Salsa20_8(X);</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>  <span class="comment">// 4: Y_i <-- X</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  BlockCopy(&Y[i * 64], X, 64);</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> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// 6: B' <-- (Y_0, Y_2 ... Y_{2r-2}, Y_1, Y_3 ... Y_{2r-1})</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < r; ++i)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  BlockCopy(&B[i * 64], &Y[(i * 2) * 64], 64);</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="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < r; ++i)</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  BlockCopy(&B[(i + r) * 64], &Y[(i * 2 + 1) * 64], 64);</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> <span class="keyword">static</span> <span class="keyword">inline</span> word64 Integerify(byte* B, <span class="keywordtype">size_t</span> r)</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>  byte* X = &B[(2 * r - 1) * 64];</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> LE64DEC(X);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> }</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> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Smix(byte* B, <span class="keywordtype">size_t</span> r, word64 N, byte* V, byte* XY)</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>  byte* X = XY;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  byte* Y = XY+128*r;</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>  <span class="comment">// 1: X <-- B</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  BlockCopy(X, B, 128 * r);</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="comment">// 2: for i = 0 to N - 1 do</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">for</span> (word64 i = 0; i < N; ++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>  <span class="comment">// 3: V_i <-- X</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  BlockCopy(&V[i * (128 * r)], X, 128 * r);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// 4: X <-- H(X)</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  BlockMix(X, Y, r);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</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>  <span class="comment">// 6: for i = 0 to N - 1 do</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">for</span> (word64 i = 0; i < N; ++i)</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="comment">// 7: j <-- Integerify(X) mod N</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  word64 j = Integerify(X, r) & (N - 1);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// 8: X <-- H(X \xor V_j)</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  BlockXOR(X, &V[j * (128 * r)], 128 * r);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  BlockMix(X, Y, r);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// 10: B' <-- X</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  BlockCopy(B, X, 128 * r);</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> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> ANONYMOUS_NAMESPACE_END</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="class_scrypt.html#a6faaa4a7749a950e1e7d74bbb734ce12"> 154</a></span> size_t <a class="code" href="class_scrypt.html">Scrypt</a>::GetValidDerivedLength(<span class="keywordtype">size_t</span> keylength)<span class="keyword"> const</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="keyword"></span>{</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (keylength > MaxDerivedLength())</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">return</span> MaxDerivedLength();</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">return</span> keylength;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> }</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="keywordtype">void</span> Scrypt::ValidateParameters(<span class="keywordtype">size_t</span> derivedLen, word64 cost, word64 blockSize, word64 parallelization)<span class="keyword"> const</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="keyword"></span>{</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// Optimizer should remove this on 32-bit platforms</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">if</span> (std::numeric_limits<size_t>::max() > std::numeric_limits<word32>::max())</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">const</span> word64 maxLen = ((<span class="keyword">static_cast<</span>word64<span class="keyword">></span>(1) << 32) - 1) * 32;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (derivedLen > maxLen) {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  std::ostringstream oss;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  oss << <span class="stringliteral">"derivedLen "</span> << derivedLen << <span class="stringliteral">" is larger than "</span> << maxLen;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html">InvalidArgument</a>(<span class="stringliteral">"Scrypt: "</span> + oss.str());</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(<a class="code" href="misc_8h.html#a65531618a7eca8803fa9e9287c43aafc">IsPowerOf2</a>(cost));</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (<a class="code" href="misc_8h.html#a65531618a7eca8803fa9e9287c43aafc">IsPowerOf2</a>(cost) == <span class="keyword">false</span>)</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html">InvalidArgument</a>(<span class="stringliteral">"Scrypt: cost must be a power of 2"</span>);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keyword">const</span> word64 prod = <span class="keyword">static_cast<</span>word64<span class="keyword">></span>(blockSize) * parallelization;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(prod < (1U << 30));</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (prod >= (1U << 30)) {</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  std::ostringstream oss;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  oss << <span class="stringliteral">"r*p "</span> << prod << <span class="stringliteral">" is larger than "</span> << (1U << 30);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html">InvalidArgument</a>(<span class="stringliteral">"Scrypt: "</span> + oss.str());</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// Scrypt has several tests that effectively verify allocations like</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// '128 * r * N' and '128 * r * p' do not overflow. They are the tests</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// that set errno to ENOMEM. We can make the logic a little more clear</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// using word128. At first blush the word128 may seem like overkill.</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// However, this alogirthm is dominated by slow moving parts, so a</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// one-time check is insignificant in the bigger picture.</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="preprocessor">#if defined(CRYPTOPP_WORD128_AVAILABLE)</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> word128 maxElems = <span class="keyword">static_cast<</span>word128<span class="keyword">></span>(<a class="code" href="misc_8h.html#a3c75bb398badb69c7577b21486f9963f">SIZE_MAX</a>);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordtype">bool</span> bLimit = (maxElems >= <span class="keyword">static_cast<</span>word128<span class="keyword">></span>(cost) * blockSize * 128U);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordtype">bool</span> xyLimit = (maxElems >= <span class="keyword">static_cast<</span>word128<span class="keyword">></span>(parallelization) * blockSize * 128U);</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">bool</span> vLimit = (maxElems >= <span class="keyword">static_cast<</span>word128<span class="keyword">></span>(blockSize) * 256U + 64U);</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">const</span> word64 maxElems = <span class="keyword">static_cast<</span>word64<span class="keyword">></span>(<a class="code" href="misc_8h.html#a3c75bb398badb69c7577b21486f9963f">SIZE_MAX</a>);</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">bool</span> bLimit = (blockSize < maxElems / 128U / cost);</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">bool</span> xyLimit = (blockSize < maxElems / 128U / parallelization);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordtype">bool</span> vLimit = (blockSize < (maxElems - 64U) / 256U);</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(bLimit); <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(xyLimit); <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(vLimit);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (!bLimit || !xyLimit || !vLimit)</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">throw</span> std::bad_alloc();</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> }</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="class_scrypt.html#acb52a9def0feda98787bd82fe8bfeded"> 210</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_scrypt.html#acb52a9def0feda98787bd82fe8bfeded">Scrypt::DeriveKey</a>(byte*derived, <span class="keywordtype">size_t</span> derivedLen,</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> byte*secret, <span class="keywordtype">size_t</span> secretLen, <span class="keyword">const</span> <a class="code" href="class_name_value_pairs.html">NameValuePairs</a>& params)<span class="keyword"> const</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="keyword"></span>{</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(secret <span class="comment">/*&& secretLen*/</span>);</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(derived && derivedLen);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(derivedLen <= <a class="code" href="class_scrypt.html#ab3b23597d8bcb9af8d55bc8aa57bf709">MaxDerivedLength</a>());</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  word64 cost=0, blockSize=0, parallelization=0;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">if</span>(params.<a class="code" href="class_name_value_pairs.html#a5357c3a09602e44671d1e42cb9a9408d">GetValue</a>(<span class="stringliteral">"Cost"</span>, cost) == <span class="keyword">false</span>)</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  cost = defaultCost;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span>(params.<a class="code" href="class_name_value_pairs.html#a5357c3a09602e44671d1e42cb9a9408d">GetValue</a>(<span class="stringliteral">"BlockSize"</span>, blockSize) == <span class="keyword">false</span>)</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  blockSize = defaultBlockSize;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">if</span>(params.<a class="code" href="class_name_value_pairs.html#a5357c3a09602e44671d1e42cb9a9408d">GetValue</a>(<span class="stringliteral">"Parallelization"</span>, parallelization) == <span class="keyword">false</span>)</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  parallelization = defaultParallelization;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="class_const_byte_array_parameter.html">ConstByteArrayParameter</a> salt;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  (void)params.<a class="code" href="class_name_value_pairs.html#a5357c3a09602e44671d1e42cb9a9408d">GetValue</a>(<span class="stringliteral">"Salt"</span>, salt);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">return</span> <a class="code" href="class_scrypt.html#acb52a9def0feda98787bd82fe8bfeded">DeriveKey</a>(derived, derivedLen, secret, secretLen, salt.<a class="code" href="class_const_byte_array_parameter.html#ab89acc8dae383f2663dd3864651e8ef1">begin</a>(), salt.<a class="code" href="class_const_byte_array_parameter.html#ab83dbf7e4d80c0304917a3cc1d3cf144">size</a>(), cost, blockSize, parallelization);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00233"></a><span class="lineno"><a class="line" href="class_scrypt.html#a620e5573d4199cf2a84968afc4e98576"> 233</a></span> <span class="keywordtype">size_t</span> <a class="code" href="class_scrypt.html#acb52a9def0feda98787bd82fe8bfeded">Scrypt::DeriveKey</a>(byte*derived, <span class="keywordtype">size_t</span> derivedLen, <span class="keyword">const</span> byte*secret, <span class="keywordtype">size_t</span> secretLen,</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> byte*salt, <span class="keywordtype">size_t</span> saltLen, word64 cost, word64 blockSize, word64 parallel)<span class="keyword"> const</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="keyword"></span>{</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(secret <span class="comment">/*&& secretLen*/</span>);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(derived && derivedLen);</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(derivedLen <= <a class="code" href="class_scrypt.html#ab3b23597d8bcb9af8d55bc8aa57bf709">MaxDerivedLength</a>());</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  ThrowIfInvalidDerivedLength(derivedLen);</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  ValidateParameters(derivedLen, cost, blockSize, parallel);</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <a class="code" href="class_aligned_sec_byte_block.html">AlignedSecByteBlock</a> B(static_cast<size_t>(blockSize * parallel * 128U));</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// 1: (B_0 ... B_{p-1}) <-- PBKDF2(P, S, 1, p * MFLen)</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  PBKDF2_SHA256(B, B.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(), secret, secretLen, salt, saltLen, 1);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="comment">// http://stackoverflow.com/q/49604260/608639</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="preprocessor"> #pragma omp parallel</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// Each thread gets its own copy</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="code" href="class_aligned_sec_byte_block.html">AlignedSecByteBlock</a> XY(static_cast<size_t>(blockSize * 256U));</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <a class="code" href="class_aligned_sec_byte_block.html">AlignedSecByteBlock</a> V(static_cast<size_t>(blockSize * cost * 128U));</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> </div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// 2: for i = 0 to p - 1 do</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="preprocessor"> #pragma omp for</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < static_cast<size_t>(parallel); ++i)</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  {</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="comment">// 3: B_i <-- MF(B_i, N)</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">const</span> ptrdiff_t offset = <span class="keyword">static_cast<</span>ptrdiff_t<span class="keyword">></span>(blockSize*i*128);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  Smix(B+offset, static_cast<size_t>(blockSize), cost, V, XY);</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// 5: DK <-- PBKDF2(P, B, 1, dkLen)</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  PBKDF2_SHA256(derived, derivedLen, secret, secretLen, B, B.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(), 1);</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> </div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> }</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> NAMESPACE_END</div><div class="ttc" id="class_const_byte_array_parameter_html"><div class="ttname"><a href="class_const_byte_array_parameter.html">ConstByteArrayParameter</a></div><div class="ttdoc">Used to pass byte array input as part of a NameValuePairs object. </div><div class="ttdef"><b>Definition:</b> <a href="algparam_8h_source.html#l00020">algparam.h:20</a></div></div>
<div class="ttc" id="argnames_8h_html"><div class="ttname"><a href="argnames_8h.html">argnames.h</a></div><div class="ttdoc">Standard names for retrieving values by name when working with NameValuePairs. </div></div>
<div class="ttc" id="class_invalid_argument_html"><div class="ttname"><a href="class_invalid_argument.html">InvalidArgument</a></div><div class="ttdoc">An invalid argument was detected. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00199">cryptlib.h:199</a></div></div>
<div class="ttc" id="algparam_8h_html"><div class="ttname"><a href="algparam_8h.html">algparam.h</a></div><div class="ttdoc">Classes for working with NameValuePairs. </div></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="class_const_byte_array_parameter_html_ab83dbf7e4d80c0304917a3cc1d3cf144"><div class="ttname"><a href="class_const_byte_array_parameter.html#ab83dbf7e4d80c0304917a3cc1d3cf144">ConstByteArrayParameter::size</a></div><div class="ttdeci">size_t size() const</div><div class="ttdoc">Length of the memory block. </div><div class="ttdef"><b>Definition:</b> <a href="algparam_8h_source.html#l00084">algparam.h:84</a></div></div>
<div class="ttc" id="misc_8h_html_aef6a8d35198f71ff68811bacd599c664"><div class="ttname"><a href="misc_8h.html#aef6a8d35198f71ff68811bacd599c664">PutWord</a></div><div class="ttdeci">void PutWord(bool assumeAligned, ByteOrder order, byte *block, T value, const byte *xorBlock=NULL)</div><div class="ttdoc">Access a block of memory. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l02295">misc.h:2295</a></div></div>
<div class="ttc" id="stdcpp_8h_html"><div class="ttname"><a href="stdcpp_8h.html">stdcpp.h</a></div><div class="ttdoc">Common C++ header files. </div></div>
<div class="ttc" id="class_scrypt_html_ab3b23597d8bcb9af8d55bc8aa57bf709"><div class="ttname"><a href="class_scrypt.html#ab3b23597d8bcb9af8d55bc8aa57bf709">Scrypt::MaxDerivedLength</a></div><div class="ttdeci">size_t MaxDerivedLength() const</div><div class="ttdoc">Determine maximum number of bytes. </div><div class="ttdef"><b>Definition:</b> <a href="scrypt_8h_source.html#l00048">scrypt.h:48</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="class_p_k_c_s5___p_b_k_d_f2___h_m_a_c_html"><div class="ttname"><a href="class_p_k_c_s5___p_b_k_d_f2___h_m_a_c.html">PKCS5_PBKDF2_HMAC</a></div><div class="ttdoc">PBKDF2 from PKCS #5. </div><div class="ttdef"><b>Definition:</b> <a href="pwdbased_8h_source.html#l00148">pwdbased.h:148</a></div></div>
<div class="ttc" id="class_p_k_c_s5___p_b_k_d_f2___h_m_a_c_html_ac3b81a978c1d59da9a2d21535e7d5b36"><div class="ttname"><a href="class_p_k_c_s5___p_b_k_d_f2___h_m_a_c.html#ac3b81a978c1d59da9a2d21535e7d5b36">PKCS5_PBKDF2_HMAC::DeriveKey</a></div><div class="ttdeci">size_t DeriveKey(byte *derived, size_t derivedLen, const byte *secret, size_t secretLen, const NameValuePairs &params=g_nullNameValuePairs) const</div><div class="ttdoc">Derive a key from a seed. </div><div class="ttdef"><b>Definition:</b> <a href="pwdbased_8h_source.html#l00214">pwdbased.h:214</a></div></div>
<div class="ttc" id="misc_8h_html_a240e8e97f964626508362b59b78532d3"><div class="ttname"><a href="misc_8h.html#a240e8e97f964626508362b59b78532d3">GetWord</a></div><div class="ttdeci">T GetWord(bool assumeAligned, ByteOrder order, const byte *block)</div><div class="ttdoc">Access a block of memory. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l02250">misc.h:2250</a></div></div>
<div class="ttc" id="class_const_byte_array_parameter_html_ab89acc8dae383f2663dd3864651e8ef1"><div class="ttname"><a href="class_const_byte_array_parameter.html#ab89acc8dae383f2663dd3864651e8ef1">ConstByteArrayParameter::begin</a></div><div class="ttdeci">const byte * begin() const</div><div class="ttdoc">Pointer to the first byte in the memory block. </div><div class="ttdef"><b>Definition:</b> <a href="algparam_8h_source.html#l00080">algparam.h:80</a></div></div>
<div class="ttc" id="misc_8h_html_a0ab6928faa40f6e56e7f4817d5d65a38"><div class="ttname"><a href="misc_8h.html#a0ab6928faa40f6e56e7f4817d5d65a38">rotlConstant</a></div><div class="ttdeci">T rotlConstant(T x)</div><div class="ttdoc">Performs a left rotate. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l01365">misc.h:1365</a></div></div>
<div class="ttc" id="salsa_8h_html_affb56f800a7c03d5b0b3d45afa785a49"><div class="ttname"><a href="salsa_8h.html#affb56f800a7c03d5b0b3d45afa785a49">Salsa20_Core</a></div><div class="ttdeci">void Salsa20_Core(word32 *data, unsigned int rounds)</div><div class="ttdoc">Salsa20 core transform. </div><div class="ttdef"><b>Definition:</b> <a href="salsa_8cpp_source.html#l00039">salsa.cpp:39</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="misc_8h_html_a65531618a7eca8803fa9e9287c43aafc"><div class="ttname"><a href="misc_8h.html#a65531618a7eca8803fa9e9287c43aafc">IsPowerOf2</a></div><div class="ttdeci">bool IsPowerOf2(const T &value)</div><div class="ttdoc">Tests whether a value is a power of 2. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00859">misc.h:859</a></div></div>
<div class="ttc" id="class_aligned_sec_byte_block_html"><div class="ttname"><a href="class_aligned_sec_byte_block.html">AlignedSecByteBlock</a></div><div class="ttdoc">SecBlock using AllocatorWithCleanup<byte, true> typedef. </div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00826">secblock.h:826</a></div></div>
<div class="ttc" id="trap_8h_html_adf3b392588bc94cbeae9f415a78c7b95"><div class="ttname"><a href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a></div><div class="ttdeci">#define CRYPTOPP_ASSERT(exp)</div><div class="ttdoc">Debugging and diagnostic assertion. </div><div class="ttdef"><b>Definition:</b> <a href="trap_8h_source.html#l00060">trap.h:60</a></div></div>
<div class="ttc" id="scrypt_8h_html"><div class="ttname"><a href="scrypt_8h.html">scrypt.h</a></div><div class="ttdoc">Classes for Scrypt from RFC 7914. </div></div>
<div class="ttc" id="sha_8h_html"><div class="ttname"><a href="sha_8h.html">sha.h</a></div><div class="ttdoc">Classes for SHA-1 and SHA-2 family of message digests. </div></div>
<div class="ttc" id="salsa_8h_html"><div class="ttname"><a href="salsa_8h.html">salsa.h</a></div><div class="ttdoc">Classes for Salsa and Salsa20 stream ciphers. </div></div>
<div class="ttc" id="pwdbased_8h_html"><div class="ttname"><a href="pwdbased_8h.html">pwdbased.h</a></div><div class="ttdoc">Password based key derivation functions. </div></div>
<div class="ttc" id="class_scrypt_html_acb52a9def0feda98787bd82fe8bfeded"><div class="ttname"><a href="class_scrypt.html#acb52a9def0feda98787bd82fe8bfeded">Scrypt::DeriveKey</a></div><div class="ttdeci">size_t DeriveKey(byte *derived, size_t derivedLen, const byte *secret, size_t secretLen, const NameValuePairs &params) const</div><div class="ttdoc">Derive a key from a seed. </div><div class="ttdef"><b>Definition:</b> <a href="scrypt_8cpp_source.html#l00210">scrypt.cpp:210</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="class_name_value_pairs_html_a5357c3a09602e44671d1e42cb9a9408d"><div class="ttname"><a href="class_name_value_pairs.html#a5357c3a09602e44671d1e42cb9a9408d">NameValuePairs::GetValue</a></div><div class="ttdeci">bool GetValue(const char *name, T &value) const</div><div class="ttdoc">Get a named value. </div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00347">cryptlib.h:347</a></div></div>
<div class="ttc" id="class_scrypt_html"><div class="ttname"><a href="class_scrypt.html">Scrypt</a></div><div class="ttdoc">Scrypt key derivation function. </div><div class="ttdef"><b>Definition:</b> <a href="scrypt_8h_source.html#l00033">scrypt.h:33</a></div></div>
<div class="ttc" id="class_sec_block_html_af5999bffe3193e62719cc0792b0282a7"><div class="ttname"><a href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">SecBlock::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdoc">Provides the count of elements in the SecBlock. </div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00561">secblock.h:561</a></div></div>
<div class="ttc" id="misc_8h_html_a3c75bb398badb69c7577b21486f9963f"><div class="ttname"><a href="misc_8h.html#a3c75bb398badb69c7577b21486f9963f">SIZE_MAX</a></div><div class="ttdeci">#define SIZE_MAX</div><div class="ttdoc">The maximum value of a machine word. </div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00085">misc.h:85</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:58:02 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
>
2559
