📄 class_polynomial_mod2.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>Crypto++: PolynomialMod2 class Reference</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.3.2 --><div class="qindex"><a class="qindex" href="index.html">Main Page</a> | <a class="qindex" href="namespaces.html">Namespace List</a> | <a class="qindex" href="hierarchy.html">Class Hierarchy</a> | <a class="qindex" href="classes.html">Alphabetical List</a> | <a class="qindex" href="annotated.html">Compound List</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="namespacemembers.html">Namespace Members</a> | <a class="qindex" href="functions.html">Compound Members</a> | <a class="qindex" href="globals.html">File Members</a></div><h1>PolynomialMod2 Class Reference</h1><code>#include <<a class="el" href="gf2n_8h-source.html">gf2n.h</a>></code><p><a href="class_polynomial_mod2-members.html">List of all members.</a><hr><a name="_details"></a><h2>Detailed Description</h2>Polynomial with Coefficients in GF(2). <p><p><p>Definition at line <a class="el" href="gf2n_8h-source.html#l00017">17</a> of file <a class="el" href="gf2n_8h-source.html">gf2n.h</a>.<table border=0 cellpadding=0 cellspacing=0><tr><td></td></tr><tr><td colspan=2><br><h2>ENUMS, EXCEPTIONS, and TYPEDEFS</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z17_0" doxytag="PolynomialMod2::RandomizationParameter"></a>typedef unsigned int </td><td class="memItemRight" valign=bottom><b>RandomizationParameter</b></td></tr><tr><td colspan=2><br><h2>CREATORS</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_0" doxytag="PolynomialMod2::PolynomialMod2"></a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_0">PolynomialMod2</a> ()</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">creates the zero polynomial <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_1" doxytag="PolynomialMod2::PolynomialMod2"></a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_1">PolynomialMod2</a> (const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> &t)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">copy constructor <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_2">PolynomialMod2</a> (word value, unsigned int bitLength=WORD_BITS)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">convert from word </em> <a href="#_polynomial_mod2z19_2"></a><em><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_3" doxytag="PolynomialMod2::PolynomialMod2"></a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_3">PolynomialMod2</a> (const byte *encodedPoly, unsigned int byteCount)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">convert from big-endian byte array <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_4" doxytag="PolynomialMod2::PolynomialMod2"></a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_4">PolynomialMod2</a> (<a class="el" href="class_buffered_transformation.html">BufferedTransformation</a> &encodedPoly, unsigned int byteCount)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">convert from big-endian form stored in a <a class="el" href="class_buffered_transformation.html">BufferedTransformation</a> <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_5" doxytag="PolynomialMod2::PolynomialMod2"></a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_5">PolynomialMod2</a> (<a class="el" href="class_random_number_generator.html">RandomNumberGenerator</a> &rng, unsigned int bitcount)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">create a random polynomial uniformly distributed over all polynomials with degree less than bitcount <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_6" doxytag="PolynomialMod2::Monomial"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_6">Monomial</a> (unsigned i)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return x^i <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_7" doxytag="PolynomialMod2::Trinomial"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_7">Trinomial</a> (unsigned t0, unsigned t1, unsigned t2)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return x^t0 + x^t1 + x^t2 <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_8" doxytag="PolynomialMod2::Pentanomial"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_8">Pentanomial</a> (unsigned t0, unsigned t1, unsigned t2, unsigned int t3, unsigned int t4)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return x^t0 + x^t1 + x^t2 + x^t3 + x^t4 <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_9" doxytag="PolynomialMod2::AllOnes"></a><a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z19_9">AllOnes</a> (unsigned n)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return x^(n-1) + ... + x + 1 <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_10" doxytag="PolynomialMod2::Zero"></a>const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>Zero</b> ()</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z19_11" doxytag="PolynomialMod2::One"></a>const <a class="el" href="class_polynomial_mod2.html">PolynomialMod2</a> & </td><td class="memItemRight" valign=bottom><b>One</b> ()</td></tr><tr><td colspan=2><br><h2>ENCODE/DECODE</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>unsigned int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z21_0">MinEncodedSize</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">minimum number of bytes to encode this polynomial </em> <a href="#_polynomial_mod2z21_0"></a><em><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>unsigned int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z21_1">Encode</a> (byte *output, unsigned int outputLen) const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">encode in big-endian format </em> <a href="#_polynomial_mod2z21_1"></a><em><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z21_2" doxytag="PolynomialMod2::Encode"></a>unsigned int </td><td class="memItemRight" valign=bottom><b>Encode</b> (<a class="el" href="class_buffered_transformation.html">BufferedTransformation</a> &bt, unsigned int outputLen) const</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z21_3" doxytag="PolynomialMod2::Decode"></a>void </td><td class="memItemRight" valign=bottom><b>Decode</b> (const byte *input, unsigned int inputLen)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z21_4" doxytag="PolynomialMod2::Decode"></a>void </td><td class="memItemRight" valign=bottom><b>Decode</b> (<a class="el" href="class_buffered_transformation.html">BufferedTransformation</a> &bt, unsigned int inputLen)</td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z21_5" doxytag="PolynomialMod2::DEREncodeAsOctetString"></a>void </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z21_5">DEREncodeAsOctetString</a> (<a class="el" href="class_buffered_transformation.html">BufferedTransformation</a> &bt, unsigned int length) const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">encode value as big-endian octet string <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z21_6" doxytag="PolynomialMod2::BERDecodeAsOctetString"></a>void </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z21_6">BERDecodeAsOctetString</a> (<a class="el" href="class_buffered_transformation.html">BufferedTransformation</a> &bt, unsigned int length)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">decode value as big-endian octet string <br><br></td></tr><tr><td colspan=2><br><h2>ACCESSORS</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_0" doxytag="PolynomialMod2::BitCount"></a>unsigned int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_0">BitCount</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">number of significant bits = <a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_5">Degree()</a> + 1 <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_1" doxytag="PolynomialMod2::ByteCount"></a>unsigned int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_1">ByteCount</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">number of significant bytes = ceiling(<a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_0">BitCount()</a>/8) <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_2" doxytag="PolynomialMod2::WordCount"></a>unsigned int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_2">WordCount</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">number of significant words = ceiling(<a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_1">ByteCount()</a>/sizeof(word)) <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_3" doxytag="PolynomialMod2::GetBit"></a>bool </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_3">GetBit</a> (unsigned int n) const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return the n-th bit, n=0 being the least significant bit <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_4" doxytag="PolynomialMod2::GetByte"></a>byte </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_4">GetByte</a> (unsigned int n) const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return the n-th byte <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_5" doxytag="PolynomialMod2::Degree"></a>signed int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_5">Degree</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">the zero polynomial will return a degree of -1 <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_6" doxytag="PolynomialMod2::CoefficientCount"></a>unsigned int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_6">CoefficientCount</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">degree + 1 <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_7" doxytag="PolynomialMod2::GetCoefficient"></a>int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_7">GetCoefficient</a> (unsigned int i) const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return coefficient for x^i <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_8" doxytag="PolynomialMod2::operator[]"></a>int </td><td class="memItemRight" valign=bottom><a class="el" href="class_polynomial_mod2.html#_polynomial_mod2z23_8">operator[]</a> (unsigned int i) const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return coefficient for x^i <br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a name="_polynomial_mod2z23_9" doxytag="PolynomialMod2::IsZero"></a>bool </td><td class="memItemRight" valign=bottom><b>IsZero</b> () const</td></tr>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -