<!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++: drbg.h 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">drbg.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="drbg_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// drbg.h - 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"></span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">/// \file drbg.h</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">/// \brief Classes for NIST DRBGs from SP 800-90A</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">/// \sa <A HREF="http://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf">Recommendation</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">/// for Random Number Generation Using Deterministic Random Bit Generators, Rev 1 (June 2015)</A></span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">/// \since Crypto++ 6.0</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"></span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#ifndef CRYPTOPP_NIST_DRBG_H</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#define CRYPTOPP_NIST_DRBG_H</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include "<a class="code" href="cryptlib_8h.html">cryptlib.h</a>"</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include "<a class="code" href="secblock_8h.html">secblock.h</a>"</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="hmac_8h.html">hmac.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include "<a class="code" href="sha_8h.html">sha.h</a>"</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">/// \brief Interface for NIST DRBGs from SP 800-90A</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"></span><span class="comment">/// \details NIST_DRBG is the base class interface for NIST DRBGs from SP 800-90A Rev 1 (June 2015)</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"></span><span class="comment">/// \sa <A HREF="http://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf">Recommendation</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"></span><span class="comment">/// for Random Number Generation Using Deterministic Random Bit Generators, Rev 1 (June 2015)</A></span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"></span><span class="comment">/// \since Crypto++ 6.0</span></div><div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="class_n_i_s_t___d_r_b_g.html"> 24</a></span> <span class="comment"></span>class <a class="code" href="class_n_i_s_t___d_r_b_g.html">NIST_DRBG</a> : public <a class="code" href="class_random_number_generator.html">RandomNumberGenerator</a></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> {</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> /// \brief Exception thrown when a NIST DRBG encounters an error</span></div><div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="class_n_i_s_t___d_r_b_g_1_1_err.html"> 28</a></span> <span class="comment"></span> <span class="keyword">class </span><a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">Err</a> : <span class="keyword">public</span> <a class="code" href="class_exception.html">Exception</a></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">public</span>:</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keyword">explicit</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">Err</a>(<span class="keyword">const</span> std::string &c, <span class="keyword">const</span> std::string &m)</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  : <a class="code" href="class_exception.html">Exception</a>(OTHER_ERROR, c + <span class="stringliteral">": "</span> + m) {}</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  };</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> <span class="keyword">public</span>:</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">virtual</span> ~<a class="code" href="class_n_i_s_t___d_r_b_g.html">NIST_DRBG</a>() {}</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> /// \brief Determines if a generator can accept additional entropy</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> /// \return true</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> /// \details All NIST_DRBG return true</span></div><div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="class_n_i_s_t___d_r_b_g.html#a87e4721ea7bc6859abc85dc00130c3cb"> 41</a></span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="class_n_i_s_t___d_r_b_g.html#a87e4721ea7bc6859abc85dc00130c3cb">CanIncorporateEntropy</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> <span class="keyword">true</span>;}</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"></span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> /// \brief Update RNG state with additional unpredictable values</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> /// \param input the entropy to add to the generator</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> /// \param length the size of the input buffer</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> /// \throws NIST_DRBG::Err if the generator is reseeded with insufficient entropy</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> /// \details NIST instantiation and reseed requirements demand the generator is constructed</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> /// with at least <tt>MINIMUM_ENTROPY</tt> entropy. The byte array for <tt>input</tt> must</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> /// meet <A HREF ="http://csrc.nist.gov/publications/PubsSPs.html">NIST SP 800-90B or</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> /// SP 800-90C</A> requirements.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> IncorporateEntropy(<span class="keyword">const</span> <span class="keywordtype">byte</span> *input, <span class="keywordtype">size_t</span> length)=0;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> /// \brief Update RNG state with additional unpredictable values</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> /// \param entropy the entropy to add to the generator</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> /// \param entropyLength the size of the input buffer</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> /// \param additional additional input to add to the generator</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> /// \param additionaLength the size of the additional input buffer</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> /// \throws NIST_DRBG::Err if the generator is reseeded with insufficient entropy</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> /// \details IncorporateEntropy() is an overload provided to match NIST requirements. NIST</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> /// instantiation and reseed requirements demand the generator is constructed with at least</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> /// <tt>MINIMUM_ENTROPY</tt> entropy. The byte array for <tt>entropy</tt> must meet</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> /// <A HREF ="http://csrc.nist.gov/publications/PubsSPs.html">NIST SP 800-90B or</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> ///! SP 800-90C</A> requirements.</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> IncorporateEntropy(<span class="keyword">const</span> <span class="keywordtype">byte</span> *entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength)=0;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"></span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> /// \brief Generate random array of bytes</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> /// \param output the byte buffer</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> /// \param size the length of the buffer, in bytes</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> /// \throws NIST_DRBG::Err if a reseed is required</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> /// \throws NIST_DRBG::Err if the size exceeds <tt>MAXIMUM_BYTES_PER_REQUEST</tt></span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> GenerateBlock(<span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size)=0;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"></span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> /// \brief Generate random array of bytes</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> /// \param additional additional input to add to the generator</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> /// \param additionaLength the size of the additional input buffer</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> /// \param output the byte buffer</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> /// \param size the length of the buffer, in bytes</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> /// \throws NIST_DRBG::Err if a reseed is required</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> /// \throws NIST_DRBG::Err if the size exceeds <tt>MAXIMUM_BYTES_PER_REQUEST</tt></span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> /// \details GenerateBlock() is an overload provided to match NIST requirements. The byte</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> /// array for <tt>additional</tt> input is optional. If present the additional randomness</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> /// is mixed before generating the output bytes.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> GenerateBlock(<span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength, <span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size)=0;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"></span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> /// \brief Provides the security strength</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> /// \returns The security strength of the generator, in bytes</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> /// \details The equivalent class constant is <tt>SECURITY_STRENGTH</tt></span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SecurityStrength() <span class="keyword">const</span>=0;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"></span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> /// \brief Provides the seed length</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> /// \returns The seed size of the generator, in bytes</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> /// \details The equivalent class constant is <tt>SEED_LENGTH</tt>. The size is</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> /// used to maintain internal state of <tt>V</tt> and <tt>C</tt>.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SeedLength() <span class="keyword">const</span>=0;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"></span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> /// \brief Provides the minimum entropy size</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> /// \returns The minimum entropy size required by the generator, in bytes</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> /// \details The equivalent class constant is <tt>MINIMUM_ENTROPY</tt>. All NIST DRBGs must</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> /// be instaniated with at least <tt>MINIMUM_ENTROPY</tt> bytes of entropy. The bytes must</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> /// meet <A HREF="http://csrc.nist.gov/publications/PubsSPs.html">NIST SP 800-90B or</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> /// SP 800-90C</A> requirements.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MinEntropyLength() <span class="keyword">const</span>=0;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"></span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> /// \brief Provides the maximum entropy size</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> /// \returns The maximum entropy size that can be consumed by the generator, in bytes</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> /// \details The equivalent class constant is <tt>MAXIMUM_ENTROPY</tt>. The bytes must</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> /// meet <A HREF="http://csrc.nist.gov/publications/PubsSPs.html">NIST SP 800-90B or</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> /// SP 800-90C</A> requirements. <tt>MAXIMUM_ENTROPY</tt> has been reduced from</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> /// 2<sup>35</sup> to <tt>INT_MAX</tt> to fit the underlying C++ datatype.</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MaxEntropyLength() <span class="keyword">const</span>=0;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"></span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> /// \brief Provides the minimum nonce size</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> /// \returns The minimum nonce size recommended for the generator, in bytes</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> /// \details The equivalent class constant is <tt>MINIMUM_NONCE</tt>. If a nonce is not</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> /// required then <tt>MINIMUM_NONCE</tt> is 0. <tt>Hash_DRBG</tt> does not require a</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> /// nonce, while <tt>HMAC_DRBG</tt> and <tt>CTR_DRBG</tt> require a nonce.</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MinNonceLength() <span class="keyword">const</span>=0;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"></span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> /// \brief Provides the maximum nonce size</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> /// \returns The maximum nonce that can be consumed by the generator, in bytes</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> /// \details The equivalent class constant is <tt>MAXIMUM_NONCE</tt>. <tt>MAXIMUM_NONCE</tt></span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> /// has been reduced from 2<sup>35</sup> to <tt>INT_MAX</tt> to fit the underlying C++ datatype.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> /// If a nonce is not required then <tt>MINIMUM_NONCE</tt> is 0. <tt>Hash_DRBG</tt> does not</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> /// require a nonce, while <tt>HMAC_DRBG</tt> and <tt>CTR_DRBG</tt> require a nonce.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MaxNonceLength() <span class="keyword">const</span>=0;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"></span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"> /// \brief Provides the maximum size of a request to GenerateBlock</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> /// \returns The the maximum size of a request to GenerateBlock(), in bytes</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> /// \details The equivalent class constant is <tt>MAXIMUM_BYTES_PER_REQUEST</tt></span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MaxBytesPerRequest() <span class="keyword">const</span>=0;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"></span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> /// \brief Provides the maximum number of requests before a reseed</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"> /// \returns The the maximum number of requests before a reseed, in bytes</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> /// \details The equivalent class constant is <tt>MAXIMUM_REQUESTS_BEFORE_RESEED</tt>.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> /// <tt>MAXIMUM_REQUESTS_BEFORE_RESEED</tt> has been reduced from 2<sup>48</sup> to <tt>INT_MAX</tt></span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> /// to fit the underlying C++ datatype.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MaxRequestBeforeReseed() <span class="keyword">const</span>=0;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="keyword">protected</span>:</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> DRBG_Instantiate(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength,</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span>* nonce, <span class="keywordtype">size_t</span> nonceLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* personalization, <span class="keywordtype">size_t</span> personalizationLength)=0;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> DRBG_Reseed(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength)=0;</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">// *************************************************************</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"></span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">/// \tparam HASH NIST approved hash derived from HashTransformation</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">/// \tparam STRENGTH security strength, in bytes</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">/// \tparam SEEDLENGTH seed length, in bytes</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">/// \brief Hash_DRBG from SP 800-90A Rev 1 (June 2015)</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">/// \details The NIST Hash DRBG is instantiated with a number of parameters. Two of the parameters,</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">/// Security Strength and Seed Length, depend on the hash and are specified as template parameters.</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">/// The remaining parameters are included in the class. The parameters and their values are listed</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment">/// in NIST SP 800-90A Rev. 1, Table 2: Definitions for Hash-Based DRBG Mechanisms (p.38).</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment">/// \details Some parameters have been reduce to fit C++ datatypes. For example, NIST allows upto</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">/// 2<sup>48</sup> requests before a reseed. However, Hash_DRBG limits it to <tt>INT_MAX</tt> due</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">/// to the limited data range of an int.</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">/// \sa <A HREF="http://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf">Recommendation</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment">/// for Random Number Generation Using Deterministic Random Bit Generators, Rev 1 (June 2015)</A></span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment">/// \since Crypto++ 6.0</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"></span><span class="keyword">template</span> <<span class="keyword">typename</span> HASH=<a class="code" href="class_s_h_a256.html">SHA256</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH=128/8, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH=440/8></div><div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html"> 163</a></span> <span class="keyword">class </span><a class="code" href="class_hash___d_r_b_g.html">Hash_DRBG</a> : <span class="keyword">public</span> <a class="code" href="class_n_i_s_t___d_r_b_g.html">NIST_DRBG</a>, <span class="keyword">public</span> <a class="code" href="class_not_copyable.html">NotCopyable</a></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> {</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  CRYPTOPP_CONSTANT(SECURITY_STRENGTH=STRENGTH)</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  CRYPTOPP_CONSTANT(SEED_LENGTH=SEEDLENGTH)</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  CRYPTOPP_CONSTANT(MINIMUM_ENTROPY=STRENGTH)</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  CRYPTOPP_CONSTANT(MINIMUM_NONCE=0)</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  CRYPTOPP_CONSTANT(MINIMUM_ADDITIONAL=0)</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  CRYPTOPP_CONSTANT(MINIMUM_PERSONALIZATION=0)</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  CRYPTOPP_CONSTANT(MAXIMUM_ENTROPY=INT_MAX)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  CRYPTOPP_CONSTANT(MAXIMUM_NONCE=INT_MAX)</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  CRYPTOPP_CONSTANT(MAXIMUM_ADDITIONAL=INT_MAX)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  CRYPTOPP_CONSTANT(MAXIMUM_PERSONALIZATION=INT_MAX)</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  CRYPTOPP_CONSTANT(MAXIMUM_BYTES_PER_REQUEST=65536)</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  CRYPTOPP_CONSTANT(MAXIMUM_REQUESTS_BEFORE_RESEED=INT_MAX)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">static</span> std::string StaticAlgorithmName() { <span class="keywordflow">return</span> std::string(<span class="stringliteral">"Hash_DRBG("</span>) + HASH::StaticAlgorithmName() + std::string(<span class="stringliteral">")"</span>); }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"></span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> /// \brief Construct a Hash DRBG</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> /// \param entropy the entropy to instantiate the generator</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> /// \param entropyLength the size of the entropy buffer</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> /// \param nonce additional input to instantiate the generator</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> /// \param nonceLength the size of the nonce buffer</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> /// \param personalization additional input to instantiate the generator</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> /// \param personalizationLength the size of the personalization buffer</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> /// \throws NIST_DRBG::Err if the generator is instantiated with insufficient entropy</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> /// \details All NIST DRBGs must be instaniated with at least <tt>MINIMUM_ENTROPY</tt> bytes of entropy.</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> /// The byte array for <tt>entropy</tt> must meet <A HREF ="http://csrc.nist.gov/publications/PubsSPs.html">NIST</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> /// SP 800-90B or SP 800-90C</A> requirements.</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> /// \details The <tt>nonce</tt> and <tt>personalization</tt> are optional byte arrays. If <tt>nonce</tt> is supplied,</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> /// then it should be at least <tt>MINIMUM_NONCE</tt> bytes of entropy.</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> /// \details An example of instantiating a SHA256 generator is shown below.</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> /// The example provides more entropy than required for SHA256. The <tt>NonblockingRng</tt> meets the</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> /// requirements of <A HREF ="http://csrc.nist.gov/publications/PubsSPs.html">NIST SP 800-90B or SP 800-90C</A>.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> /// RDRAND() and RDSEED() generators would work as well.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> /// <pre></span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> /// SecByteBlock entropy(48), result(128);</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> /// NonblockingRng prng;</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> /// RandomNumberSource rns(prng, entropy.size(), new ArraySink(entropy, entropy.size()));</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> ///</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"> /// Hash_DRBG<SHA256, 128/8, 440/8> drbg(entropy, 32, entropy+32, 16);</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> /// drbg.GenerateBlock(result, result.size());</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> /// </pre></span></div><div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a8c84ffe9d5eacf52d74c3ab3a038ab12"> 206</a></span> <span class="comment"></span> <a class="code" href="class_hash___d_r_b_g.html#a8c84ffe9d5eacf52d74c3ab3a038ab12">Hash_DRBG</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy=NULLPTR, <span class="keywordtype">size_t</span> entropyLength=STRENGTH, <span class="keyword">const</span> <span class="keywordtype">byte</span>* nonce=NULLPTR,</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordtype">size_t</span> nonceLength=0, <span class="keyword">const</span> <span class="keywordtype">byte</span>* personalization=NULLPTR, <span class="keywordtype">size_t</span> personalizationLength=0)</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  : <a class="code" href="class_n_i_s_t___d_r_b_g.html">NIST_DRBG</a>(), m_c(SEEDLENGTH), m_v(SEEDLENGTH), m_reseed(0)</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  {</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">if</span> (entropy != NULLPTR && entropyLength != 0)</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  DRBG_Instantiate(entropy, entropyLength, nonce, nonceLength, personalization, personalizationLength);</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#aab39cc27d139cb77f0d3f0e8503632fa"> 214</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_hash___d_r_b_g.html#aab39cc27d139cb77f0d3f0e8503632fa">SecurityStrength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> SECURITY_STRENGTH;}</div><div class="line"><a name="l00215"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a23df63d27368ac3e3b7e333ff8a1889c"> 215</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_hash___d_r_b_g.html#a23df63d27368ac3e3b7e333ff8a1889c">SeedLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> SEED_LENGTH;}</div><div class="line"><a name="l00216"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#af847fbe7ecc0711c1c83e191b2db411f"> 216</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_hash___d_r_b_g.html#af847fbe7ecc0711c1c83e191b2db411f">MinEntropyLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MINIMUM_ENTROPY;}</div><div class="line"><a name="l00217"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a1ca8d90554785991408e33e604726346"> 217</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_hash___d_r_b_g.html#a1ca8d90554785991408e33e604726346">MaxEntropyLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MAXIMUM_ENTROPY;}</div><div class="line"><a name="l00218"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a1b064dc340098f5678a0ac8ddd928f03"> 218</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_hash___d_r_b_g.html#a1b064dc340098f5678a0ac8ddd928f03">MinNonceLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MINIMUM_NONCE;}</div><div class="line"><a name="l00219"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#ae3d30c8dd306142559372c8c6b5426e0"> 219</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_hash___d_r_b_g.html#ae3d30c8dd306142559372c8c6b5426e0">MaxNonceLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MAXIMUM_NONCE;}</div><div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a4e38edb5aace7dba611604aba7c733b1"> 220</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_hash___d_r_b_g.html#a4e38edb5aace7dba611604aba7c733b1">MaxBytesPerRequest</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MAXIMUM_BYTES_PER_REQUEST;}</div><div class="line"><a name="l00221"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a4126f6f30e058ba4112c17fffeb0173d"> 221</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_hash___d_r_b_g.html#a4126f6f30e058ba4112c17fffeb0173d">MaxRequestBeforeReseed</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MAXIMUM_REQUESTS_BEFORE_RESEED;}</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a1f2e5bc3154903d433fa26e68b0ab6e4"> 223</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_hash___d_r_b_g.html#a1f2e5bc3154903d433fa26e68b0ab6e4">IncorporateEntropy</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span> *input, <span class="keywordtype">size_t</span> length)</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  {<span class="keywordflow">return</span> DRBG_Reseed(input, length, NULLPTR, 0);}</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div><div class="line"><a name="l00226"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a50bf4c5f0523a2ed950f24287a1eef05"> 226</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_hash___d_r_b_g.html#a50bf4c5f0523a2ed950f24287a1eef05">IncorporateEntropy</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span> *entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength)</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  {<span class="keywordflow">return</span> DRBG_Reseed(entropy, entropyLength, additional, additionaLength);}</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#aa5dabccf451a510d1af4ae80100e966f"> 229</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_hash___d_r_b_g.html#aa5dabccf451a510d1af4ae80100e966f">GenerateBlock</a>(<span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  {<span class="keywordflow">return</span> Hash_Generate(NULLPTR, 0, output, size);}</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"><a class="line" href="class_hash___d_r_b_g.html#a36c1b1145370ef352ea6582d49491a62"> 232</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_hash___d_r_b_g.html#a36c1b1145370ef352ea6582d49491a62">GenerateBlock</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength, <span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  {<span class="keywordflow">return</span> Hash_Generate(additional, additionaLength, output, size);}</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="keyword">protected</span>:</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// 10.1.1.2 Instantiation of Hash_DRBG (p.39)</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordtype">void</span> DRBG_Instantiate(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* nonce, <span class="keywordtype">size_t</span> nonceLength,</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span>* personalization, <span class="keywordtype">size_t</span> personalizationLength);</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>  <span class="comment">// 10.1.1.3 Reseeding a Hash_DRBG Instantiation (p.40)</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordtype">void</span> DRBG_Reseed(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength);</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>  <span class="comment">// 10.1.1.4 Generating Pseudorandom Bits Using Hash_DRBG (p.41)</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordtype">void</span> Hash_Generate(<span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength, <span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size);</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// 10.3.1 Derivation Function Using a Hash Function (Hash_df) (p.49)</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordtype">void</span> Hash_Update(<span class="keyword">const</span> <span class="keywordtype">byte</span>* input1, <span class="keywordtype">size_t</span> inlen1, <span class="keyword">const</span> <span class="keywordtype">byte</span>* input2, <span class="keywordtype">size_t</span> inlen2,</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span>* input3, <span class="keywordtype">size_t</span> inlen3, <span class="keyword">const</span> <span class="keywordtype">byte</span>* input4, <span class="keywordtype">size_t</span> inlen4, <span class="keywordtype">byte</span>* output, <span class="keywordtype">size_t</span> outlen);</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> </div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> m_c, m_v;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  word64 m_reseed;</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> };</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">// typedef Hash_DRBG<SHA1, 128/8, 440/8> Hash_SHA1_DRBG;</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// typedef Hash_DRBG<SHA256, 128/8, 440/8> Hash_SHA256_DRBG;</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// typedef Hash_DRBG<SHA384, 256/8, 888/8> Hash_SHA384_DRBG;</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// typedef Hash_DRBG<SHA512, 256/8, 888/8> Hash_SHA512_DRBG;</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// *************************************************************</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"></span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment">/// \tparam HASH NIST approved hash derived from HashTransformation</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment">/// \tparam STRENGTH security strength, in bytes</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment">/// \tparam SEEDLENGTH seed length, in bytes</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment">/// \brief HMAC_DRBG from SP 800-90A Rev 1 (June 2015)</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment">/// \details The NIST HMAC DRBG is instantiated with a number of parameters. Two of the parameters,</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment">/// Security Strength and Seed Length, depend on the hash and are specified as template parameters.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment">/// The remaining parameters are included in the class. The parameters and their values are listed</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment">/// in NIST SP 800-90A Rev. 1, Table 2: Definitions for Hash-Based DRBG Mechanisms (p.38).</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment">/// \details Some parameters have been reduce to fit C++ datatypes. For example, NIST allows upto 2<sup>48</sup> requests</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment">/// before a reseed. However, HMAC_DRBG limits it to <tt>INT_MAX</tt> due to the limited data range of an int.</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment">/// \sa <A HREF="http://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-90Ar1.pdf">Recommendation</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment">/// for Random Number Generation Using Deterministic Random Bit Generators, Rev 1 (June 2015)</A></span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment">/// \since Crypto++ 6.0</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"></span><span class="keyword">template</span> <<span class="keyword">typename</span> HASH=<a class="code" href="class_s_h_a256.html">SHA256</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH=128/8, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH=440/8></div><div class="line"><a name="l00276"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html"> 276</a></span> <span class="keyword">class </span><a class="code" href="class_h_m_a_c___d_r_b_g.html">HMAC_DRBG</a> : <span class="keyword">public</span> <a class="code" href="class_n_i_s_t___d_r_b_g.html">NIST_DRBG</a>, <span class="keyword">public</span> <a class="code" href="class_not_copyable.html">NotCopyable</a></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  CRYPTOPP_CONSTANT(SECURITY_STRENGTH=STRENGTH)</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  CRYPTOPP_CONSTANT(SEED_LENGTH=SEEDLENGTH)</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  CRYPTOPP_CONSTANT(MINIMUM_ENTROPY=STRENGTH)</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  CRYPTOPP_CONSTANT(MINIMUM_NONCE=0)</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  CRYPTOPP_CONSTANT(MINIMUM_ADDITIONAL=0)</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  CRYPTOPP_CONSTANT(MINIMUM_PERSONALIZATION=0)</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  CRYPTOPP_CONSTANT(MAXIMUM_ENTROPY=INT_MAX)</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  CRYPTOPP_CONSTANT(MAXIMUM_NONCE=INT_MAX)</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  CRYPTOPP_CONSTANT(MAXIMUM_ADDITIONAL=INT_MAX)</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  CRYPTOPP_CONSTANT(MAXIMUM_PERSONALIZATION=INT_MAX)</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  CRYPTOPP_CONSTANT(MAXIMUM_BYTES_PER_REQUEST=65536)</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  CRYPTOPP_CONSTANT(MAXIMUM_REQUESTS_BEFORE_RESEED=INT_MAX)</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">static</span> std::string StaticAlgorithmName() { <span class="keywordflow">return</span> std::string(<span class="stringliteral">"HMAC_DRBG("</span>) + HASH::StaticAlgorithmName() + std::string(<span class="stringliteral">")"</span>); }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment"></span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> /// \brief Construct a HMAC DRBG</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> /// \param entropy the entropy to instantiate the generator</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"> /// \param entropyLength the size of the entropy buffer</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment"> /// \param nonce additional input to instantiate the generator</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="comment"> /// \param nonceLength the size of the nonce buffer</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment"> /// \param personalization additional input to instantiate the generator</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"> /// \param personalizationLength the size of the personalization buffer</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> /// \throws NIST_DRBG::Err if the generator is instantiated with insufficient entropy</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> /// \details All NIST DRBGs must be instaniated with at least <tt>MINIMUM_ENTROPY</tt> bytes of entropy.</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"> /// The byte array for <tt>entropy</tt> must meet <A HREF ="http://csrc.nist.gov/publications/PubsSPs.html">NIST</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"> /// SP 800-90B or SP 800-90C</A> requirements.</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment"> /// \details The <tt>nonce</tt> and <tt>personalization</tt> are optional byte arrays. If <tt>nonce</tt> is supplied,</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment"> /// then it should be at least <tt>MINIMUM_NONCE</tt> bytes of entropy.</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"> /// \details An example of instantiating a SHA256 generator is shown below.</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"> /// The example provides more entropy than required for SHA256. The <tt>NonblockingRng</tt> meets the</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> /// requirements of <A HREF ="http://csrc.nist.gov/publications/PubsSPs.html">NIST SP 800-90B or SP 800-90C</A>.</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> /// RDRAND() and RDSEED() generators would work as well.</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> /// <pre></span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> /// SecByteBlock entropy(48), result(128);</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> /// NonblockingRng prng;</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> /// RandomNumberSource rns(prng, entropy.size(), new ArraySink(entropy, entropy.size()));</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> ///</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"> /// HMAC_DRBG<SHA256, 128/8, 440/8> drbg(entropy, 32, entropy+32, 16);</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> /// drbg.GenerateBlock(result, result.size());</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> /// </pre></span></div><div class="line"><a name="l00319"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a865caa1cf749a12cd7e540554576b307"> 319</a></span> <span class="comment"></span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a865caa1cf749a12cd7e540554576b307">HMAC_DRBG</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy=NULLPTR, <span class="keywordtype">size_t</span> entropyLength=STRENGTH, <span class="keyword">const</span> <span class="keywordtype">byte</span>* nonce=NULLPTR,</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordtype">size_t</span> nonceLength=0, <span class="keyword">const</span> <span class="keywordtype">byte</span>* personalization=NULLPTR, <span class="keywordtype">size_t</span> personalizationLength=0)</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  : <a class="code" href="class_n_i_s_t___d_r_b_g.html">NIST_DRBG</a>(), m_k(HASH::DIGESTSIZE), m_v(HASH::DIGESTSIZE), m_reseed(0)</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">if</span> (entropy != NULLPTR && entropyLength != 0)</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  DRBG_Instantiate(entropy, entropyLength, nonce, nonceLength, personalization, personalizationLength);</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div><div class="line"><a name="l00327"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a6392fd224c2a34dca0bb1fb4782e87a4"> 327</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a6392fd224c2a34dca0bb1fb4782e87a4">SecurityStrength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> SECURITY_STRENGTH;}</div><div class="line"><a name="l00328"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a10988d5e619883eaa0f2048eb2dd7521"> 328</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a10988d5e619883eaa0f2048eb2dd7521">SeedLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> SEED_LENGTH;}</div><div class="line"><a name="l00329"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a2b89c21e125fac466aad111fd3ce60d4"> 329</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a2b89c21e125fac466aad111fd3ce60d4">MinEntropyLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MINIMUM_ENTROPY;}</div><div class="line"><a name="l00330"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a75089a266a2210a1291f9f1a183fe6cc"> 330</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a75089a266a2210a1291f9f1a183fe6cc">MaxEntropyLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MAXIMUM_ENTROPY;}</div><div class="line"><a name="l00331"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a68b996c75ae7ec594e94b76ddbfbe2d3"> 331</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a68b996c75ae7ec594e94b76ddbfbe2d3">MinNonceLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MINIMUM_NONCE;}</div><div class="line"><a name="l00332"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#acef26a07b7751468326b40a5441fdb76"> 332</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#acef26a07b7751468326b40a5441fdb76">MaxNonceLength</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MAXIMUM_NONCE;}</div><div class="line"><a name="l00333"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a63dda8cecfd4b62d1a469437dac9aebf"> 333</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a63dda8cecfd4b62d1a469437dac9aebf">MaxBytesPerRequest</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MAXIMUM_BYTES_PER_REQUEST;}</div><div class="line"><a name="l00334"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a1c97cbaba799991bc23b9e8fba990557"> 334</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a1c97cbaba799991bc23b9e8fba990557">MaxRequestBeforeReseed</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> MAXIMUM_REQUESTS_BEFORE_RESEED;}</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a0d1f63a64a33fd5f5f4f86b15fc7fe19"> 336</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a0d1f63a64a33fd5f5f4f86b15fc7fe19">IncorporateEntropy</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span> *input, <span class="keywordtype">size_t</span> length)</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  {<span class="keywordflow">return</span> DRBG_Reseed(input, length, NULLPTR, 0);}</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a357fe4c203b2a0bde91d2781d61065f1"> 339</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a357fe4c203b2a0bde91d2781d61065f1">IncorporateEntropy</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span> *entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength)</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  {<span class="keywordflow">return</span> DRBG_Reseed(entropy, entropyLength, additional, additionaLength);}</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a3a1b3218ea5333da79b1339e942f617e"> 342</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a3a1b3218ea5333da79b1339e942f617e">GenerateBlock</a>(<span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  {<span class="keywordflow">return</span> HMAC_Generate(NULLPTR, 0, output, size);}</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"><a class="line" href="class_h_m_a_c___d_r_b_g.html#a77ef2b6bfd48696cc95eafc77da42230"> 345</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html#a77ef2b6bfd48696cc95eafc77da42230">GenerateBlock</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength, <span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  {<span class="keywordflow">return</span> HMAC_Generate(additional, additionaLength, output, size);}</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="keyword">protected</span>:</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// 10.1.2.3 Instantiation of HMAC_DRBG (p.45)</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordtype">void</span> DRBG_Instantiate(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* nonce, <span class="keywordtype">size_t</span> nonceLength,</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span>* personalization, <span class="keywordtype">size_t</span> personalizationLength);</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// 10.1.2.4 Reseeding a HMAC_DRBG Instantiation (p.46)</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordtype">void</span> DRBG_Reseed(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength);</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">// 10.1.2.5 Generating Pseudorandom Bits Using HMAC_DRBG (p.46)</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordtype">void</span> HMAC_Generate(<span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength, <span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size);</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// 10.1.2.2 Derivation Function Using a HMAC Function (HMAC_Update) (p.44)</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">void</span> HMAC_Update(<span class="keyword">const</span> <span class="keywordtype">byte</span>* input1, <span class="keywordtype">size_t</span> inlen1, <span class="keyword">const</span> <span class="keywordtype">byte</span>* input2, <span class="keywordtype">size_t</span> inlen2, <span class="keyword">const</span> <span class="keywordtype">byte</span>* input3, <span class="keywordtype">size_t</span> inlen3);</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> </div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> m_k, m_v;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  word64 m_reseed;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> };</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment">// typedef HMAC_DRBG<SHA1, 128/8, 440/8> HMAC_SHA1_DRBG;</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment">// typedef HMAC_DRBG<SHA256, 128/8, 440/8> HMAC_SHA256_DRBG;</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment">// typedef HMAC_DRBG<SHA384, 256/8, 888/8> HMAC_SHA384_DRBG;</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment">// typedef HMAC_DRBG<SHA512, 256/8, 888/8> HMAC_SHA512_DRBG;</span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment">// *************************************************************</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment">// 10.1.1.2 Instantiation of Hash_DRBG (p.39)</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="keyword">template</span> <<span class="keyword">typename</span> HASH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="keywordtype">void</span> <a class="code" href="class_hash___d_r_b_g.html">Hash_DRBG<HASH, STRENGTH, SEEDLENGTH>::DRBG_Instantiate</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* nonce, <span class="keywordtype">size_t</span> nonceLength,</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span>* personalization, <span class="keywordtype">size_t</span> personalizationLength)</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> {</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">// SP 800-90A, 8.6.3: The entropy input shall have entropy that is equal to or greater than the security</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="comment">// strength of the instantiation. Additional entropy may be provided in the nonce or the optional</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">// personalization string during instantiation, or in the additional input during reseeding and generation,</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">// but this is not required and does not increase the "official" security strength of the DRBG</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// instantiation that is recorded in the internal state.</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(entropyLength >= MINIMUM_ENTROPY);</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (entropyLength < MINIMUM_ENTROPY)</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">throw</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a>(<span class="stringliteral">"Hash_DRBG"</span>, <span class="stringliteral">"Insufficient entropy during instantiate"</span>);</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="comment">// SP 800-90A, Section 9, says we should throw if we have too much entropy, too large a nonce,</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// or too large a persoanlization string. We warn in Debug builds, but do nothing in Release builds.</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(entropyLength <= MAXIMUM_ENTROPY);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(nonceLength <= MAXIMUM_NONCE);</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(personalizationLength <= MAXIMUM_PERSONALIZATION);</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> </div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span> zero = 0;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> t1(SEEDLENGTH), t2(SEEDLENGTH);</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  Hash_Update(entropy, entropyLength, nonce, nonceLength, personalization, personalizationLength, NULLPTR, 0, t1, t1.size());</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  Hash_Update(&zero, 1, t1, t1.size(), NULLPTR, 0, NULLPTR, 0, t2, t2.size());</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> </div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  m_v.swap(t1); m_c.swap(t2);</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  m_reseed = 1;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> }</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> </div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment">// 10.1.1.3 Reseeding a Hash_DRBG Instantiation (p.40)</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="keyword">template</span> <<span class="keyword">typename</span> HASH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="keywordtype">void</span> <a class="code" href="class_hash___d_r_b_g.html">Hash_DRBG<HASH, STRENGTH, SEEDLENGTH>::DRBG_Reseed</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength)</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> {</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">// SP 800-90A, 8.6.3: The entropy input shall have entropy that is equal to or greater than the security</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// strength of the instantiation. Additional entropy may be provided in the nonce or the optional</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">// personalization string during instantiation, or in the additional input during reseeding and generation,</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// but this is not required and does not increase the "official" security strength of the DRBG</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="comment">// instantiation that is recorded in the internal state..</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(entropyLength >= MINIMUM_ENTROPY);</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">if</span> (entropyLength < MINIMUM_ENTROPY)</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">throw</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a>(<span class="stringliteral">"Hash_DRBG"</span>, <span class="stringliteral">"Insufficient entropy during reseed"</span>);</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">// SP 800-90A, Section 9, says we should throw if we have too much entropy, too large a nonce,</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="comment">// or too large a persoanlization string. We warn in Debug builds, but do nothing in Release builds.</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(entropyLength <= MAXIMUM_ENTROPY);</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(additionaLength <= MAXIMUM_ADDITIONAL);</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> </div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span> zero = 0, one = 1;</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> t1(SEEDLENGTH), t2(SEEDLENGTH);</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  Hash_Update(&one, 1, m_v, m_v.size(), entropy, entropyLength, additional, additionaLength, t1, t1.size());</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  Hash_Update(&zero, 1, t1, t1.size(), NULLPTR, 0, NULLPTR, 0, t2, t2.size());</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  m_v.swap(t1); m_c.swap(t2);</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  m_reseed = 1;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> }</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment">// 10.1.1.4 Generating Pseudorandom Bits Using Hash_DRBG (p.41)</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="keyword">template</span> <<span class="keyword">typename</span> HASH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="keywordtype">void</span> <a class="code" href="class_hash___d_r_b_g.html">Hash_DRBG<HASH, STRENGTH, SEEDLENGTH>::Hash_Generate</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength, <span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> {</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">// Step 1</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">if</span> (static_cast<word64>(m_reseed) >= static_cast<word64>(MaxRequestBeforeReseed()))</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">throw</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a>(<span class="stringliteral">"Hash_DRBG"</span>, <span class="stringliteral">"Reseed required"</span>);</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">if</span> (size > MaxBytesPerRequest())</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">throw</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a>(<span class="stringliteral">"Hash_DRBG"</span>, <span class="stringliteral">"Request size exceeds limit"</span>);</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> </div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// SP 800-90A, Section 9, says we should throw if we have too much entropy, too large a nonce,</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// or too large a persoanlization string. We warn in Debug builds, but do nothing in Release builds.</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(additionaLength <= MAXIMUM_ADDITIONAL);</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="comment">// Step 2</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (additional && additionaLength)</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  {</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  HASH hash;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span> two = 2;</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> w(HASH::DIGESTSIZE);</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> </div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  hash.Update(&two, 1);</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  hash.Update(m_v, m_v.size());</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  hash.Update(additional, additionaLength);</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  hash.Final(w);</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> </div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(SEEDLENGTH >= HASH::DIGESTSIZE);</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordtype">int</span> carry=0, j=HASH::DIGESTSIZE-1, i=SEEDLENGTH-1;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">while</span> (j>=0)</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  {</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  carry = m_v[i] + w[j] + carry;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  m_v[i] = static_cast<byte>(carry);</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  i--; j--; carry >>= 8;</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  }</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">while</span> (i>=0)</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  {</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  carry = m_v[i] + carry;</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  m_v[i] = static_cast<byte>(carry);</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  i--; carry >>= 8;</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  }</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="comment">// Step 3</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  {</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  HASH hash;</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> data(m_v);</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> </div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">while</span> (size)</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  {</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  hash.Update(data, data.size());</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordtype">size_t</span> count = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(size, (<span class="keywordtype">size_t</span>)HASH::DIGESTSIZE);</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  hash.TruncatedFinal(output, count);</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <a class="code" href="misc_8h.html#a44fad9d8c25e8aca3a7ee29345516f0a">IncrementCounterByOne</a>(data, static_cast<unsigned int>(data.size()));</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  size -= count; output += count;</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// Steps 4-7</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  {</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  HASH hash;</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span> three = 3;</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> h(HASH::DIGESTSIZE);</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> </div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  hash.Update(&three, 1);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  hash.Update(m_v, m_v.size());</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  hash.Final(h);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> </div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(SEEDLENGTH >= HASH::DIGESTSIZE);</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(HASH::DIGESTSIZE >= <span class="keyword">sizeof</span>(m_reseed));</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordtype">int</span> carry=0, k=<span class="keyword">sizeof</span>(m_reseed)-1, j=HASH::DIGESTSIZE-1, i=SEEDLENGTH-1;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="comment">// Using Integer class slows things down by about 8 cpb.</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="comment">// Using word128 and word64 benefits the first loop only by about 2 cpb.</span></div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="preprocessor">#if defined(CRYPTOPP_WORD128_AVAILABLE)</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordtype">byte</span>* p1 = m_v.begin()+SEEDLENGTH-8;</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordtype">byte</span>* p2 = m_c.begin()+SEEDLENGTH-8;</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordtype">byte</span>* p3 = h.begin()+HASH::DIGESTSIZE-8;</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">const</span> word64 w1 = GetWord<word64>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, p1);</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keyword">const</span> word64 w2 = GetWord<word64>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, p2);</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">const</span> word64 w3 = GetWord<word64>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, p3);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">const</span> word64 w4 = m_reseed;</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> </div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  word128 r = static_cast<word128>(w1) + w2 + w3 + w4;</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <a class="code" href="misc_8h.html#aef6a8d35198f71ff68811bacd599c664">PutWord</a>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, p1, static_cast<word64>(r));</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  i -= 8; j -= 8; k=0; carry = static_cast<int>(r >> 64);</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> </div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">// The default implementation and a couple of others cause a crash in</span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="comment">// VS2005, VS2008 and VS2105. This seems to work with all MS compilers.</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="preprocessor">#elif defined(CRYPTOPP_MSC_VERSION)</span></div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordtype">byte</span>* p1 = m_v.begin()+SEEDLENGTH-8;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordtype">byte</span>* p2 = m_c.begin()+SEEDLENGTH-8;</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordtype">byte</span>* p3 = h.begin()+HASH::DIGESTSIZE-8;</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> </div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keyword">const</span> word64 w1 = GetWord<word64>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, p1);</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keyword">const</span> word64 w2 = GetWord<word64>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, p2);</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keyword">const</span> word64 w3 = GetWord<word64>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, p3);</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keyword">const</span> word64 w4 = m_reseed;</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> </div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keyword">const</span> word64 r1 = (w1 & 0xffffffff) + (w2 & 0xffffffff) + (w3 & 0xffffffff) + (w4 & 0xffffffff);</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  carry = static_cast<int>(r1 >> 32);</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keyword">const</span> word64 r2 = (w1 >> 32) + (w2 >> 32) + (w3 >> 32) + (w4 >> 32) + carry;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  carry = static_cast<int>(r2 >> 32);</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> </div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keyword">const</span> word64 r = (r2 << 32) + (r1 & 0xffffffff);</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <a class="code" href="misc_8h.html#aef6a8d35198f71ff68811bacd599c664">PutWord</a>(<span class="keyword">false</span>, <a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, p1, r);</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  i -= 8; j -= 8; k=0;</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> </div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// Default implementation, but slower on some machines.</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">while</span> (k>=0)</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  {</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  carry = m_v[i] + m_c[i] + h[j] + GetByte<word64>(<a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, m_reseed, k) + carry;</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  m_v[i] = static_cast<byte>(carry);</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  i--; j--; k--; carry >>= 8;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  }</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> </div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">while</span> (j>=0)</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  {</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  carry = m_v[i] + m_c[i] + h[j] + carry;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  m_v[i] = static_cast<byte>(carry);</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  i--; j--; carry >>= 8;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  }</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">while</span> (i>=0)</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  {</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  carry = m_v[i] + m_c[i] + carry;</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  m_v[i] = static_cast<byte>(carry);</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  i--; carry >>= 8;</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  }</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> </div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// CRYPTOPP_WORD128_AVAILABLE causes -Wunused-but-set-variable</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  CRYPTOPP_UNUSED(k);</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  }</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> </div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  m_reseed++;</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> }</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> </div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment">// 10.3.1 Derivation Function Using a Hash Function (Hash_df) (p.49)</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="keyword">template</span> <<span class="keyword">typename</span> HASH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="keywordtype">void</span> <a class="code" href="class_hash___d_r_b_g.html">Hash_DRBG<HASH, STRENGTH, SEEDLENGTH>::Hash_Update</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* input1, <span class="keywordtype">size_t</span> inlen1, <span class="keyword">const</span> <span class="keywordtype">byte</span>* input2, <span class="keywordtype">size_t</span> inlen2,</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span>* input3, <span class="keywordtype">size_t</span> inlen3, <span class="keyword">const</span> <span class="keywordtype">byte</span>* input4, <span class="keywordtype">size_t</span> inlen4, <span class="keywordtype">byte</span>* output, <span class="keywordtype">size_t</span> outlen)</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> {</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  HASH hash;</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordtype">byte</span> counter = 1;</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  word32 bits = <a class="code" href="misc_8h.html#a8e499ded4f2e7e7705c3cfd39cdf137f">ConditionalByteReverse</a>(<a class="code" href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a>, static_cast<word32>(outlen*8));</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> </div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordflow">while</span> (outlen)</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  {</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  hash.Update(&counter, 1);</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  hash.Update(reinterpret_cast<const byte*>(&bits), 4);</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> </div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">if</span> (input1 && inlen1)</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  hash.Update(input1, inlen1);</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">if</span> (input2 && inlen2)</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  hash.Update(input2, inlen2);</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">if</span> (input3 && inlen3)</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  hash.Update(input3, inlen3);</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">if</span> (input4 && inlen4)</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  hash.Update(input4, inlen4);</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> </div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordtype">size_t</span> count = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(outlen, (<span class="keywordtype">size_t</span>)HASH::DIGESTSIZE);</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  hash.TruncatedFinal(output, count);</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> </div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  output += count; outlen -= count;</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  counter++;</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  }</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment">// *************************************************************</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment">// 10.1.2.3 Instantiation of HMAC_DRBG (p.45)</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="keyword">template</span> <<span class="keyword">typename</span> HASH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="keywordtype">void</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html">HMAC_DRBG<HASH, STRENGTH, SEEDLENGTH>::DRBG_Instantiate</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* nonce, <span class="keywordtype">size_t</span> nonceLength,</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span>* personalization, <span class="keywordtype">size_t</span> personalizationLength)</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> {</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// SP 800-90A, 8.6.3: The entropy input shall have entropy that is equal to or greater than the security</span></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// strength of the instantiation. Additional entropy may be provided in the nonce or the optional</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// personalization string during instantiation, or in the additional input during reseeding and generation,</span></div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// but this is not required and does not increase the "official" security strength of the DRBG</span></div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// instantiation that is recorded in the internal state.</span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(entropyLength >= MINIMUM_ENTROPY);</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">if</span> (entropyLength < MINIMUM_ENTROPY)</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">throw</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a>(<span class="stringliteral">"HMAC_DRBG"</span>, <span class="stringliteral">"Insufficient entropy during instantiate"</span>);</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> </div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">// SP 800-90A, Section 9, says we should throw if we have too much entropy, too large a nonce,</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// or too large a persoanlization string. We warn in Debug builds, but do nothing in Release builds.</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(entropyLength <= MAXIMUM_ENTROPY);</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(nonceLength <= MAXIMUM_NONCE);</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(personalizationLength <= MAXIMUM_PERSONALIZATION);</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> </div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  std::fill(m_k.begin(), m_k.begin()+m_k.size(), byte(0));</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  std::fill(m_v.begin(), m_v.begin()+m_v.size(), byte(1));</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> </div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  HMAC_Update(entropy, entropyLength, nonce, nonceLength, personalization, personalizationLength);</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  m_reseed = 1;</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> }</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> </div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment">// 10.1.2.4 Reseeding a HMAC_DRBG Instantiation (p.46)</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="keyword">template</span> <<span class="keyword">typename</span> HASH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="keywordtype">void</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html">HMAC_DRBG<HASH, STRENGTH, SEEDLENGTH>::DRBG_Reseed</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* entropy, <span class="keywordtype">size_t</span> entropyLength, <span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength)</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> {</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// SP 800-90A, 8.6.3: The entropy input shall have entropy that is equal to or greater than the security</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// strength of the instantiation. Additional entropy may be provided in the nonce or the optional</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="comment">// personalization string during instantiation, or in the additional input during reseeding and generation,</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// but this is not required and does not increase the "official" security strength of the DRBG</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="comment">// instantiation that is recorded in the internal state..</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(entropyLength >= MINIMUM_ENTROPY);</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">if</span> (entropyLength < MINIMUM_ENTROPY)</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordflow">throw</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a>(<span class="stringliteral">"HMAC_DRBG"</span>, <span class="stringliteral">"Insufficient entropy during reseed"</span>);</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> </div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// SP 800-90A, Section 9, says we should throw if we have too much entropy, too large a nonce,</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="comment">// or too large a persoanlization string. We warn in Debug builds, but do nothing in Release builds.</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(entropyLength <= MAXIMUM_ENTROPY);</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(additionaLength <= MAXIMUM_ADDITIONAL);</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> </div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  HMAC_Update(entropy, entropyLength, additional, additionaLength, NULLPTR, 0);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  m_reseed = 1;</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> }</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> </div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="comment">// 10.1.2.5 Generating Pseudorandom Bits Using HMAC_DRBG (p.46)</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span> <span class="keyword">template</span> <<span class="keyword">typename</span> HASH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> <span class="keywordtype">void</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html">HMAC_DRBG<HASH, STRENGTH, SEEDLENGTH>::HMAC_Generate</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* additional, <span class="keywordtype">size_t</span> additionaLength, <span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> size)</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> {</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="comment">// Step 1</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">if</span> (static_cast<word64>(m_reseed) >= static_cast<word64>(MaxRequestBeforeReseed()))</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordflow">throw</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a>(<span class="stringliteral">"HMAC_DRBG"</span>, <span class="stringliteral">"Reseed required"</span>);</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> </div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> (size > MaxBytesPerRequest())</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">throw</span> <a class="code" href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a>(<span class="stringliteral">"HMAC_DRBG"</span>, <span class="stringliteral">"Request size exceeds limit"</span>);</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> </div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">// SP 800-90A, Section 9, says we should throw if we have too much entropy, too large a nonce,</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="comment">// or too large a persoanlization string. We warn in Debug builds, but do nothing in Release builds.</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(additionaLength <= MAXIMUM_ADDITIONAL);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span> </div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="comment">// Step 2</span></div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">if</span> (additional && additionaLength)</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  HMAC_Update(additional, additionaLength, NULLPTR, 0, NULLPTR, 0);</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> </div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">// Step 3</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <a class="code" href="class_h_m_a_c.html">HMAC<HASH></a> hmac;</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  hmac.<a class="code" href="class_simple_keying_interface.html#adf3c29b3ef3af74788a58c7c49887fd7">SetKey</a>(m_k, m_k.size());</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> </div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">while</span> (size)</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  {</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(m_v, m_v.size());</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#a5454c1446981ddee322b0521c6ebd375">TruncatedFinal</a>(m_v, m_v.size());</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> </div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keywordtype">size_t</span> count = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(size, (<span class="keywordtype">size_t</span>)HASH::DIGESTSIZE);</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  memcpy(output, m_v, count);</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span> </div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  size -= count; output += count;</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  }</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span> </div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  HMAC_Update(additional, additionaLength, NULLPTR, 0, NULLPTR, 0);</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  m_reseed++;</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> }</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> </div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="comment">// 10.1.2.2 Derivation Function Using a HMAC Function (HMAC_Update) (p.44)</span></div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span> <span class="keyword">template</span> <<span class="keyword">typename</span> HASH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> STRENGTH, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> SEEDLENGTH></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span> <span class="keywordtype">void</span> <a class="code" href="class_h_m_a_c___d_r_b_g.html">HMAC_DRBG<HASH, STRENGTH, SEEDLENGTH>::HMAC_Update</a>(<span class="keyword">const</span> <span class="keywordtype">byte</span>* input1, <span class="keywordtype">size_t</span> inlen1, <span class="keyword">const</span> <span class="keywordtype">byte</span>* input2, <span class="keywordtype">size_t</span> inlen2, <span class="keyword">const</span> <span class="keywordtype">byte</span>* input3, <span class="keywordtype">size_t</span> inlen3)</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span> {</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keyword">const</span> <span class="keywordtype">byte</span> zero = 0, one = 1;</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <a class="code" href="class_h_m_a_c.html">HMAC<HASH></a> hmac;</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> </div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// Step 1</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  hmac.<a class="code" href="class_simple_keying_interface.html#adf3c29b3ef3af74788a58c7c49887fd7">SetKey</a>(m_k, m_k.size());</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(m_v, m_v.size());</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(&zero, 1);</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> </div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordflow">if</span> (input1 && inlen1)</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(input1, inlen1);</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keywordflow">if</span> (input2 && inlen2)</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(input2, inlen2);</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordflow">if</span> (input3 && inlen3)</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(input3, inlen3);</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> </div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#a5454c1446981ddee322b0521c6ebd375">TruncatedFinal</a>(m_k, m_k.size());</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> </div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="comment">// Step 2</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  hmac.<a class="code" href="class_simple_keying_interface.html#adf3c29b3ef3af74788a58c7c49887fd7">SetKey</a>(m_k, m_k.size());</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(m_v, m_v.size());</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> </div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#a5454c1446981ddee322b0521c6ebd375">TruncatedFinal</a>(m_v, m_v.size());</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> </div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="comment">// Step 3</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordflow">if</span> ((inlen1 | inlen2 | inlen3) == 0)</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> </div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="comment">// Step 4</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  hmac.<a class="code" href="class_simple_keying_interface.html#adf3c29b3ef3af74788a58c7c49887fd7">SetKey</a>(m_k, m_k.size());</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(m_v, m_v.size());</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(&one, 1);</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span> </div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordflow">if</span> (input1 && inlen1)</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(input1, inlen1);</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">if</span> (input2 && inlen2)</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(input2, inlen2);</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">if</span> (input3 && inlen3)</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(input3, inlen3);</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span> </div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#a5454c1446981ddee322b0521c6ebd375">TruncatedFinal</a>(m_k, m_k.size());</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> </div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="comment">// Step 5</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  hmac.<a class="code" href="class_simple_keying_interface.html#adf3c29b3ef3af74788a58c7c49887fd7">SetKey</a>(m_k, m_k.size());</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">Update</a>(m_v, m_v.size());</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> </div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  hmac.<a class="code" href="class_h_m_a_c___base.html#a5454c1446981ddee322b0521c6ebd375">TruncatedFinal</a>(m_v, m_v.size());</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> }</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span> </div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> NAMESPACE_END</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span> </div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> <span class="preprocessor">#endif // CRYPTOPP_NIST_DRBG_H</span></div><div class="ttc" id="class_hash___d_r_b_g_html_a8c84ffe9d5eacf52d74c3ab3a038ab12"><div class="ttname"><a href="class_hash___d_r_b_g.html#a8c84ffe9d5eacf52d74c3ab3a038ab12">Hash_DRBG::Hash_DRBG</a></div><div class="ttdeci">Hash_DRBG(const byte *entropy=NULL, size_t entropyLength=STRENGTH, const byte *nonce=NULL, size_t nonceLength=0, const byte *personalization=NULL, size_t personalizationLength=0)</div><div class="ttdoc">Construct a Hash DRBG.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00206">drbg.h:206</a></div></div>
<div class="ttc" id="class_exception_html"><div class="ttname"><a href="class_exception.html">Exception</a></div><div class="ttdoc">Base class for all exceptions thrown by the library.</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00155">cryptlib.h:155</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a0d1f63a64a33fd5f5f4f86b15fc7fe19"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a0d1f63a64a33fd5f5f4f86b15fc7fe19">HMAC_DRBG::IncorporateEntropy</a></div><div class="ttdeci">void IncorporateEntropy(const byte *input, size_t length)</div><div class="ttdoc">Update RNG state with additional unpredictable values.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00336">drbg.h:336</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_aab39cc27d139cb77f0d3f0e8503632fa"><div class="ttname"><a href="class_hash___d_r_b_g.html#aab39cc27d139cb77f0d3f0e8503632fa">Hash_DRBG::SecurityStrength</a></div><div class="ttdeci">unsigned int SecurityStrength() const</div><div class="ttdoc">Provides the security strength.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00214">drbg.h:214</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a865caa1cf749a12cd7e540554576b307"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a865caa1cf749a12cd7e540554576b307">HMAC_DRBG::HMAC_DRBG</a></div><div class="ttdeci">HMAC_DRBG(const byte *entropy=NULL, size_t entropyLength=STRENGTH, const byte *nonce=NULL, size_t nonceLength=0, const byte *personalization=NULL, size_t personalizationLength=0)</div><div class="ttdoc">Construct a HMAC DRBG.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00319">drbg.h:319</a></div></div>
<div class="ttc" id="class_simple_keying_interface_html_adf3c29b3ef3af74788a58c7c49887fd7"><div class="ttname"><a href="class_simple_keying_interface.html#adf3c29b3ef3af74788a58c7c49887fd7">SimpleKeyingInterface::SetKey</a></div><div class="ttdeci">virtual void SetKey(const byte *key, size_t length, const NameValuePairs &params=g_nullNameValuePairs)</div><div class="ttdoc">Sets or reset the key of this object.</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8cpp_source.html#l00064">cryptlib.cpp:64</a></div></div>
<div class="ttc" id="class_s_h_a256_html"><div class="ttname"><a href="class_s_h_a256.html">SHA256</a></div><div class="ttdoc">SHA-256 message digest.</div><div class="ttdef"><b>Definition:</b> <a href="sha_8h_source.html#l00062">sha.h:62</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_a4126f6f30e058ba4112c17fffeb0173d"><div class="ttname"><a href="class_hash___d_r_b_g.html#a4126f6f30e058ba4112c17fffeb0173d">Hash_DRBG::MaxRequestBeforeReseed</a></div><div class="ttdeci">unsigned int MaxRequestBeforeReseed() const</div><div class="ttdoc">Provides the maximum number of requests before a reseed.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00221">drbg.h:221</a></div></div>
<div class="ttc" id="misc_8h_html_a44fad9d8c25e8aca3a7ee29345516f0a"><div class="ttname"><a href="misc_8h.html#a44fad9d8c25e8aca3a7ee29345516f0a">IncrementCounterByOne</a></div><div class="ttdeci">void IncrementCounterByOne(byte *inout, unsigned int size)</div><div class="ttdoc">Performs an addition with carry on a block of bytes.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l01108">misc.h:1108</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a10988d5e619883eaa0f2048eb2dd7521"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a10988d5e619883eaa0f2048eb2dd7521">HMAC_DRBG::SeedLength</a></div><div class="ttdeci">unsigned int SeedLength() const</div><div class="ttdoc">Provides the seed length.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00328">drbg.h:328</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_a50bf4c5f0523a2ed950f24287a1eef05"><div class="ttname"><a href="class_hash___d_r_b_g.html#a50bf4c5f0523a2ed950f24287a1eef05">Hash_DRBG::IncorporateEntropy</a></div><div class="ttdeci">void IncorporateEntropy(const byte *entropy, size_t entropyLength, const byte *additional, size_t additionaLength)</div><div class="ttdoc">Update RNG state with additional unpredictable values.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00226">drbg.h:226</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="class_h_m_a_c___d_r_b_g_html_a2b89c21e125fac466aad111fd3ce60d4"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a2b89c21e125fac466aad111fd3ce60d4">HMAC_DRBG::MinEntropyLength</a></div><div class="ttdeci">unsigned int MinEntropyLength() const</div><div class="ttdoc">Provides the minimum entropy size.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00329">drbg.h:329</a></div></div>
<div class="ttc" id="cryptlib_8h_html"><div class="ttname"><a href="cryptlib_8h.html">cryptlib.h</a></div><div class="ttdoc">Abstract base classes that provide a uniform interface to this library.</div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a77ef2b6bfd48696cc95eafc77da42230"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a77ef2b6bfd48696cc95eafc77da42230">HMAC_DRBG::GenerateBlock</a></div><div class="ttdeci">void GenerateBlock(const byte *additional, size_t additionaLength, byte *output, size_t size)</div><div class="ttdoc">Generate random array of bytes.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00345">drbg.h:345</a></div></div>
<div class="ttc" id="class_random_number_generator_html"><div class="ttname"><a href="class_random_number_generator.html">RandomNumberGenerator</a></div><div class="ttdoc">Interface for random number generators.</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l01330">cryptlib.h:1330</a></div></div>
<div class="ttc" id="class_sec_byte_block_html"><div class="ttname"><a href="class_sec_byte_block.html">SecByteBlock</a></div><div class="ttdoc">SecBlock<byte> typedef.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00822">secblock.h:822</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_af847fbe7ecc0711c1c83e191b2db411f"><div class="ttname"><a href="class_hash___d_r_b_g.html#af847fbe7ecc0711c1c83e191b2db411f">Hash_DRBG::MinEntropyLength</a></div><div class="ttdeci">unsigned int MinEntropyLength() const</div><div class="ttdoc">Provides the minimum entropy size.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00216">drbg.h:216</a></div></div>
<div class="ttc" id="secblock_8h_html"><div class="ttname"><a href="secblock_8h.html">secblock.h</a></div><div class="ttdoc">Classes and functions for secure memory allocations.</div></div>
<div class="ttc" id="hmac_8h_html"><div class="ttname"><a href="hmac_8h.html">hmac.h</a></div><div class="ttdoc">Classes for HMAC message authentication codes.</div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_a1b064dc340098f5678a0ac8ddd928f03"><div class="ttname"><a href="class_hash___d_r_b_g.html#a1b064dc340098f5678a0ac8ddd928f03">Hash_DRBG::MinNonceLength</a></div><div class="ttdeci">unsigned int MinNonceLength() const</div><div class="ttdoc">Provides the minimum nonce size.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00218">drbg.h:218</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_a1f2e5bc3154903d433fa26e68b0ab6e4"><div class="ttname"><a href="class_hash___d_r_b_g.html#a1f2e5bc3154903d433fa26e68b0ab6e4">Hash_DRBG::IncorporateEntropy</a></div><div class="ttdeci">void IncorporateEntropy(const byte *input, size_t length)</div><div class="ttdoc">Update RNG state with additional unpredictable values.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00223">drbg.h:223</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a357fe4c203b2a0bde91d2781d61065f1"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a357fe4c203b2a0bde91d2781d61065f1">HMAC_DRBG::IncorporateEntropy</a></div><div class="ttdeci">void IncorporateEntropy(const byte *entropy, size_t entropyLength, const byte *additional, size_t additionaLength)</div><div class="ttdoc">Update RNG state with additional unpredictable values.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00339">drbg.h:339</a></div></div>
<div class="ttc" id="class_n_i_s_t___d_r_b_g_1_1_err_html"><div class="ttname"><a href="class_n_i_s_t___d_r_b_g_1_1_err.html">NIST_DRBG::Err</a></div><div class="ttdoc">Exception thrown when a NIST DRBG encounters an error.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00028">drbg.h:28</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_a36c1b1145370ef352ea6582d49491a62"><div class="ttname"><a href="class_hash___d_r_b_g.html#a36c1b1145370ef352ea6582d49491a62">Hash_DRBG::GenerateBlock</a></div><div class="ttdeci">void GenerateBlock(const byte *additional, size_t additionaLength, byte *output, size_t size)</div><div class="ttdoc">Generate random array of bytes.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00232">drbg.h:232</a></div></div>
<div class="ttc" id="misc_8h_html_a8e499ded4f2e7e7705c3cfd39cdf137f"><div class="ttname"><a href="misc_8h.html#a8e499ded4f2e7e7705c3cfd39cdf137f">ConditionalByteReverse</a></div><div class="ttdeci">T ConditionalByteReverse(ByteOrder order, T value)</div><div class="ttdoc">Reverses bytes in a value depending upon endianness.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l01979">misc.h:1979</a></div></div>
<div class="ttc" id="class_h_m_a_c___base_html_aefb8a1fb43ef8c9390ee89bbb41c83af"><div class="ttname"><a href="class_h_m_a_c___base.html#aefb8a1fb43ef8c9390ee89bbb41c83af">HMAC_Base::Update</a></div><div class="ttdeci">void Update(const byte *input, size_t length)</div><div class="ttdoc">Updates a hash with additional input.</div><div class="ttdef"><b>Definition:</b> <a href="hmac_8cpp_source.html#l00060">hmac.cpp:60</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_aa5dabccf451a510d1af4ae80100e966f"><div class="ttname"><a href="class_hash___d_r_b_g.html#aa5dabccf451a510d1af4ae80100e966f">Hash_DRBG::GenerateBlock</a></div><div class="ttdeci">void GenerateBlock(byte *output, size_t size)</div><div class="ttdoc">Generate random array of bytes.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00229">drbg.h:229</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html">HMAC_DRBG</a></div><div class="ttdoc">HMAC_DRBG from SP 800-90A Rev 1 (June 2015)</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00276">drbg.h:276</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a68b996c75ae7ec594e94b76ddbfbe2d3"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a68b996c75ae7ec594e94b76ddbfbe2d3">HMAC_DRBG::MinNonceLength</a></div><div class="ttdeci">unsigned int MinNonceLength() const</div><div class="ttdoc">Provides the minimum nonce size.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00331">drbg.h:331</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_a23df63d27368ac3e3b7e333ff8a1889c"><div class="ttname"><a href="class_hash___d_r_b_g.html#a23df63d27368ac3e3b7e333ff8a1889c">Hash_DRBG::SeedLength</a></div><div class="ttdeci">unsigned int SeedLength() const</div><div class="ttdoc">Provides the seed length.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00215">drbg.h:215</a></div></div>
<div class="ttc" id="cryptlib_8h_html_aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57"><div class="ttname"><a href="cryptlib_8h.html#aaeb92d42f5a6e27b8ba19f18d69d142baf0c3bb6c718cc7ff0bffef4e8f178c57">BIG_ENDIAN_ORDER</a></div><div class="ttdoc">byte order is big-endian</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00144">cryptlib.h:144</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_a4e38edb5aace7dba611604aba7c733b1"><div class="ttname"><a href="class_hash___d_r_b_g.html#a4e38edb5aace7dba611604aba7c733b1">Hash_DRBG::MaxBytesPerRequest</a></div><div class="ttdeci">unsigned int MaxBytesPerRequest() const</div><div class="ttdoc">Provides the maximum size of a request to GenerateBlock.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00220">drbg.h:220</a></div></div>
<div class="ttc" id="misc_8h_html_abe412b0409249cb54899e97bc7d86424"><div class="ttname"><a href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a></div><div class="ttdeci">const T & STDMIN(const T &a, const T &b)</div><div class="ttdoc">Replacement function for std::min.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00507">misc.h:507</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="class_h_m_a_c___base_html_a5454c1446981ddee322b0521c6ebd375"><div class="ttname"><a href="class_h_m_a_c___base.html#a5454c1446981ddee322b0521c6ebd375">HMAC_Base::TruncatedFinal</a></div><div class="ttdeci">void TruncatedFinal(byte *mac, size_t size)</div><div class="ttdoc">Computes the hash of the current message.</div><div class="ttdef"><b>Definition:</b> <a href="hmac_8cpp_source.html#l00067">hmac.cpp:67</a></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="class_hash___d_r_b_g_html"><div class="ttname"><a href="class_hash___d_r_b_g.html">Hash_DRBG</a></div><div class="ttdoc">Hash_DRBG from SP 800-90A Rev 1 (June 2015)</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00163">drbg.h:163</a></div></div>
<div class="ttc" id="class_h_m_a_c_html"><div class="ttname"><a href="class_h_m_a_c.html">HMAC</a></div><div class="ttdoc">HMAC.</div><div class="ttdef"><b>Definition:</b> <a href="hmac_8h_source.html#l00050">hmac.h:50</a></div></div>
<div class="ttc" id="class_n_i_s_t___d_r_b_g_html"><div class="ttname"><a href="class_n_i_s_t___d_r_b_g.html">NIST_DRBG</a></div><div class="ttdoc">Interface for NIST DRBGs from SP 800-90A.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00024">drbg.h:24</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a1c97cbaba799991bc23b9e8fba990557"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a1c97cbaba799991bc23b9e8fba990557">HMAC_DRBG::MaxRequestBeforeReseed</a></div><div class="ttdeci">unsigned int MaxRequestBeforeReseed() const</div><div class="ttdoc">Provides the maximum number of requests before a reseed.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00334">drbg.h:334</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_a1ca8d90554785991408e33e604726346"><div class="ttname"><a href="class_hash___d_r_b_g.html#a1ca8d90554785991408e33e604726346">Hash_DRBG::MaxEntropyLength</a></div><div class="ttdeci">unsigned int MaxEntropyLength() const</div><div class="ttdoc">Provides the maximum entropy size.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00217">drbg.h:217</a></div></div>
<div class="ttc" id="class_hash___d_r_b_g_html_ae3d30c8dd306142559372c8c6b5426e0"><div class="ttname"><a href="class_hash___d_r_b_g.html#ae3d30c8dd306142559372c8c6b5426e0">Hash_DRBG::MaxNonceLength</a></div><div class="ttdeci">unsigned int MaxNonceLength() const</div><div class="ttdoc">Provides the maximum nonce size.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00219">drbg.h:219</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a63dda8cecfd4b62d1a469437dac9aebf"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a63dda8cecfd4b62d1a469437dac9aebf">HMAC_DRBG::MaxBytesPerRequest</a></div><div class="ttdeci">unsigned int MaxBytesPerRequest() const</div><div class="ttdoc">Provides the maximum size of a request to GenerateBlock.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00333">drbg.h:333</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a75089a266a2210a1291f9f1a183fe6cc"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a75089a266a2210a1291f9f1a183fe6cc">HMAC_DRBG::MaxEntropyLength</a></div><div class="ttdeci">unsigned int MaxEntropyLength() const</div><div class="ttdoc">Provides the maximum entropy size.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00330">drbg.h:330</a></div></div>
<div class="ttc" id="class_n_i_s_t___d_r_b_g_html_a87e4721ea7bc6859abc85dc00130c3cb"><div class="ttname"><a href="class_n_i_s_t___d_r_b_g.html#a87e4721ea7bc6859abc85dc00130c3cb">NIST_DRBG::CanIncorporateEntropy</a></div><div class="ttdeci">virtual bool CanIncorporateEntropy() const</div><div class="ttdoc">Determines if a generator can accept additional entropy.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00041">drbg.h:41</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_not_copyable_html"><div class="ttname"><a href="class_not_copyable.html">NotCopyable</a></div><div class="ttdoc">Ensures an object is not copyable.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00228">misc.h:228</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_acef26a07b7751468326b40a5441fdb76"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#acef26a07b7751468326b40a5441fdb76">HMAC_DRBG::MaxNonceLength</a></div><div class="ttdeci">unsigned int MaxNonceLength() const</div><div class="ttdoc">Provides the maximum nonce size.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00332">drbg.h:332</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a3a1b3218ea5333da79b1339e942f617e"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a3a1b3218ea5333da79b1339e942f617e">HMAC_DRBG::GenerateBlock</a></div><div class="ttdeci">void GenerateBlock(byte *output, size_t size)</div><div class="ttdoc">Generate random array of bytes.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00342">drbg.h:342</a></div></div>
<div class="ttc" id="class_h_m_a_c___d_r_b_g_html_a6392fd224c2a34dca0bb1fb4782e87a4"><div class="ttname"><a href="class_h_m_a_c___d_r_b_g.html#a6392fd224c2a34dca0bb1fb4782e87a4">HMAC_DRBG::SecurityStrength</a></div><div class="ttdeci">unsigned int SecurityStrength() const</div><div class="ttdoc">Provides the security strength.</div><div class="ttdef"><b>Definition:</b> <a href="drbg_8h_source.html#l00327">drbg.h:327</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:29 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
>
2206
