<!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++: gf2n.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Crypto++
 <span id="projectnumber">7.0</span>
</div>
<div id="projectbrief">Free C++ class library of cryptographic schemes</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">gf2n.cpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// gf2n.cpp - originally written and placed in the public domain by Wei Dai</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor">#include "<a class="code" href="pch_8h.html">pch.h</a>"</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="preprocessor">#include "<a class="code" href="config_8h.html">config.h</a>"</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> </div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include "<a class="code" href="cryptlib_8h.html">cryptlib.h</a>"</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include "<a class="code" href="algebra_8h.html">algebra.h</a>"</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "<a class="code" href="randpool_8h.html">randpool.h</a>"</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include "<a class="code" href="filters_8h.html">filters.h</a>"</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include "<a class="code" href="smartptr_8h.html">smartptr.h</a>"</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include "words.h"</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="misc_8h.html">misc.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include "<a class="code" href="gf2n_8h.html">gf2n.h</a>"</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include "<a class="code" href="asn_8h.html">asn.h</a>"</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include "<a class="code" href="oids_8h.html">oids.h</a>"</span></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="preprocessor">#include <iostream></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// Issue 340</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#if CRYPTOPP_GCC_DIAGNOSTIC_AVAILABLE</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor"># pragma GCC diagnostic ignored "-Wconversion"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor"># pragma GCC diagnostic ignored "-Wsign-conversion"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> NAMESPACE_BEGIN(<a class="code" href="namespace_crypto_p_p.html">CryptoPP</a>)</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#ac67d4fb61b199c101f5de08d3aa2e782"> 29</a></span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>::<a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>()</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> {</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> }</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a51790dcfe87a449169e8cb5c0f20da7e"> 33</a></span> <a class="code" href="class_polynomial_mod2.html#ac67d4fb61b199c101f5de08d3aa2e782">PolynomialMod2::PolynomialMod2</a>(word value, <span class="keywordtype">size_t</span> bitLength)</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  : reg(<a class="code" href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a>(bitLength))</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(value==0 || reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()>0);</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> (reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>() > 0)</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  reg[0] = value;</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  SetWords(reg+1, 0, reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()-1);</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  }</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> }</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a6866391c010ebef60c452df7961e809c"> 45</a></span> <a class="code" href="class_polynomial_mod2.html#ac67d4fb61b199c101f5de08d3aa2e782">PolynomialMod2::PolynomialMod2</a>(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>& t)</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  : reg(t.reg.size())</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  CopyWords(reg, t.reg, reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> }</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> </div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keywordtype">void</span> PolynomialMod2::Randomize(<a class="code" href="class_random_number_generator.html">RandomNumberGenerator</a> &rng, <span class="keywordtype">size_t</span> nbits)</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> nbytes = nbits/8 + 1;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="class_sec_byte_block.html">SecByteBlock</a> buf(nbytes);</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  rng.<a class="code" href="class_random_number_generator.html#a497145546d24e6d4abaf10b7e0f1ba17">GenerateBlock</a>(buf, nbytes);</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  buf[0] = (byte)<a class="code" href="misc_8h.html#a616a7f0365c4947b0c8a44606c525a62">Crop</a>(buf[0], nbits % 8);</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  Decode(buf, nbytes);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> }</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#abf3ecc0dafe04c57dacea983a9a6690e"> 60</a></span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> <a class="code" href="class_polynomial_mod2.html#abf3ecc0dafe04c57dacea983a9a6690e">PolynomialMod2::AllOnes</a>(<span class="keywordtype">size_t</span> bitLength)</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> {</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> result((word)0, bitLength);</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  SetWords(result.reg, word(<a class="code" href="misc_8h.html#a3c75bb398badb69c7577b21486f9963f">SIZE_MAX</a>), result.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">if</span> (bitLength%WORD_BITS)</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  result.reg[result.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()-1] = (word)<a class="code" href="misc_8h.html#a616a7f0365c4947b0c8a44606c525a62">Crop</a>(result.reg[result.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()-1], bitLength%WORD_BITS);</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> }</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="keywordtype">void</span> PolynomialMod2::SetBit(<span class="keywordtype">size_t</span> n, <span class="keywordtype">int</span> value)</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (value)</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  reg.<a class="code" href="class_sec_block.html#a4ef9516e973051e6afa38bba526da3e9">CleanGrow</a>(n/WORD_BITS + 1);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  reg[n/WORD_BITS] |= (word(1) << (n%WORD_BITS));</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (n/WORD_BITS < reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>())</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  reg[n/WORD_BITS] &= ~(word(1) << (n%WORD_BITS));</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> }</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a7a24a5ec904f384e4285d133dbe07757"> 83</a></span> <span class="keywordtype">byte</span> <a class="code" href="class_polynomial_mod2.html#a7a24a5ec904f384e4285d133dbe07757">PolynomialMod2::GetByte</a>(<span class="keywordtype">size_t</span> n)<span class="keyword"> const</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="keyword"></span>{</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (n/WORD_SIZE >= reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>())</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> byte(reg[n/WORD_SIZE] >> ((n%WORD_SIZE)*8));</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> }</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#af15c7ead361d1f7ea23d5e4bd5535989"> 91</a></span> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#af15c7ead361d1f7ea23d5e4bd5535989">PolynomialMod2::SetByte</a>(<span class="keywordtype">size_t</span> n, <span class="keywordtype">byte</span> value)</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> {</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  reg.<a class="code" href="class_sec_block.html#a4ef9516e973051e6afa38bba526da3e9">CleanGrow</a>(<a class="code" href="misc_8h.html#a886cc7ce76578c6df939f564f676e71a">BytesToWords</a>(n+1));</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  reg[n/WORD_SIZE] &= ~(word(0xff) << 8*(n%WORD_SIZE));</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  reg[n/WORD_SIZE] |= (word(value) << 8*(n%WORD_SIZE));</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a87949fb32436e1f2f96d7b813405c032"> 98</a></span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> <a class="code" href="class_polynomial_mod2.html#a87949fb32436e1f2f96d7b813405c032">PolynomialMod2::Monomial</a>(<span class="keywordtype">size_t</span> i)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> r((word)0, i+1);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  r.SetBit(i);</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> r;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> }</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a6d843c32a41885cb33d0aec19e40dda6"> 105</a></span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> <a class="code" href="class_polynomial_mod2.html#a6d843c32a41885cb33d0aec19e40dda6">PolynomialMod2::Trinomial</a>(<span class="keywordtype">size_t</span> t0, <span class="keywordtype">size_t</span> t1, <span class="keywordtype">size_t</span> t2)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> r((word)0, t0+1);</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  r.SetBit(t0);</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  r.SetBit(t1);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  r.SetBit(t2);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> r;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a507094d47020af3d23a9fd68cc4b527d"> 114</a></span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> <a class="code" href="class_polynomial_mod2.html#a507094d47020af3d23a9fd68cc4b527d">PolynomialMod2::Pentanomial</a>(<span class="keywordtype">size_t</span> t0, <span class="keywordtype">size_t</span> t1, <span class="keywordtype">size_t</span> t2, <span class="keywordtype">size_t</span> t3, <span class="keywordtype">size_t</span> t4)</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> {</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> r((word)0, t0+1);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  r.SetBit(t0);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  r.SetBit(t1);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  r.SetBit(t2);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  r.SetBit(t3);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  r.SetBit(t4);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> r;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> }</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="keyword">template</span> <word i></div><div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="struct_new_polynomial_mod2.html"> 126</a></span> <span class="keyword">struct </span><a class="code" href="struct_new_polynomial_mod2.html">NewPolynomialMod2</a></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> {</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> * operator()()<span class="keyword"> const</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>(i);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> };</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a11c7e95fb64a071952df785bb4036437"> 134</a></span> <span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &<a class="code" href="class_polynomial_mod2.html#a11c7e95fb64a071952df785bb4036437">PolynomialMod2::Zero</a>()</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">return</span> <a class="code" href="class_singleton.html">Singleton<PolynomialMod2></a>().<a class="code" href="class_singleton.html#a2dfafdfafaaf20ca4cfc550125f6332d">Ref</a>();</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a6d96db42fd089c139d6af6da6d6bc331"> 139</a></span> <span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &<a class="code" href="class_polynomial_mod2.html#a6d96db42fd089c139d6af6da6d6bc331">PolynomialMod2::One</a>()</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> {</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">return</span> <a class="code" href="class_singleton.html">Singleton<PolynomialMod2, NewPolynomialMod2<1></a> >().Ref();</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> </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="keywordtype">void</span> PolynomialMod2::Decode(<span class="keyword">const</span> <span class="keywordtype">byte</span> *input, <span class="keywordtype">size_t</span> inputLen)</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>  <a class="code" href="class_string_store.html">StringStore</a> store(input, inputLen);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  Decode(store, inputLen);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a1f444d22084163c2b69b5ade313aef14"> 150</a></span> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#a1f444d22084163c2b69b5ade313aef14">PolynomialMod2::Encode</a>(<span class="keywordtype">byte</span> *output, <span class="keywordtype">size_t</span> outputLen)<span class="keyword"> const</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="keyword"></span>{</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="class_array_sink.html">ArraySink</a> sink(output, outputLen);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <a class="code" href="class_polynomial_mod2.html#a1f444d22084163c2b69b5ade313aef14">Encode</a>(sink, outputLen);</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> }</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="keywordtype">void</span> PolynomialMod2::Decode(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &bt, <span class="keywordtype">size_t</span> inputLen)</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(bt.<a class="code" href="class_buffered_transformation.html#a30b2076bce5fb29e992b6457485c67c2">MaxRetrievable</a>() >= inputLen);</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (bt.<a class="code" href="class_buffered_transformation.html#a30b2076bce5fb29e992b6457485c67c2">MaxRetrievable</a>() < inputLen)</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">throw</span> <a class="code" href="class_invalid_argument.html">InvalidArgument</a>(<span class="stringliteral">"PolynomialMod2: input length is too small"</span>);</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> </div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  reg.<a class="code" href="class_sec_block.html#a2d78e75002fd02e5b89bd72a9e65e769">CleanNew</a>(<a class="code" href="misc_8h.html#a886cc7ce76578c6df939f564f676e71a">BytesToWords</a>(inputLen));</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=inputLen; i > 0; i--)</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordtype">byte</span> b;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  (void)bt.<a class="code" href="class_buffered_transformation.html#a9e1ad913c8fe697d269f408a7d5928fc">Get</a>(b);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  reg[(i-1)/WORD_SIZE] |= word(b) << ((i-1)%WORD_SIZE)*8;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#a1f444d22084163c2b69b5ade313aef14">PolynomialMod2::Encode</a>(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &bt, <span class="keywordtype">size_t</span> outputLen)<span class="keyword"> const</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="keyword"></span>{</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=outputLen; i > 0; i--)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  bt.<a class="code" href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede">Put</a>(<a class="code" href="class_polynomial_mod2.html#a7a24a5ec904f384e4285d133dbe07757">GetByte</a>(i-1));</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a1773769992c5487674bcb8a0688fd6f8"> 178</a></span> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#a1773769992c5487674bcb8a0688fd6f8">PolynomialMod2::DEREncodeAsOctetString</a>(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &bt, <span class="keywordtype">size_t</span> length)<span class="keyword"> const</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="keyword"></span>{</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="class_d_e_r_general_encoder.html">DERGeneralEncoder</a> enc(bt, OCTET_STRING);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="class_polynomial_mod2.html#a1f444d22084163c2b69b5ade313aef14">Encode</a>(enc, length);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  enc.MessageEnd();</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> }</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div><div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a69c7853e0d24f1056be18112ee4f5a8e"> 185</a></span> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#a69c7853e0d24f1056be18112ee4f5a8e">PolynomialMod2::BERDecodeAsOctetString</a>(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &bt, <span class="keywordtype">size_t</span> length)</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <a class="code" href="class_b_e_r_general_decoder.html">BERGeneralDecoder</a> dec(bt, OCTET_STRING);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">if</span> (!dec.IsDefiniteLength() || dec.RemainingLength() != length)</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="code" href="asn_8h.html#afaf6b517352dfdaa7cc68ccb8396cba5">BERDecodeError</a>();</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  Decode(dec, length);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  dec.MessageEnd();</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> }</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a88292d16af59aaed460503b6339145b3"> 194</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_polynomial_mod2.html#a88292d16af59aaed460503b6339145b3">PolynomialMod2::WordCount</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="keyword"></span>{</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">return</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)CountWords(reg, reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> }</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> </div><div class="line"><a name="l00199"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#ad22cb6a5fcb0a78646059cf0005d2f6b"> 199</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_polynomial_mod2.html#ad22cb6a5fcb0a78646059cf0005d2f6b">PolynomialMod2::ByteCount</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="keyword"></span>{</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">unsigned</span> wordCount = <a class="code" href="class_polynomial_mod2.html#a88292d16af59aaed460503b6339145b3">WordCount</a>();</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">if</span> (wordCount)</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">return</span> (wordCount-1)*WORD_SIZE + <a class="code" href="misc_8h.html#a3e22fbd4b8f95aa01bde93ea32e44e82">BytePrecision</a>(reg[wordCount-1]);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div><div class="line"><a name="l00208"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a86f4e8502eacf95345d18a6240a217b2"> 208</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_polynomial_mod2.html#a86f4e8502eacf95345d18a6240a217b2">PolynomialMod2::BitCount</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="keyword"></span>{</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordtype">unsigned</span> wordCount = <a class="code" href="class_polynomial_mod2.html#a88292d16af59aaed460503b6339145b3">WordCount</a>();</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (wordCount)</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">return</span> (wordCount-1)*WORD_BITS + <a class="code" href="misc_8h.html#a3c5964768bc94670ad2bc3f218d9367f">BitPrecision</a>(reg[wordCount-1]);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> }</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#ac2821c87852466235b4e1a2f4cc01334"> 217</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_polynomial_mod2.html#ac2821c87852466235b4e1a2f4cc01334">PolynomialMod2::Parity</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="keyword"></span>{</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordtype">unsigned</span> i;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  word temp=0;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">for</span> (i=0; i<reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(); i++)</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  temp ^= reg[i];</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">return</span> <a class="code" href="misc_8h.html#a6c63a5683602db0ff8975746a414797f">CryptoPP::Parity</a>(temp);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> }</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>& PolynomialMod2::operator=(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>& t)</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  reg.<a class="code" href="class_sec_block.html#aaf38f976508a632e2f74aa4f2622da86">Assign</a>(t.reg);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>& PolynomialMod2::operator^=(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>& t)</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  reg.<a class="code" href="class_sec_block.html#a4ef9516e973051e6afa38bba526da3e9">CleanGrow</a>(t.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  XorWords(reg, t.reg, t.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> PolynomialMod2::Xor(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &b)<span class="keyword"> const</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="keyword"></span>{</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span> (b.reg.size() >= reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>())</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  {</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> result((word)0, b.reg.size()*WORD_BITS);</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  XorWords(result.reg, reg, b.reg, reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  CopyWords(result.reg+reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(), b.reg+reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(), b.reg.size()-reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">else</span></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>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> result((word)0, reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()*WORD_BITS);</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  XorWords(result.reg, reg, b.reg, b.reg.size());</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  CopyWords(result.reg+b.reg.size(), reg+b.reg.size(), reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()-b.reg.size());</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">return</span> result;</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> }</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> PolynomialMod2::And(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &b)<span class="keyword"> const</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="keyword"></span>{</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> result((word)0, WORD_BITS*<a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(), b.reg.size()));</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  AndWords(result.reg, reg, b.reg, result.reg.size());</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> </div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> PolynomialMod2::Times(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &b)<span class="keyword"> const</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="keyword"></span>{</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> result((word)0, <a class="code" href="class_polynomial_mod2.html#a86f4e8502eacf95345d18a6240a217b2">BitCount</a>() + b.BitCount());</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> </div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=b.Degree(); i>=0; i--)</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  {</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  result <<= 1;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">if</span> (b[i])</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  XorWords(result.reg, reg, reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> }</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> PolynomialMod2::Squared()<span class="keyword"> const</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="keyword"></span>{</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">static</span> <span class="keyword">const</span> word map[16] = {0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, 85};</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> result((word)0, 2*reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()*WORD_BITS);</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=0; i<reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(); i++)</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordtype">unsigned</span> j;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">for</span> (j=0; j<WORD_BITS; j+=8)</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  result.reg[2*i] |= map[(reg[i] >> (j/2)) % 16] << j;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> </div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">for</span> (j=0; j<WORD_BITS; j+=8)</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  result.reg[2*i+1] |= map[(reg[i] >> (j/2 + WORD_BITS/2)) % 16] << j;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> </div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> }</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div><div class="line"><a name="l00297"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a73d92da2ee829619041eca82567b87bc"> 297</a></span> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#a73d92da2ee829619041eca82567b87bc">PolynomialMod2::Divide</a>(<a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &remainder, <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &quotient,</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &dividend, <span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &divisor)</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> {</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">if</span> (!divisor)</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">throw</span> <a class="code" href="class_polynomial_mod2_1_1_divide_by_zero.html">PolynomialMod2::DivideByZero</a>();</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordtype">int</span> degree = divisor.<a class="code" href="class_polynomial_mod2.html#a2d0e58a23b81b33ab3ccf9b7aa498603">Degree</a>();</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  remainder.reg.<a class="code" href="class_sec_block.html#a2d78e75002fd02e5b89bd72a9e65e769">CleanNew</a>(<a class="code" href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a>(degree+1));</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">if</span> (dividend.<a class="code" href="class_polynomial_mod2.html#a86f4e8502eacf95345d18a6240a217b2">BitCount</a>() >= divisor.<a class="code" href="class_polynomial_mod2.html#a86f4e8502eacf95345d18a6240a217b2">BitCount</a>())</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  quotient.reg.<a class="code" href="class_sec_block.html#a2d78e75002fd02e5b89bd72a9e65e769">CleanNew</a>(<a class="code" href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a>(dividend.<a class="code" href="class_polynomial_mod2.html#a86f4e8502eacf95345d18a6240a217b2">BitCount</a>() - divisor.<a class="code" href="class_polynomial_mod2.html#a86f4e8502eacf95345d18a6240a217b2">BitCount</a>() + 1));</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  quotient.reg.<a class="code" href="class_sec_block.html#a2d78e75002fd02e5b89bd72a9e65e769">CleanNew</a>(0);</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=dividend.<a class="code" href="class_polynomial_mod2.html#a2d0e58a23b81b33ab3ccf9b7aa498603">Degree</a>(); i>=0; i--)</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  {</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  remainder <<= 1;</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  remainder.reg[0] |= dividend[i];</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">if</span> (remainder[degree])</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  {</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  remainder -= divisor;</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  quotient.SetBit(i);</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  }</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> PolynomialMod2::DividedBy(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &b)<span class="keyword"> const</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="keyword"></span>{</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> remainder, quotient;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <a class="code" href="class_polynomial_mod2.html#a73d92da2ee829619041eca82567b87bc">PolynomialMod2::Divide</a>(remainder, quotient, *<span class="keyword">this</span>, b);</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">return</span> quotient;</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> }</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> </div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> PolynomialMod2::Modulo(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &b)<span class="keyword"> const</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="keyword"></span>{</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> remainder, quotient;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <a class="code" href="class_polynomial_mod2.html#a73d92da2ee829619041eca82567b87bc">PolynomialMod2::Divide</a>(remainder, quotient, *<span class="keyword">this</span>, b);</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">return</span> remainder;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> }</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>& PolynomialMod2::operator<<=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n)</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> {</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="preprocessor">#if defined(CRYPTOPP_DEBUG)</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordtype">int</span> x; CRYPTOPP_UNUSED(x);</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(<a class="code" href="misc_8h.html#a8a2ce94589bb74164d809f4675bd23dd">SafeConvert</a>(n,x));</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">if</span> (!reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>())</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  word u;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  word carry=0;</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  word *r=reg;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> </div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">if</span> (n==1) <span class="comment">// special case code for most frequent case</span></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>  i = (int)reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>();</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">while</span> (i--)</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>  u = *r;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  *r = (u << 1) | carry;</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  carry = u >> (WORD_BITS-1);</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  r++;</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</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="keywordflow">if</span> (carry)</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  {</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  reg.<a class="code" href="class_sec_block.html#a8dea287fba8236b0979b52beece0ec1b">Grow</a>(reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()+1);</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  reg[reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()-1] = carry;</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> </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  }</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> shiftWords = n / WORD_BITS;</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> shiftBits = n % WORD_BITS;</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="keywordflow">if</span> (shiftBits)</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  {</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  i = (int)reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>();</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">while</span> (i--)</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>  u = *r;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  *r = (u << shiftBits) | carry;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  carry = u >> (WORD_BITS-shiftBits);</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  r++;</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  }</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> </div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">if</span> (carry)</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">// Thanks to Apatryda, http://github.com/weidai11/cryptopp/issues/64</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> carryIndex = reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>();</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  reg.<a class="code" href="class_sec_block.html#a8dea287fba8236b0979b52beece0ec1b">Grow</a>(reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()+shiftWords+!!shiftBits);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  reg[carryIndex] = carry;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  reg.<a class="code" href="class_sec_block.html#a8dea287fba8236b0979b52beece0ec1b">Grow</a>(reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()+shiftWords);</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">if</span> (shiftWords)</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  {</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">for</span> (i = (<span class="keywordtype">int</span>)reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()-1; i>=shiftWords; i--)</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  reg[i] = reg[i-shiftWords];</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">for</span> (; i>=0; i--)</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  reg[i] = 0;</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> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> }</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> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>& PolynomialMod2::operator>>=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n)</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">if</span> (!reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>())</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> </div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordtype">int</span> shiftWords = n / WORD_BITS;</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordtype">int</span> shiftBits = n % WORD_BITS;</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> </div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordtype">size_t</span> i;</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  word u;</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  word carry=0;</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  word *r=reg+reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()-1;</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">if</span> (shiftBits)</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  {</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  i = reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>();</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">while</span> (i--)</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  u = *r;</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  *r = (u >> shiftBits) | carry;</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  carry = u << (WORD_BITS-shiftBits);</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  r--;</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>  }</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">if</span> (shiftWords)</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="keywordflow">for</span> (i=0; i<reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()-shiftWords; i++)</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  reg[i] = reg[i+shiftWords];</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">for</span> (; i<reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(); i++)</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  reg[i] = 0;</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  }</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> </div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> }</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> </div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> PolynomialMod2::operator<<(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n)<span class="keyword"> const</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="keyword"></span>{</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> result(*<span class="keyword">this</span>);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">return</span> result<<=n;</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> </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> PolynomialMod2::operator>>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n)<span class="keyword"> const</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="keyword"></span>{</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> result(*<span class="keyword">this</span>);</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">return</span> result>>=n;</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> }</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> </div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="keywordtype">bool</span> PolynomialMod2::operator!()<span class="keyword"> const</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="keyword"></span>{</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=0; i<reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(); i++)</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">if</span> (reg[i]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="keywordtype">bool</span> PolynomialMod2::Equals(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &rhs)<span class="keyword"> const</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="keyword"></span>{</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordtype">size_t</span> i, smallerSize = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(), rhs.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">for</span> (i=0; i<smallerSize; i++)</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">if</span> (reg[i] != rhs.reg[i]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> </div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">for</span> (i=smallerSize; i<reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(); i++)</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">if</span> (reg[i] != 0) <span class="keywordflow">return</span> <span class="keyword">false</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>  <span class="keywordflow">for</span> (i=smallerSize; i<rhs.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>(); i++)</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">if</span> (rhs.reg[i] != 0) <span class="keywordflow">return</span> <span class="keyword">false</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>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> }</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> std::ostream& operator<<(std::ostream& out, <span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &a)</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>  <span class="comment">// Get relevant conversion specifications from ostream.</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordtype">long</span> f = out.flags() & std::ios::basefield; <span class="comment">// Get base digits.</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordtype">int</span> bits, block;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordtype">char</span> suffix;</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordflow">switch</span>(f)</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  {</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordflow">case</span> std::ios::oct :</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  bits = 3;</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  block = 4;</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  suffix = <span class="charliteral">'o'</span>;</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">case</span> std::ios::hex :</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  bits = 4;</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  block = 2;</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  suffix = <span class="charliteral">'h'</span>;</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  default :</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  bits = 1;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  block = 8;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  suffix = <span class="charliteral">'b'</span>;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  }</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> </div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (!a)</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">return</span> out << <span class="charliteral">'0'</span> << suffix;</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> </div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <a class="code" href="class_sec_block.html">SecBlock<char></a> s(a.BitCount()/bits+1);</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordtype">unsigned</span> i;</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> </div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">char</span> upper[]=<span class="stringliteral">"0123456789ABCDEF"</span>;</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">char</span> lower[]=<span class="stringliteral">"0123456789abcdef"</span>;</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> vec = (out.flags() & std::ios::uppercase) ? upper : lower;</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span> </div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">for</span> (i=0; i*bits < a.BitCount(); i++)</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordtype">int</span> digit=0;</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j=0; j<bits; j++)</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  digit |= a[i*bits+j] << j;</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  s[i]=vec[digit];</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> </div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">while</span> (i--)</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  {</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  out << s[i];</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (i && (i%block)==0)</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  out << <span class="charliteral">','</span>;</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> </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">return</span> out << suffix;</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> }</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> </div><div class="line"><a name="l00530"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a3940dec2ab787489ad4ce67013fe4611"> 530</a></span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> <a class="code" href="class_polynomial_mod2.html#a3940dec2ab787489ad4ce67013fe4611">PolynomialMod2::Gcd</a>(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &a, <span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &b)</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> {</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">return</span> <a class="code" href="class_euclidean_domain_of.html">EuclideanDomainOf<PolynomialMod2></a>().<a class="code" href="class_abstract_euclidean_domain.html#a2044146d4eb49414e1f4f880a9858161">Gcd</a>(a, b);</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> }</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> </div><div class="line"><a name="l00535"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a9daebc240dd1edd2e1abb5b05e2e3818"> 535</a></span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> <a class="code" href="class_polynomial_mod2.html#a9daebc240dd1edd2e1abb5b05e2e3818">PolynomialMod2::InverseMod</a>(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &modulus)<span class="keyword"> const</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="keyword"></span>{</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keyword">typedef</span> <a class="code" href="class_euclidean_domain_of.html">EuclideanDomainOf<PolynomialMod2></a> Domain;</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">return</span> <a class="code" href="class_quotient_ring.html">QuotientRing<Domain></a>(Domain(), modulus).<a class="code" href="class_quotient_ring.html#ac78f2284a7bdd06c39fd849ea7d23d48">MultiplicativeInverse</a>(*<span class="keyword">this</span>);</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> </div><div class="line"><a name="l00541"></a><span class="lineno"><a class="line" href="class_polynomial_mod2.html#a3ea60cfae9134470da9b8f7c37122acb"> 541</a></span> <span class="keywordtype">bool</span> <a class="code" href="class_polynomial_mod2.html#a3ea60cfae9134470da9b8f7c37122acb">PolynomialMod2::IsIrreducible</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="keyword"></span>{</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordtype">signed</span> <span class="keywordtype">int</span> d = <a class="code" href="class_polynomial_mod2.html#a2d0e58a23b81b33ab3ccf9b7aa498603">Degree</a>();</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">if</span> (d <= 0)</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> t(2), u(t);</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=1; i<=d/2; i++)</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>  u = u.Squared()%(*this);</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordflow">if</span> (!<a class="code" href="class_polynomial_mod2.html#a3940dec2ab787489ad4ce67013fe4611">Gcd</a>(u+t, *<span class="keyword">this</span>).<a class="code" href="class_polynomial_mod2.html#a4cdb6f0136198255766326388ddd4d42">IsUnit</a>())</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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="comment">// ********************************************************</span></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> GF2NP::GF2NP(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a> &modulus)</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  : <a class="code" href="class_quotient_ring.html">QuotientRing</a><<a class="code" href="class_euclidean_domain_of.html">EuclideanDomainOf</a><<a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>> >(<a class="code" href="class_euclidean_domain_of.html">EuclideanDomainOf</a><<a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>>(), modulus), m(modulus.Degree())</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> {</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> GF2NP::Element GF2NP::SquareRoot(<span class="keyword">const</span> Element &a)<span class="keyword"> const</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="keyword"></span>{</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  Element r = a;</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=1; i<m; i++)</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  r = <a class="code" href="class_quotient_ring.html#a4cf651be2789bdd9d9db9b156ebd1d33">Square</a>(r);</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">return</span> r;</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> </div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> GF2NP::Element GF2NP::HalfTrace(<span class="keyword">const</span> Element &a)<span class="keyword"> const</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="keyword"></span>{</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(m%2 == 1);</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  Element h = a;</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=1; i<=(m-1)/2; i++)</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  h = <a class="code" href="class_quotient_ring.html#ae373c31fe91c497e9eabd2c33b70ed98">Add</a>(<a class="code" href="class_quotient_ring.html#a4cf651be2789bdd9d9db9b156ebd1d33">Square</a>(<a class="code" href="class_quotient_ring.html#a4cf651be2789bdd9d9db9b156ebd1d33">Square</a>(h)), a);</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">return</span> h;</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> </div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> GF2NP::Element GF2NP::SolveQuadraticEquation(<span class="keyword">const</span> Element &a)<span class="keyword"> const</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="keyword"></span>{</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">if</span> (m%2 == 0)</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>  Element z, w;</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <a class="code" href="class_random_pool.html">RandomPool</a> rng;</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">do</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  Element p((<a class="code" href="class_random_number_generator.html">RandomNumberGenerator</a> &)rng, m);</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  z = <a class="code" href="class_polynomial_mod2.html#a11c7e95fb64a071952df785bb4036437">PolynomialMod2::Zero</a>();</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  w = p;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=1; i<=m-1; i++)</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>  w = <a class="code" href="class_quotient_ring.html#a4cf651be2789bdd9d9db9b156ebd1d33">Square</a>(w);</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  z = <a class="code" href="class_quotient_ring.html#a4cf651be2789bdd9d9db9b156ebd1d33">Square</a>(z);</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <a class="code" href="class_quotient_ring.html#a6bc3a34f0a3f04741005d6d5722b480b">Accumulate</a>(z, <a class="code" href="class_quotient_ring.html#ae4dc3dd42c8bc2bd37eff95e8a001f1a">Multiply</a>(w, a));</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <a class="code" href="class_quotient_ring.html#a6bc3a34f0a3f04741005d6d5722b480b">Accumulate</a>(w, p);</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  } <span class="keywordflow">while</span> (w.IsZero());</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keywordflow">return</span> z;</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="keywordflow">else</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">return</span> HalfTrace(a);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> }</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> </div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment">// ********************************************************</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> </div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> GF2NT::GF2NT(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> c0, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> c1, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> c2)</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  : <a class="code" href="class_g_f2_n_p.html">GF2NP</a>(<a class="code" href="class_polynomial_mod2.html">PolynomialMod2</a>::Trinomial(c0, c1, c2))</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  , t0(c0), t1(c1)</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  , result((word)0, m)</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span> {</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(c0 > c1 && c1 > c2 && c2==0);</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> }</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> </div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="keyword">const</span> GF2NT::Element& GF2NT::MultiplicativeInverse(<span class="keyword">const</span> Element &a)<span class="keyword"> const</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="keyword"></span>{</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">if</span> (t0-t1 < WORD_BITS)</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordflow">return</span> <a class="code" href="class_quotient_ring.html#ac78f2284a7bdd06c39fd849ea7d23d48">GF2NP::MultiplicativeInverse</a>(a);</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> </div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <a class="code" href="class_sec_word_block.html">SecWordBlock</a> T(m_modulus.reg.size() * 4);</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  word *b = T;</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  word *c = T+m_modulus.reg.size();</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  word *f = T+2*m_modulus.reg.size();</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  word *g = T+3*m_modulus.reg.size();</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordtype">size_t</span> bcLen=1, fgLen=m_modulus.reg.size();</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> k=0;</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span> </div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  SetWords(T, 0, 3*m_modulus.reg.size());</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  b[0]=1;</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(a.reg.size() <= m_modulus.reg.size());</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  CopyWords(f, a.reg, a.reg.size());</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  CopyWords(g, m_modulus.reg, m_modulus.reg.size());</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="keywordflow">while</span> (1)</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  {</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  word t=f[0];</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keywordflow">while</span> (!t)</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  {</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  ShiftWordsRightByWords(f, fgLen, 1);</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">if</span> (c[bcLen-1])</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  bcLen++;</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(bcLen <= m_modulus.reg.size());</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  ShiftWordsLeftByWords(c, bcLen, 1);</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  k+=WORD_BITS;</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  t=f[0];</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  }</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>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">while</span> (t%2 == 0)</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>  t>>=1;</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  i++;</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  }</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  k+=i;</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="keywordflow">if</span> (t==1 && CountWords(f, fgLen)==1)</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> </div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">if</span> (i==1)</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  {</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  ShiftWordsRightByBits(f, fgLen, 1);</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  t=ShiftWordsLeftByBits(c, bcLen, 1);</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  {</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  ShiftWordsRightByBits(f, fgLen, i);</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  t=ShiftWordsLeftByBits(c, bcLen, i);</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  }</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">if</span> (t)</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>  c[bcLen] = t;</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  bcLen++;</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(bcLen <= m_modulus.reg.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> </div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keywordflow">if</span> (f[fgLen-1]==0 && g[fgLen-1]==0)</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  fgLen--;</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> </div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">if</span> (f[fgLen-1] < g[fgLen-1])</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  {</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  std::swap(f, g);</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  std::swap(b, c);</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  }</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>  XorWords(f, g, fgLen);</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  XorWords(b, c, bcLen);</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</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>  <span class="keywordflow">while</span> (k >= WORD_BITS)</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  {</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  word temp = b[0];</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// right shift b</span></div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i=0; i+1<<a class="code" href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a>(m); i++)</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  b[i] = b[i+1];</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  b[<a class="code" href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a>(m)-1] = 0;</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="keywordflow">if</span> (t1 < WORD_BITS)</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j=0; j<WORD_BITS-t1; j++)</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  {</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">// Coverity finding on shift amount of 'word x << (t1+j)'.</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">// temp ^= ((temp >> j) & 1) << (t1 + j);</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shift = t1 + j;</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(shift < WORD_BITS);</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  temp ^= (shift < WORD_BITS) ? (((temp >> j) & 1) << shift) : 0;</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  }</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  b[t1/WORD_BITS-1] ^= temp << t1%WORD_BITS;</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>  <span class="keywordflow">if</span> (t1 % WORD_BITS)</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  b[t1/WORD_BITS] ^= temp >> (WORD_BITS - t1%WORD_BITS);</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> </div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">if</span> (t0%WORD_BITS)</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  {</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  b[t0/WORD_BITS-1] ^= temp << t0%WORD_BITS;</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  b[t0/WORD_BITS] ^= temp >> (WORD_BITS - t0%WORD_BITS);</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="keywordflow">else</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  b[t0/WORD_BITS-1] ^= temp;</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  k -= WORD_BITS;</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  }</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> </div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keywordflow">if</span> (k)</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  {</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  word temp = b[0] << (WORD_BITS - k);</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  ShiftWordsRightByBits(b, <a class="code" href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a>(m), k);</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> </div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">if</span> (t1 < WORD_BITS)</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  {</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j=0; j<WORD_BITS-t1; j++)</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  {</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="comment">// Coverity finding on shift amount of 'word x << (t1+j)'.</span></div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="comment">// temp ^= ((temp >> j) & 1) << (t1 + j);</span></div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shift = t1 + j;</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(shift < WORD_BITS);</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  temp ^= (shift < WORD_BITS) ? (((temp >> j) & 1) << shift) : 0;</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  }</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>  <span class="keywordflow">else</span></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>  b[t1/WORD_BITS-1] ^= temp << t1%WORD_BITS;</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</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="keywordflow">if</span> (t1 % WORD_BITS)</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  b[t1/WORD_BITS] ^= temp >> (WORD_BITS - t1%WORD_BITS);</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> </div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordflow">if</span> (t0%WORD_BITS)</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  {</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  b[t0/WORD_BITS-1] ^= temp << t0%WORD_BITS;</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  b[t0/WORD_BITS] ^= temp >> (WORD_BITS - t0%WORD_BITS);</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  }</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  b[t0/WORD_BITS-1] ^= temp;</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> </div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  CopyWords(result.reg.<a class="code" href="class_sec_block.html#a11a05906688172579cd3520816799446">begin</a>(), b, result.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> }</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> </div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="keyword">const</span> GF2NT::Element& GF2NT::Multiply(<span class="keyword">const</span> Element &a, <span class="keyword">const</span> Element &b)<span class="keyword"> const</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="keyword"></span>{</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordtype">size_t</span> aSize = <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(a.reg.size(), result.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  Element r((word)0, m);</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> </div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=m-1; i>=0; i--)</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  {</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">if</span> (r[m-1])</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  {</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  ShiftWordsLeftByBits(r.reg.begin(), r.reg.size(), 1);</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  XorWords(r.reg.begin(), m_modulus.reg, r.reg.size());</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  ShiftWordsLeftByBits(r.reg.begin(), r.reg.size(), 1);</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> </div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordflow">if</span> (b[i])</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  XorWords(r.reg.begin(), a.reg, aSize);</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  }</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> </div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">if</span> (m%WORD_BITS)</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  r.reg.begin()[r.reg.size()-1] = (word)<a class="code" href="misc_8h.html#a616a7f0365c4947b0c8a44606c525a62">Crop</a>(r.reg[r.reg.size()-1], m%WORD_BITS);</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> </div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  CopyWords(result.reg.<a class="code" href="class_sec_block.html#a11a05906688172579cd3520816799446">begin</a>(), r.reg.begin(), result.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> }</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> </div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> <span class="keyword">const</span> GF2NT::Element& GF2NT::Reduced(<span class="keyword">const</span> Element &a)<span class="keyword"> const</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> <span class="keyword"></span>{</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">if</span> (t0-t1 < WORD_BITS)</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keywordflow">return</span> m_domain.Mod(a, m_modulus);</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <a class="code" href="class_sec_word_block.html">SecWordBlock</a> b(a.reg);</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> </div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordtype">size_t</span> i;</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordflow">for</span> (i=b.size()-1; i>=<a class="code" href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a>(t0); i--)</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  {</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  word temp = b[i];</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> </div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keywordflow">if</span> (t0%WORD_BITS)</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  {</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  b[i-t0/WORD_BITS] ^= temp >> t0%WORD_BITS;</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  b[i-t0/WORD_BITS-1] ^= temp << (WORD_BITS - t0%WORD_BITS);</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  }</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  b[i-t0/WORD_BITS] ^= temp;</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> </div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">if</span> ((t0-t1)%WORD_BITS)</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  {</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  b[i-(t0-t1)/WORD_BITS] ^= temp >> (t0-t1)%WORD_BITS;</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  b[i-(t0-t1)/WORD_BITS-1] ^= temp << (WORD_BITS - (t0-t1)%WORD_BITS);</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  }</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  b[i-(t0-t1)/WORD_BITS] ^= temp;</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  }</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> </div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keywordflow">if</span> (i==<a class="code" href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a>(t0)-1 && t0%WORD_BITS)</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  {</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  word mask = ((word)1<<(t0%WORD_BITS))-1;</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  word temp = b[i] & ~mask;</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  b[i] &= mask;</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> </div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  b[i-t0/WORD_BITS] ^= temp >> t0%WORD_BITS;</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> </div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keywordflow">if</span> ((t0-t1)%WORD_BITS)</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  {</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  b[i-(t0-t1)/WORD_BITS] ^= temp >> (t0-t1)%WORD_BITS;</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keywordflow">if</span> ((t0-t1)%WORD_BITS > t0%WORD_BITS)</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  b[i-(t0-t1)/WORD_BITS-1] ^= temp << (WORD_BITS - (t0-t1)%WORD_BITS);</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <a class="code" href="trap_8h.html#adf3b392588bc94cbeae9f415a78c7b95">CRYPTOPP_ASSERT</a>(temp << (WORD_BITS - (t0-t1)%WORD_BITS) == 0);</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  }</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  b[i-(t0-t1)/WORD_BITS] ^= temp;</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  }</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> </div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  SetWords(result.reg.<a class="code" href="class_sec_block.html#a11a05906688172579cd3520816799446">begin</a>(), 0, result.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>());</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  CopyWords(result.reg.<a class="code" href="class_sec_block.html#a11a05906688172579cd3520816799446">begin</a>(), b, <a class="code" href="misc_8h.html#abe412b0409249cb54899e97bc7d86424">STDMIN</a>(b.size(), result.reg.<a class="code" href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">size</a>()));</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> }</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> </div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span> <span class="keywordtype">void</span> GF2NP::DEREncodeElement(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &out, <span class="keyword">const</span> Element &a)<span class="keyword"> const</span></div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span> <span class="keyword"></span>{</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  a.DEREncodeAsOctetString(out, MaxElementByteLength());</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span> }</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span> </div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> <span class="keywordtype">void</span> GF2NP::BERDecodeElement(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &in, Element &a)<span class="keyword"> const</span></div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span> <span class="keyword"></span>{</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  a.BERDecodeAsOctetString(in, MaxElementByteLength());</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span> }</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span> </div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span> <span class="keywordtype">void</span> GF2NT::DEREncode(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &bt)<span class="keyword"> const</span></div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span> <span class="keyword"></span>{</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <a class="code" href="class_d_e_r_sequence_encoder.html">DERSequenceEncoder</a> seq(bt);</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  ASN1::characteristic_two_field().DEREncode(seq);</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <a class="code" href="class_d_e_r_sequence_encoder.html">DERSequenceEncoder</a> parameters(seq);</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <a class="code" href="asn_8h.html#a76dc2368298a5474c5843c0f79012c11">DEREncodeUnsigned</a>(parameters, m);</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  ASN1::tpBasis().DEREncode(parameters);</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <a class="code" href="asn_8h.html#a76dc2368298a5474c5843c0f79012c11">DEREncodeUnsigned</a>(parameters, t1);</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  parameters.MessageEnd();</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  seq.MessageEnd();</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span> }</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> </div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> <span class="keywordtype">void</span> GF2NPP::DEREncode(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &bt)<span class="keyword"> const</span></div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span> <span class="keyword"></span>{</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <a class="code" href="class_d_e_r_sequence_encoder.html">DERSequenceEncoder</a> seq(bt);</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  ASN1::characteristic_two_field().DEREncode(seq);</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <a class="code" href="class_d_e_r_sequence_encoder.html">DERSequenceEncoder</a> parameters(seq);</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <a class="code" href="asn_8h.html#a76dc2368298a5474c5843c0f79012c11">DEREncodeUnsigned</a>(parameters, m);</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  ASN1::ppBasis().DEREncode(parameters);</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <a class="code" href="class_d_e_r_sequence_encoder.html">DERSequenceEncoder</a> pentanomial(parameters);</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <a class="code" href="asn_8h.html#a76dc2368298a5474c5843c0f79012c11">DEREncodeUnsigned</a>(pentanomial, t3);</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <a class="code" href="asn_8h.html#a76dc2368298a5474c5843c0f79012c11">DEREncodeUnsigned</a>(pentanomial, t2);</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <a class="code" href="asn_8h.html#a76dc2368298a5474c5843c0f79012c11">DEREncodeUnsigned</a>(pentanomial, t1);</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  pentanomial.MessageEnd();</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  parameters.MessageEnd();</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  seq.MessageEnd();</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> }</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span> </div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span> <a class="code" href="class_g_f2_n_p.html">GF2NP</a> * BERDecodeGF2NP(<a class="code" href="class_buffered_transformation.html">BufferedTransformation</a> &bt)</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span> {</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <a class="code" href="classmember__ptr.html">member_ptr<GF2NP></a> result;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> </div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <a class="code" href="class_b_e_r_sequence_decoder.html">BERSequenceDecoder</a> seq(bt);</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keywordflow">if</span> (<a class="code" href="class_o_i_d.html">OID</a>(seq) != ASN1::characteristic_two_field())</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <a class="code" href="asn_8h.html#afaf6b517352dfdaa7cc68ccb8396cba5">BERDecodeError</a>();</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <a class="code" href="class_b_e_r_sequence_decoder.html">BERSequenceDecoder</a> parameters(seq);</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m;</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <a class="code" href="asn_8h.html#a12d760f7b90217d5870bf6e8b4bf8c92">BERDecodeUnsigned</a>(parameters, m);</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <a class="code" href="class_o_i_d.html">OID</a> oid(parameters);</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordflow">if</span> (oid == ASN1::tpBasis())</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  {</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t1;</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <a class="code" href="asn_8h.html#a12d760f7b90217d5870bf6e8b4bf8c92">BERDecodeUnsigned</a>(parameters, t1);</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  result.reset(<span class="keyword">new</span> <a class="code" href="class_g_f2_n_t.html">GF2NT</a>(m, t1, 0));</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  }</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (oid == ASN1::ppBasis())</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  {</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t1, t2, t3;</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <a class="code" href="class_b_e_r_sequence_decoder.html">BERSequenceDecoder</a> pentanomial(parameters);</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <a class="code" href="asn_8h.html#a12d760f7b90217d5870bf6e8b4bf8c92">BERDecodeUnsigned</a>(pentanomial, t3);</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <a class="code" href="asn_8h.html#a12d760f7b90217d5870bf6e8b4bf8c92">BERDecodeUnsigned</a>(pentanomial, t2);</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <a class="code" href="asn_8h.html#a12d760f7b90217d5870bf6e8b4bf8c92">BERDecodeUnsigned</a>(pentanomial, t1);</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  pentanomial.MessageEnd();</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  result.reset(<span class="keyword">new</span> <a class="code" href="class_g_f2_n_p_p.html">GF2NPP</a>(m, t3, t2, t1, 0));</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  }</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  {</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <a class="code" href="asn_8h.html#afaf6b517352dfdaa7cc68ccb8396cba5">BERDecodeError</a>();</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">return</span> NULLPTR;</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  }</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  parameters.MessageEnd();</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  seq.MessageEnd();</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span> </div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">return</span> result.release();</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span> }</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span> </div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span> NAMESPACE_END</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span> </div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="class_quotient_ring_html_a6bc3a34f0a3f04741005d6d5722b480b"><div class="ttname"><a href="class_quotient_ring.html#a6bc3a34f0a3f04741005d6d5722b480b">QuotientRing< EuclideanDomainOf< PolynomialMod2 > >::Accumulate</a></div><div class="ttdeci">Element & Accumulate(Element &a, const Element &b) const</div><div class="ttdef"><b>Definition:</b> <a href="algebra_8h_source.html#l00410">algebra.h:410</a></div></div>
<div class="ttc" id="class_quotient_ring_html_ae373c31fe91c497e9eabd2c33b70ed98"><div class="ttname"><a href="class_quotient_ring.html#ae373c31fe91c497e9eabd2c33b70ed98">QuotientRing< EuclideanDomainOf< PolynomialMod2 > >::Add</a></div><div class="ttdeci">const Element & Add(const Element &a, const Element &b) const</div><div class="ttdef"><b>Definition:</b> <a href="algebra_8h_source.html#l00407">algebra.h:407</a></div></div>
<div class="ttc" id="class_invalid_argument_html"><div class="ttname"><a href="class_invalid_argument.html">InvalidArgument</a></div><div class="ttdoc">An invalid argument was detected.</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l00199">cryptlib.h:199</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a11c7e95fb64a071952df785bb4036437"><div class="ttname"><a href="class_polynomial_mod2.html#a11c7e95fb64a071952df785bb4036437">PolynomialMod2::Zero</a></div><div class="ttdeci">static const PolynomialMod2 & Zero()</div><div class="ttdoc">The Zero polinomial.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00134">gf2n.cpp:134</a></div></div>
<div class="ttc" id="class_random_pool_html"><div class="ttname"><a href="class_random_pool.html">RandomPool</a></div><div class="ttdoc">Randomness Pool based on AES-256.</div><div class="ttdef"><b>Definition:</b> <a href="randpool_8h_source.html#l00041">randpool.h:41</a></div></div>
<div class="ttc" id="misc_8h_html_a8a2ce94589bb74164d809f4675bd23dd"><div class="ttname"><a href="misc_8h.html#a8a2ce94589bb74164d809f4675bd23dd">SafeConvert</a></div><div class="ttdeci">bool SafeConvert(T1 from, T2 &to)</div><div class="ttdoc">Tests whether a conversion from -> to is safe to perform.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00562">misc.h:562</a></div></div>
<div class="ttc" id="misc_8h_html"><div class="ttname"><a href="misc_8h.html">misc.h</a></div><div class="ttdoc">Utility functions for the Crypto++ library.</div></div>
<div class="ttc" id="class_polynomial_mod2_html_ac67d4fb61b199c101f5de08d3aa2e782"><div class="ttname"><a href="class_polynomial_mod2.html#ac67d4fb61b199c101f5de08d3aa2e782">PolynomialMod2::PolynomialMod2</a></div><div class="ttdeci">PolynomialMod2()</div><div class="ttdoc">Construct the zero polynomial.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00029">gf2n.cpp:29</a></div></div>
<div class="ttc" id="class_singleton_html"><div class="ttname"><a href="class_singleton.html">Singleton</a></div><div class="ttdoc">Restricts the instantiation of a class to one static object without locks.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00291">misc.h:291</a></div></div>
<div class="ttc" id="class_sec_block_html_a2d78e75002fd02e5b89bd72a9e65e769"><div class="ttname"><a href="class_sec_block.html#a2d78e75002fd02e5b89bd72a9e65e769">SecBlock::CleanNew</a></div><div class="ttdeci">void CleanNew(size_type newSize)</div><div class="ttdoc">Change size without preserving contents.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00744">secblock.h:744</a></div></div>
<div class="ttc" id="randpool_8h_html"><div class="ttname"><a href="randpool_8h.html">randpool.h</a></div><div class="ttdoc">Class file for Randomness Pool.</div></div>
<div class="ttc" id="asn_8h_html_a76dc2368298a5474c5843c0f79012c11"><div class="ttname"><a href="asn_8h.html#a76dc2368298a5474c5843c0f79012c11">DEREncodeUnsigned</a></div><div class="ttdeci">size_t DEREncodeUnsigned(BufferedTransformation &out, T w, byte asnTag=INTEGER)</div><div class="ttdoc">DER Encode unsigned value.</div><div class="ttdef"><b>Definition:</b> <a href="asn_8h_source.html#l00457">asn.h:457</a></div></div>
<div class="ttc" id="class_random_number_generator_html_a497145546d24e6d4abaf10b7e0f1ba17"><div class="ttname"><a href="class_random_number_generator.html#a497145546d24e6d4abaf10b7e0f1ba17">RandomNumberGenerator::GenerateBlock</a></div><div class="ttdeci">virtual 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="cryptlib_8cpp_source.html#l00317">cryptlib.cpp:317</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a4cdb6f0136198255766326388ddd4d42"><div class="ttname"><a href="class_polynomial_mod2.html#a4cdb6f0136198255766326388ddd4d42">PolynomialMod2::IsUnit</a></div><div class="ttdeci">bool IsUnit() const</div><div class="ttdoc">only 1 is a unit</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8h_source.html#l00228">gf2n.h:228</a></div></div>
<div class="ttc" id="class_g_f2_n_t_html"><div class="ttname"><a href="class_g_f2_n_t.html">GF2NT</a></div><div class="ttdoc">GF(2^n) with Trinomial Basis.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8h_source.html#l00331">gf2n.h:331</a></div></div>
<div class="ttc" id="misc_8h_html_a45c56601a8c94b6a37a21657929fe928"><div class="ttname"><a href="misc_8h.html#a45c56601a8c94b6a37a21657929fe928">BitsToWords</a></div><div class="ttdeci">size_t BitsToWords(size_t bitCount)</div><div class="ttdoc">Returns the number of words required for the specified number of bits.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00810">misc.h:810</a></div></div>
<div class="ttc" id="misc_8h_html_a3e22fbd4b8f95aa01bde93ea32e44e82"><div class="ttname"><a href="misc_8h.html#a3e22fbd4b8f95aa01bde93ea32e44e82">BytePrecision</a></div><div class="ttdeci">unsigned int BytePrecision(const T &value)</div><div class="ttdoc">Returns the number of 8-bit bytes or octets required for a value.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00671">misc.h:671</a></div></div>
<div class="ttc" id="class_sec_block_html_a4ef9516e973051e6afa38bba526da3e9"><div class="ttname"><a href="class_sec_block.html#a4ef9516e973051e6afa38bba526da3e9">SecBlock::CleanGrow</a></div><div class="ttdeci">void CleanGrow(size_type newSize)</div><div class="ttdoc">Change size and preserve contents.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00777">secblock.h:777</a></div></div>
<div class="ttc" id="class_sec_block_html"><div class="ttname"><a href="class_sec_block.html">SecBlock</a></div><div class="ttdoc">Secure memory block with allocator and cleanup.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00454">secblock.h:454</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_polynomial_mod2_html_a6d96db42fd089c139d6af6da6d6bc331"><div class="ttname"><a href="class_polynomial_mod2.html#a6d96db42fd089c139d6af6da6d6bc331">PolynomialMod2::One</a></div><div class="ttdeci">static const PolynomialMod2 & One()</div><div class="ttdoc">The One polinomial.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00139">gf2n.cpp:139</a></div></div>
<div class="ttc" id="asn_8h_html_a12d760f7b90217d5870bf6e8b4bf8c92"><div class="ttname"><a href="asn_8h.html#a12d760f7b90217d5870bf6e8b4bf8c92">BERDecodeUnsigned</a></div><div class="ttdeci">void BERDecodeUnsigned(BufferedTransformation &in, T &w, byte asnTag=INTEGER, T minValue=0, T maxValue=T(0xffffffff))</div><div class="ttdoc">BER Decode unsigned value.</div><div class="ttdef"><b>Definition:</b> <a href="asn_8h_source.html#l00493">asn.h:493</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a1f444d22084163c2b69b5ade313aef14"><div class="ttname"><a href="class_polynomial_mod2.html#a1f444d22084163c2b69b5ade313aef14">PolynomialMod2::Encode</a></div><div class="ttdeci">void Encode(byte *output, size_t outputLen) const</div><div class="ttdoc">encode in big-endian format</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00150">gf2n.cpp:150</a></div></div>
<div class="ttc" id="oids_8h_html"><div class="ttname"><a href="oids_8h.html">oids.h</a></div><div class="ttdoc">ASN.1 object identifiers for algorthms and schemes.</div></div>
<div class="ttc" id="smartptr_8h_html"><div class="ttname"><a href="smartptr_8h.html">smartptr.h</a></div><div class="ttdoc">Classes for automatic resource management.</div></div>
<div class="ttc" id="config_8h_html"><div class="ttname"><a href="config_8h.html">config.h</a></div><div class="ttdoc">Library configuration file.</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="misc_8h_html_a886cc7ce76578c6df939f564f676e71a"><div class="ttname"><a href="misc_8h.html#a886cc7ce76578c6df939f564f676e71a">BytesToWords</a></div><div class="ttdeci">size_t BytesToWords(size_t byteCount)</div><div class="ttdoc">Returns the number of words required for the specified number of bytes.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00800">misc.h:800</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a87949fb32436e1f2f96d7b813405c032"><div class="ttname"><a href="class_polynomial_mod2.html#a87949fb32436e1f2f96d7b813405c032">PolynomialMod2::Monomial</a></div><div class="ttdeci">static PolynomialMod2 Monomial(size_t i)</div><div class="ttdoc">Provides x^i.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00098">gf2n.cpp:98</a></div></div>
<div class="ttc" id="class_quotient_ring_html_a4cf651be2789bdd9d9db9b156ebd1d33"><div class="ttname"><a href="class_quotient_ring.html#a4cf651be2789bdd9d9db9b156ebd1d33">QuotientRing< EuclideanDomainOf< PolynomialMod2 > >::Square</a></div><div class="ttdeci">const Element & Square(const Element &a) const</div><div class="ttdef"><b>Definition:</b> <a href="algebra_8h_source.html#l00434">algebra.h:434</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="struct_new_polynomial_mod2_html"><div class="ttname"><a href="struct_new_polynomial_mod2.html">NewPolynomialMod2</a></div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00126">gf2n.cpp:126</a></div></div>
<div class="ttc" id="class_b_e_r_sequence_decoder_html"><div class="ttname"><a href="class_b_e_r_sequence_decoder.html">BERSequenceDecoder</a></div><div class="ttdoc">BER Sequence Decoder.</div><div class="ttdef"><b>Definition:</b> <a href="asn_8h_source.html#l00305">asn.h:305</a></div></div>
<div class="ttc" id="algebra_8h_html"><div class="ttname"><a href="algebra_8h.html">algebra.h</a></div><div class="ttdoc">Classes for performing mathematics over different fields.</div></div>
<div class="ttc" id="class_buffered_transformation_html"><div class="ttname"><a href="class_buffered_transformation.html">BufferedTransformation</a></div><div class="ttdoc">Interface for buffered transformations.</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l01545">cryptlib.h:1545</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a3ea60cfae9134470da9b8f7c37122acb"><div class="ttname"><a href="class_polynomial_mod2.html#a3ea60cfae9134470da9b8f7c37122acb">PolynomialMod2::IsIrreducible</a></div><div class="ttdeci">bool IsIrreducible() const</div><div class="ttdoc">check for irreducibility</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00541">gf2n.cpp:541</a></div></div>
<div class="ttc" id="class_quotient_ring_html"><div class="ttname"><a href="class_quotient_ring.html">QuotientRing</a></div><div class="ttdoc">Quotient ring.</div><div class="ttdef"><b>Definition:</b> <a href="algebra_8h_source.html#l00386">algebra.h:386</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a88292d16af59aaed460503b6339145b3"><div class="ttname"><a href="class_polynomial_mod2.html#a88292d16af59aaed460503b6339145b3">PolynomialMod2::WordCount</a></div><div class="ttdeci">unsigned int WordCount() const</div><div class="ttdoc">number of significant words = ceiling(ByteCount()/sizeof(word))</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00194">gf2n.cpp:194</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html"><div class="ttname"><a href="class_polynomial_mod2.html">PolynomialMod2</a></div><div class="ttdoc">Polynomial with Coefficients in GF(2)</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8h_source.html#l00026">gf2n.h:26</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a86f4e8502eacf95345d18a6240a217b2"><div class="ttname"><a href="class_polynomial_mod2.html#a86f4e8502eacf95345d18a6240a217b2">PolynomialMod2::BitCount</a></div><div class="ttdeci">unsigned int BitCount() const</div><div class="ttdoc">number of significant bits = Degree() + 1</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00208">gf2n.cpp:208</a></div></div>
<div class="ttc" id="classmember__ptr_html"><div class="ttname"><a href="classmember__ptr.html">member_ptr< GF2NP ></a></div></div>
<div class="ttc" id="class_polynomial_mod2_1_1_divide_by_zero_html"><div class="ttname"><a href="class_polynomial_mod2_1_1_divide_by_zero.html">PolynomialMod2::DivideByZero</a></div><div class="ttdoc">Excpetion thrown when divide by zero is encountered.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8h_source.html#l00032">gf2n.h:32</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a3940dec2ab787489ad4ce67013fe4611"><div class="ttname"><a href="class_polynomial_mod2.html#a3940dec2ab787489ad4ce67013fe4611">PolynomialMod2::Gcd</a></div><div class="ttdeci">static PolynomialMod2 Gcd(const PolynomialMod2 &a, const PolynomialMod2 &n)</div><div class="ttdoc">greatest common divisor</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00530">gf2n.cpp:530</a></div></div>
<div class="ttc" id="class_array_sink_html"><div class="ttname"><a href="class_array_sink.html">ArraySink</a></div><div class="ttdoc">Copy input to a memory buffer.</div><div class="ttdef"><b>Definition:</b> <a href="filters_8h_source.html#l01132">filters.h:1132</a></div></div>
<div class="ttc" id="class_buffered_transformation_html_ae70658b0d271f8e114ac6c3cc9774ede"><div class="ttname"><a href="class_buffered_transformation.html#ae70658b0d271f8e114ac6c3cc9774ede">BufferedTransformation::Put</a></div><div class="ttdeci">size_t Put(byte inByte, bool blocking=true)</div><div class="ttdoc">Input a byte for processing.</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8h_source.html#l01567">cryptlib.h:1567</a></div></div>
<div class="ttc" id="class_quotient_ring_html_ae4dc3dd42c8bc2bd37eff95e8a001f1a"><div class="ttname"><a href="class_quotient_ring.html#ae4dc3dd42c8bc2bd37eff95e8a001f1a">QuotientRing< EuclideanDomainOf< PolynomialMod2 > >::Multiply</a></div><div class="ttdeci">const Element & Multiply(const Element &a, const Element &b) const</div><div class="ttdef"><b>Definition:</b> <a href="algebra_8h_source.html#l00431">algebra.h:431</a></div></div>
<div class="ttc" id="misc_8h_html_a616a7f0365c4947b0c8a44606c525a62"><div class="ttname"><a href="misc_8h.html#a616a7f0365c4947b0c8a44606c525a62">Crop</a></div><div class="ttdeci">T Crop(T value, size_t bits)</div><div class="ttdoc">Truncates the value to the specified number of bits.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00778">misc.h:778</a></div></div>
<div class="ttc" id="class_sec_block_html_aaf38f976508a632e2f74aa4f2622da86"><div class="ttname"><a href="class_sec_block.html#aaf38f976508a632e2f74aa4f2622da86">SecBlock::Assign</a></div><div class="ttdeci">void Assign(const T *ptr, size_type len)</div><div class="ttdoc">Set contents and size from an array.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00605">secblock.h:605</a></div></div>
<div class="ttc" id="pch_8h_html"><div class="ttname"><a href="pch_8h.html">pch.h</a></div><div class="ttdoc">Precompiled header file.</div></div>
<div class="ttc" id="gf2n_8h_html"><div class="ttname"><a href="gf2n_8h.html">gf2n.h</a></div><div class="ttdoc">Classes and functions for schemes over GF(2^n)</div></div>
<div class="ttc" id="misc_8h_html_a6c63a5683602db0ff8975746a414797f"><div class="ttname"><a href="misc_8h.html#a6c63a5683602db0ff8975746a414797f">Parity</a></div><div class="ttdeci">unsigned int Parity(T value)</div><div class="ttdoc">Returns the parity of a value.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00659">misc.h:659</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="class_string_store_html"><div class="ttname"><a href="class_string_store.html">StringStore</a></div><div class="ttdoc">String-based implementation of Store interface.</div><div class="ttdef"><b>Definition:</b> <a href="filters_8h_source.html#l01191">filters.h:1191</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_polynomial_mod2_html_af15c7ead361d1f7ea23d5e4bd5535989"><div class="ttname"><a href="class_polynomial_mod2.html#af15c7ead361d1f7ea23d5e4bd5535989">PolynomialMod2::SetByte</a></div><div class="ttdeci">void SetByte(size_t n, byte value)</div><div class="ttdoc">set the n-th byte to value</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00091">gf2n.cpp:91</a></div></div>
<div class="ttc" id="asn_8h_html_afaf6b517352dfdaa7cc68ccb8396cba5"><div class="ttname"><a href="asn_8h.html#afaf6b517352dfdaa7cc68ccb8396cba5">BERDecodeError</a></div><div class="ttdeci">void BERDecodeError()</div><div class="ttdoc">Raises a BERDecodeErr.</div><div class="ttdef"><b>Definition:</b> <a href="asn_8h_source.html#l00069">asn.h:69</a></div></div>
<div class="ttc" id="class_abstract_euclidean_domain_html_a2044146d4eb49414e1f4f880a9858161"><div class="ttname"><a href="class_abstract_euclidean_domain.html#a2044146d4eb49414e1f4f880a9858161">AbstractEuclideanDomain::Gcd</a></div><div class="ttdeci">virtual const Element & Gcd(const Element &a, const Element &b) const</div><div class="ttdoc">Calculates the greatest common denominator in the ring.</div><div class="ttdef"><b>Definition:</b> <a href="algebra_8cpp_source.html#l00056">algebra.cpp:56</a></div></div>
<div class="ttc" id="asn_8h_html"><div class="ttname"><a href="asn_8h.html">asn.h</a></div><div class="ttdoc">Classes and functions for working with ANS.1 objects.</div></div>
<div class="ttc" id="class_sec_block_html_a11a05906688172579cd3520816799446"><div class="ttname"><a href="class_sec_block.html#a11a05906688172579cd3520816799446">SecBlock::begin</a></div><div class="ttdeci">iterator begin()</div><div class="ttdoc">Provides an iterator pointing to the first element in the memory block.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00536">secblock.h:536</a></div></div>
<div class="ttc" id="filters_8h_html"><div class="ttname"><a href="filters_8h.html">filters.h</a></div><div class="ttdoc">Implementation of BufferedTransformation's attachment interface.</div></div>
<div class="ttc" id="class_g_f2_n_p_p_html"><div class="ttname"><a href="class_g_f2_n_p_p.html">GF2NPP</a></div><div class="ttdoc">GF(2^n) with Pentanomial Basis.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8h_source.html#l00355">gf2n.h:355</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_abf3ecc0dafe04c57dacea983a9a6690e"><div class="ttname"><a href="class_polynomial_mod2.html#abf3ecc0dafe04c57dacea983a9a6690e">PolynomialMod2::AllOnes</a></div><div class="ttdeci">static PolynomialMod2 AllOnes(size_t n)</div><div class="ttdoc">Provides x^(n-1) + ...</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00060">gf2n.cpp:60</a></div></div>
<div class="ttc" id="class_d_e_r_sequence_encoder_html"><div class="ttname"><a href="class_d_e_r_sequence_encoder.html">DERSequenceEncoder</a></div><div class="ttdoc">DER Sequence Encoder.</div><div class="ttdef"><b>Definition:</b> <a href="asn_8h_source.html#l00315">asn.h:315</a></div></div>
<div class="ttc" id="class_buffered_transformation_html_a30b2076bce5fb29e992b6457485c67c2"><div class="ttname"><a href="class_buffered_transformation.html#a30b2076bce5fb29e992b6457485c67c2">BufferedTransformation::MaxRetrievable</a></div><div class="ttdeci">virtual lword MaxRetrievable() const</div><div class="ttdoc">Provides the number of bytes ready for retrieval.</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8cpp_source.html#l00510">cryptlib.cpp:510</a></div></div>
<div class="ttc" id="class_g_f2_n_p_html"><div class="ttname"><a href="class_g_f2_n_p.html">GF2NP</a></div><div class="ttdoc">GF(2^n) with Polynomial Basis.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8h_source.html#l00295">gf2n.h:295</a></div></div>
<div class="ttc" id="class_d_e_r_general_encoder_html"><div class="ttname"><a href="class_d_e_r_general_encoder.html">DERGeneralEncoder</a></div><div class="ttdoc">DER General Encoder.</div><div class="ttdef"><b>Definition:</b> <a href="asn_8h_source.html#l00287">asn.h:287</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a9daebc240dd1edd2e1abb5b05e2e3818"><div class="ttname"><a href="class_polynomial_mod2.html#a9daebc240dd1edd2e1abb5b05e2e3818">PolynomialMod2::InverseMod</a></div><div class="ttdeci">PolynomialMod2 InverseMod(const PolynomialMod2 &) const</div><div class="ttdoc">calculate multiplicative inverse of *this mod n</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00535">gf2n.cpp:535</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a1773769992c5487674bcb8a0688fd6f8"><div class="ttname"><a href="class_polynomial_mod2.html#a1773769992c5487674bcb8a0688fd6f8">PolynomialMod2::DEREncodeAsOctetString</a></div><div class="ttdeci">void DEREncodeAsOctetString(BufferedTransformation &bt, size_t length) const</div><div class="ttdoc">encode value as big-endian octet string</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00178">gf2n.cpp:178</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a73d92da2ee829619041eca82567b87bc"><div class="ttname"><a href="class_polynomial_mod2.html#a73d92da2ee829619041eca82567b87bc">PolynomialMod2::Divide</a></div><div class="ttdeci">static void Divide(PolynomialMod2 &r, PolynomialMod2 &q, const PolynomialMod2 &a, const PolynomialMod2 &d)</div><div class="ttdoc">calculate r and q such that (a == d*q + r) && (deg(r) < deg(d))</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00297">gf2n.cpp:297</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_ad22cb6a5fcb0a78646059cf0005d2f6b"><div class="ttname"><a href="class_polynomial_mod2.html#ad22cb6a5fcb0a78646059cf0005d2f6b">PolynomialMod2::ByteCount</a></div><div class="ttdeci">unsigned int ByteCount() const</div><div class="ttdoc">number of significant bytes = ceiling(BitCount()/8)</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00199">gf2n.cpp:199</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a7a24a5ec904f384e4285d133dbe07757"><div class="ttname"><a href="class_polynomial_mod2.html#a7a24a5ec904f384e4285d133dbe07757">PolynomialMod2::GetByte</a></div><div class="ttdeci">byte GetByte(size_t n) const</div><div class="ttdoc">return the n-th byte</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00083">gf2n.cpp:83</a></div></div>
<div class="ttc" id="class_euclidean_domain_of_html"><div class="ttname"><a href="class_euclidean_domain_of.html">EuclideanDomainOf< PolynomialMod2 ></a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a2d0e58a23b81b33ab3ccf9b7aa498603"><div class="ttname"><a href="class_polynomial_mod2.html#a2d0e58a23b81b33ab3ccf9b7aa498603">PolynomialMod2::Degree</a></div><div class="ttdeci">signed int Degree() const</div><div class="ttdoc">the zero polynomial will return a degree of -1</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8h_source.html#l00128">gf2n.h:128</a></div></div>
<div class="ttc" id="class_sec_block_html_a8dea287fba8236b0979b52beece0ec1b"><div class="ttname"><a href="class_sec_block.html#a8dea287fba8236b0979b52beece0ec1b">SecBlock::Grow</a></div><div class="ttdeci">void Grow(size_type newSize)</div><div class="ttdoc">Change size and preserve contents.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00759">secblock.h:759</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a69c7853e0d24f1056be18112ee4f5a8e"><div class="ttname"><a href="class_polynomial_mod2.html#a69c7853e0d24f1056be18112ee4f5a8e">PolynomialMod2::BERDecodeAsOctetString</a></div><div class="ttdeci">void BERDecodeAsOctetString(BufferedTransformation &bt, size_t length)</div><div class="ttdoc">decode value as big-endian octet string</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00185">gf2n.cpp:185</a></div></div>
<div class="ttc" id="class_buffered_transformation_html_a9e1ad913c8fe697d269f408a7d5928fc"><div class="ttname"><a href="class_buffered_transformation.html#a9e1ad913c8fe697d269f408a7d5928fc">BufferedTransformation::Get</a></div><div class="ttdeci">virtual size_t Get(byte &outByte)</div><div class="ttdoc">Retrieve a 8-bit byte.</div><div class="ttdef"><b>Definition:</b> <a href="cryptlib_8cpp_source.html#l00533">cryptlib.cpp:533</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_quotient_ring_html_ac78f2284a7bdd06c39fd849ea7d23d48"><div class="ttname"><a href="class_quotient_ring.html#ac78f2284a7bdd06c39fd849ea7d23d48">QuotientRing::MultiplicativeInverse</a></div><div class="ttdeci">const Element & MultiplicativeInverse(const Element &a) const</div><div class="ttdoc">Calculate the multiplicative inverse of an element in the group.</div><div class="ttdef"><b>Definition:</b> <a href="algebra_8cpp_source.html#l00070">algebra.cpp:70</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a6d843c32a41885cb33d0aec19e40dda6"><div class="ttname"><a href="class_polynomial_mod2.html#a6d843c32a41885cb33d0aec19e40dda6">PolynomialMod2::Trinomial</a></div><div class="ttdeci">static PolynomialMod2 Trinomial(size_t t0, size_t t1, size_t t2)</div><div class="ttdoc">Provides x^t0 + x^t1 + x^t2.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00105">gf2n.cpp:105</a></div></div>
<div class="ttc" id="class_b_e_r_general_decoder_html"><div class="ttname"><a href="class_b_e_r_general_decoder.html">BERGeneralDecoder</a></div><div class="ttdoc">BER General Decoder.</div><div class="ttdef"><b>Definition:</b> <a href="asn_8h_source.html#l00254">asn.h:254</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_ac2821c87852466235b4e1a2f4cc01334"><div class="ttname"><a href="class_polynomial_mod2.html#ac2821c87852466235b4e1a2f4cc01334">PolynomialMod2::Parity</a></div><div class="ttdeci">unsigned int Parity() const</div><div class="ttdoc">sum modulo 2 of all coefficients</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00217">gf2n.cpp:217</a></div></div>
<div class="ttc" id="class_polynomial_mod2_html_a507094d47020af3d23a9fd68cc4b527d"><div class="ttname"><a href="class_polynomial_mod2.html#a507094d47020af3d23a9fd68cc4b527d">PolynomialMod2::Pentanomial</a></div><div class="ttdeci">static PolynomialMod2 Pentanomial(size_t t0, size_t t1, size_t t2, size_t t3, size_t t4)</div><div class="ttdoc">Provides x^t0 + x^t1 + x^t2 + x^t3 + x^t4.</div><div class="ttdef"><b>Definition:</b> <a href="gf2n_8cpp_source.html#l00114">gf2n.cpp:114</a></div></div>
<div class="ttc" id="class_o_i_d_html"><div class="ttname"><a href="class_o_i_d.html">OID</a></div><div class="ttdoc">Object Identifier.</div><div class="ttdef"><b>Definition:</b> <a href="asn_8h_source.html#l00166">asn.h:166</a></div></div>
<div class="ttc" id="class_sec_word_block_html"><div class="ttname"><a href="class_sec_word_block.html">SecWordBlock</a></div><div class="ttdoc">SecBlock<word> typedef.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00824">secblock.h:824</a></div></div>
<div class="ttc" id="misc_8h_html_a3c5964768bc94670ad2bc3f218d9367f"><div class="ttname"><a href="misc_8h.html#a3c5964768bc94670ad2bc3f218d9367f">BitPrecision</a></div><div class="ttdeci">unsigned int BitPrecision(const T &value)</div><div class="ttdoc">Returns the number of bits required for a value.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00694">misc.h:694</a></div></div>
<div class="ttc" id="class_singleton_html_a2dfafdfafaaf20ca4cfc550125f6332d"><div class="ttname"><a href="class_singleton.html#a2dfafdfafaaf20ca4cfc550125f6332d">Singleton::Ref</a></div><div class="ttdeci">const T & Ref(...) const</div><div class="ttdoc">Return a reference to the inner Singleton object.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00312">misc.h:312</a></div></div>
<div class="ttc" id="class_sec_block_html_af5999bffe3193e62719cc0792b0282a7"><div class="ttname"><a href="class_sec_block.html#af5999bffe3193e62719cc0792b0282a7">SecBlock::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdoc">Provides the count of elements in the SecBlock.</div><div class="ttdef"><b>Definition:</b> <a href="secblock_8h_source.html#l00561">secblock.h:561</a></div></div>
<div class="ttc" id="misc_8h_html_a3c75bb398badb69c7577b21486f9963f"><div class="ttname"><a href="misc_8h.html#a3c75bb398badb69c7577b21486f9963f">SIZE_MAX</a></div><div class="ttdeci">#define SIZE_MAX</div><div class="ttdoc">The maximum value of a machine word.</div><div class="ttdef"><b>Definition:</b> <a href="misc_8h_source.html#l00085">misc.h:85</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Nov 27 2019 15:03:33 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
>
2316
