class_polynomial_mod2.html

著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">only 1 is a unit <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="1a79c76a8039c159d0e3cfba93ad8184"></a><!-- doxytag: member="PolynomialMod2::MultiplicativeInverse" ref="1a79c76a8039c159d0e3cfba93ad8184" args="() const" -->
<a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_polynomial_mod2.html#1a79c76a8039c159d0e3cfba93ad8184">MultiplicativeInverse</a> () const</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">return inverse if *this is a unit, otherwise return 0 <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e8005d38604e28556889ea89412fe33f"></a><!-- doxytag: member="PolynomialMod2::InverseMod" ref="e8005d38604e28556889ea89412fe33f" args="(const PolynomialMod2 &amp;) const " -->
<a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_polynomial_mod2.html#e8005d38604e28556889ea89412fe33f">InverseMod</a> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &amp;) const </td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">calculate multiplicative inverse of *this mod n <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="3940dec2ab787489ad4ce67013fe4611"></a><!-- doxytag: member="PolynomialMod2::Gcd" ref="3940dec2ab787489ad4ce67013fe4611" args="(const PolynomialMod2 &amp;a, const PolynomialMod2 &amp;n)" -->
static <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> __cdecl&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_polynomial_mod2.html#3940dec2ab787489ad4ce67013fe4611">Gcd</a> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &amp;a, const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &amp;n)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">greatest common divisor <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="73d92da2ee829619041eca82567b87bc"></a><!-- doxytag: member="PolynomialMod2::Divide" ref="73d92da2ee829619041eca82567b87bc" args="(PolynomialMod2 &amp;r, PolynomialMod2 &amp;q, const PolynomialMod2 &amp;a, const PolynomialMod2 &amp;d)" -->
static void __cdecl&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_polynomial_mod2.html#73d92da2ee829619041eca82567b87bc">Divide</a> (<a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &amp;r, <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &amp;q, const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &amp;a, const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &amp;d)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">calculate r and q such that (a == d*q + r) &amp;&amp; (deg(r) &lt; deg(d)) <br></td></tr>
<tr><td colspan="2"><br><h2>Friends</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="2e0505b1597d5b697c52bfc7420f4f73"></a><!-- doxytag: member="PolynomialMod2::GF2NT" ref="2e0505b1597d5b697c52bfc7420f4f73" args="" -->
class&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_polynomial_mod2.html#2e0505b1597d5b697c52bfc7420f4f73">GF2NT</a></td></tr>

<tr><td colspan="2"><br><h2>Classes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class &nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_polynomial_mod2_1_1_divide_by_zero.html">DivideByZero</a></td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">divide by zero exception  <a href="class_polynomial_mod2_1_1_divide_by_zero.html#_details">More...</a><br></td></tr>
</table>
<hr><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" name="51790dcfe87a449169e8cb5c0f20da7e"></a><!-- doxytag: member="PolynomialMod2::PolynomialMod2" ref="51790dcfe87a449169e8cb5c0f20da7e" args="(word value, size_t bitLength=WORD_BITS)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">PolynomialMod2::PolynomialMod2           </td>
          <td>(</td>
          <td class="paramtype">word&nbsp;</td>
          <td class="paramname"> <em>value</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">size_t&nbsp;</td>
          <td class="paramname"> <em>bitLength</em> = <code>WORD_BITS</code></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
convert from word 
<p>
value should be encoded with the least significant bit as coefficient to x^0 and most significant bit as coefficient to x^(WORD_BITS-1) bitLength denotes how much memory to allocate initially 
<p>
Definition at line <a class="el" href="gf2n_8cpp-source.html#l00022">22</a> of file <a class="el" href="gf2n_8cpp-source.html">gf2n.cpp</a>.
<p>
References <a class="el" href="secblock_8h-source.html#l00336">SecBlock&lt; T, A &gt;::size()</a>.
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="00c84f8cb2e7262de75e4c1e28760d43"></a><!-- doxytag: member="PolynomialMod2::MinEncodedSize" ref="00c84f8cb2e7262de75e4c1e28760d43" args="() const" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">unsigned int PolynomialMod2::MinEncodedSize           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const<code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
minimum number of bytes to encode this polynomial 
<p>
MinEncodedSize of 0 is 1 
<p>
Definition at line <a class="el" href="gf2n_8h-source.html#l00077">77</a> of file <a class="el" href="gf2n_8h-source.html">gf2n.h</a>.
</div>
</div><p>
<a class="anchor" name="1f444d22084163c2b69b5ade313aef14"></a><!-- doxytag: member="PolynomialMod2::Encode" ref="1f444d22084163c2b69b5ade313aef14" args="(byte *output, size_t outputLen) const" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void PolynomialMod2::Encode           </td>
          <td>(</td>
          <td class="paramtype">byte *&nbsp;</td>
          <td class="paramname"> <em>output</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">size_t&nbsp;</td>
          <td class="paramname"> <em>outputLen</em></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
encode in big-endian format 
<p>
if outputLen &lt; MinEncodedSize, the most significant bytes will be dropped if outputLen &gt; MinEncodedSize, the most significant bytes will be padded 
<p>
Definition at line <a class="el" href="gf2n_8cpp-source.html#l00139">139</a> of file <a class="el" href="gf2n_8cpp-source.html">gf2n.cpp</a>.
<p>
Referenced by <a class="el" href="gf2n_8cpp-source.html#l00163">DEREncodeAsOctetString()</a>, and <a class="el" href="ec2n_8cpp-source.html#l00095">EC2N::EncodePoint()</a>.
</div>
</div><p>
<hr>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="gf2n_8h-source.html">gf2n.h</a><li><a class="el" href="gf2n_8cpp-source.html">gf2n.cpp</a></ul>
<hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:45 2007 for Crypto++ by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.2 </small></address>
</body>
</html>