<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Crypto++: gf2n.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">Crypto++</div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<h1>gf2n.h</h1> </div>
</div>
<div class="contents">
<a href="gf2n_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#ifndef CRYPTOPP_GF2N_H</span>
<a name="l00002"></a>00002 <span class="preprocessor"></span><span class="preprocessor">#define CRYPTOPP_GF2N_H</span>
<a name="l00003"></a>00003 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00004"></a>00004 <span class="comment">/*! \file */</span>
<a name="l00005"></a>00005
<a name="l00006"></a>00006 <span class="preprocessor">#include "<a class="code" href="cryptlib_8h.html">cryptlib.h</a>"</span>
<a name="l00007"></a>00007 <span class="preprocessor">#include "secblock.h"</span>
<a name="l00008"></a>00008 <span class="preprocessor">#include "misc.h"</span>
<a name="l00009"></a>00009 <span class="preprocessor">#include "algebra.h"</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="preprocessor">#include <iosfwd></span>
<a name="l00012"></a>00012
<a name="l00013"></a>00013 NAMESPACE_BEGIN(CryptoPP)
<a name="l00014"></a>00014
<a name="l00015"></a>00015 <span class="comment">//! Polynomial with Coefficients in GF(2)</span>
<a name="l00016"></a>00016 <span class="comment"></span><span class="comment">/*! \nosubgrouping */</span>
<a name="l00017"></a><a class="code" href="class_polynomial_mod2.html">00017</a> class CRYPTOPP_DLL <a class="code" href="class_polynomial_mod2.html" title="Polynomial with Coefficients in GF(2)">PolynomialMod2</a>
<a name="l00018"></a>00018 {
<a name="l00019"></a>00019 <span class="keyword">public</span>:<span class="comment"></span>
<a name="l00020"></a>00020 <span class="comment"> //! \name ENUMS, EXCEPTIONS, and TYPEDEFS</span>
<a name="l00021"></a>00021 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00022"></a>00022 <span class="comment"></span><span class="comment"> //! divide by zero exception</span>
<a name="l00023"></a><a class="code" href="class_polynomial_mod2_1_1_divide_by_zero.html">00023</a> <span class="comment"></span> <span class="keyword">class </span><a class="code" href="class_polynomial_mod2_1_1_divide_by_zero.html" title="divide by zero exception">DivideByZero</a> : <span class="keyword">public</span> <a class="code" href="class_exception.html" title="base class for all exceptions thrown by Crypto++">Exception</a>
<a name="l00024"></a>00024 {
<a name="l00025"></a>00025 <span class="keyword">public</span>:
<a name="l00026"></a>00026 <a class="code" href="class_polynomial_mod2_1_1_divide_by_zero.html" title="divide by zero exception">DivideByZero</a>() : <a class="code" href="class_exception.html" title="base class for all exceptions thrown by Crypto++">Exception</a>(OTHER_ERROR, <span class="stringliteral">"PolynomialMod2: division by zero"</span>) {}
<a name="l00027"></a>00027 };
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> RandomizationParameter;<span class="comment"></span>
<a name="l00030"></a>00030 <span class="comment"> //@}</span>
<a name="l00031"></a>00031 <span class="comment"></span><span class="comment"></span>
<a name="l00032"></a>00032 <span class="comment"> //! \name CREATORS</span>
<a name="l00033"></a>00033 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00034"></a>00034 <span class="comment"></span><span class="comment"> //! creates the zero polynomial</span>
<a name="l00035"></a>00035 <span class="comment"></span> PolynomialMod2();<span class="comment"></span>
<a name="l00036"></a>00036 <span class="comment"> //! copy constructor</span>
<a name="l00037"></a>00037 <span class="comment"></span> PolynomialMod2(<span class="keyword">const</span> PolynomialMod2& t);
<a name="l00038"></a>00038 <span class="comment"></span>
<a name="l00039"></a>00039 <span class="comment"> //! convert from word</span>
<a name="l00040"></a>00040 <span class="comment"></span><span class="comment"> /*! value should be encoded with the least significant bit as coefficient to x^0</span>
<a name="l00041"></a>00041 <span class="comment"> and most significant bit as coefficient to x^(WORD_BITS-1)</span>
<a name="l00042"></a>00042 <span class="comment"> bitLength denotes how much memory to allocate initially</span>
<a name="l00043"></a>00043 <span class="comment"> */</span>
<a name="l00044"></a>00044 PolynomialMod2(word value, <span class="keywordtype">size_t</span> bitLength=WORD_BITS);
<a name="l00045"></a>00045 <span class="comment"></span>
<a name="l00046"></a>00046 <span class="comment"> //! convert from big-endian byte array</span>
<a name="l00047"></a><a class="code" href="class_polynomial_mod2.html#adc62dcb615c688c00c924775920c752d">00047</a> <span class="comment"></span> PolynomialMod2(<span class="keyword">const</span> byte *encodedPoly, <span class="keywordtype">size_t</span> byteCount)
<a name="l00048"></a>00048 {Decode(encodedPoly, byteCount);}
<a name="l00049"></a>00049 <span class="comment"></span>
<a name="l00050"></a>00050 <span class="comment"> //! convert from big-endian form stored in a BufferedTransformation</span>
<a name="l00051"></a><a class="code" href="class_polynomial_mod2.html#aba40ce289e5ffaa47542391ead80aa85">00051</a> <span class="comment"></span> PolynomialMod2(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &encodedPoly, <span class="keywordtype">size_t</span> byteCount)
<a name="l00052"></a>00052 {Decode(encodedPoly, byteCount);}
<a name="l00053"></a>00053 <span class="comment"></span>
<a name="l00054"></a>00054 <span class="comment"> //! create a random polynomial uniformly distributed over all polynomials with degree less than bitcount</span>
<a name="l00055"></a><a class="code" href="class_polynomial_mod2.html#a455d995dd1eee03b8412eacae4c61186">00055</a> <span class="comment"></span> PolynomialMod2(<a class="code" href="class_random_number_generator.html" title="interface for random number generators">RandomNumberGenerator</a> &rng, <span class="keywordtype">size_t</span> bitcount)
<a name="l00056"></a>00056 {Randomize(rng, bitcount);}
<a name="l00057"></a>00057 <span class="comment"></span>
<a name="l00058"></a>00058 <span class="comment"> //! return x^i</span>
<a name="l00059"></a>00059 <span class="comment"></span> <span class="keyword">static</span> PolynomialMod2 CRYPTOPP_API Monomial(<span class="keywordtype">size_t</span> i);<span class="comment"></span>
<a name="l00060"></a>00060 <span class="comment"> //! return x^t0 + x^t1 + x^t2</span>
<a name="l00061"></a>00061 <span class="comment"></span> <span class="keyword">static</span> PolynomialMod2 CRYPTOPP_API Trinomial(<span class="keywordtype">size_t</span> t0, <span class="keywordtype">size_t</span> t1, <span class="keywordtype">size_t</span> t2);<span class="comment"></span>
<a name="l00062"></a>00062 <span class="comment"> //! return x^t0 + x^t1 + x^t2 + x^t3 + x^t4</span>
<a name="l00063"></a>00063 <span class="comment"></span> <span class="keyword">static</span> PolynomialMod2 CRYPTOPP_API Pentanomial(<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);<span class="comment"></span>
<a name="l00064"></a>00064 <span class="comment"> //! return x^(n-1) + ... + x + 1</span>
<a name="l00065"></a>00065 <span class="comment"></span> <span class="keyword">static</span> PolynomialMod2 CRYPTOPP_API AllOnes(<span class="keywordtype">size_t</span> n);
<a name="l00066"></a>00066 <span class="comment"></span>
<a name="l00067"></a>00067 <span class="comment"> //!</span>
<a name="l00068"></a>00068 <span class="comment"></span> <span class="keyword">static</span> <span class="keyword">const</span> PolynomialMod2 & CRYPTOPP_API Zero();<span class="comment"></span>
<a name="l00069"></a>00069 <span class="comment"> //!</span>
<a name="l00070"></a>00070 <span class="comment"></span> <span class="keyword">static</span> <span class="keyword">const</span> PolynomialMod2 & CRYPTOPP_API One();<span class="comment"></span>
<a name="l00071"></a>00071 <span class="comment"> //@}</span>
<a name="l00072"></a>00072 <span class="comment"></span><span class="comment"></span>
<a name="l00073"></a>00073 <span class="comment"> //! \name ENCODE/DECODE</span>
<a name="l00074"></a>00074 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00075"></a>00075 <span class="comment"></span><span class="comment"> //! minimum number of bytes to encode this polynomial</span>
<a name="l00076"></a>00076 <span class="comment"></span><span class="comment"> /*! MinEncodedSize of 0 is 1 */</span>
<a name="l00077"></a><a class="code" href="class_polynomial_mod2.html#a9e71cfb010cde2d755cf59bcb213abda">00077</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_polynomial_mod2.html#a9e71cfb010cde2d755cf59bcb213abda" title="minimum number of bytes to encode this polynomial">MinEncodedSize</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> STDMAX(1U, ByteCount());}
<a name="l00078"></a>00078 <span class="comment"></span>
<a name="l00079"></a>00079 <span class="comment"> //! encode in big-endian format</span>
<a name="l00080"></a>00080 <span class="comment"></span><span class="comment"> /*! if outputLen < MinEncodedSize, the most significant bytes will be dropped</span>
<a name="l00081"></a>00081 <span class="comment"> if outputLen > MinEncodedSize, the most significant bytes will be padded</span>
<a name="l00082"></a>00082 <span class="comment"> */</span>
<a name="l00083"></a>00083 <span class="keywordtype">void</span> Encode(byte *output, <span class="keywordtype">size_t</span> outputLen) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00084"></a>00084 <span class="comment"> //!</span>
<a name="l00085"></a>00085 <span class="comment"></span> <span class="keywordtype">void</span> Encode(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &bt, <span class="keywordtype">size_t</span> outputLen) <span class="keyword">const</span>;
<a name="l00086"></a>00086 <span class="comment"></span>
<a name="l00087"></a>00087 <span class="comment"> //!</span>
<a name="l00088"></a>00088 <span class="comment"></span> <span class="keywordtype">void</span> Decode(<span class="keyword">const</span> byte *input, <span class="keywordtype">size_t</span> inputLen);<span class="comment"></span>
<a name="l00089"></a>00089 <span class="comment"> //! </span>
<a name="l00090"></a>00090 <span class="comment"></span> <span class="comment">//* Precondition: bt.MaxRetrievable() >= inputLen</span>
<a name="l00091"></a>00091 <span class="keywordtype">void</span> Decode(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &bt, <span class="keywordtype">size_t</span> inputLen);
<a name="l00092"></a>00092 <span class="comment"></span>
<a name="l00093"></a>00093 <span class="comment"> //! encode value as big-endian octet string</span>
<a name="l00094"></a>00094 <span class="comment"></span> <span class="keywordtype">void</span> DEREncodeAsOctetString(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &bt, <span class="keywordtype">size_t</span> length) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00095"></a>00095 <span class="comment"> //! decode value as big-endian octet string</span>
<a name="l00096"></a>00096 <span class="comment"></span> <span class="keywordtype">void</span> BERDecodeAsOctetString(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &bt, <span class="keywordtype">size_t</span> length);<span class="comment"></span>
<a name="l00097"></a>00097 <span class="comment"> //@}</span>
<a name="l00098"></a>00098 <span class="comment"></span><span class="comment"></span>
<a name="l00099"></a>00099 <span class="comment"> //! \name ACCESSORS</span>
<a name="l00100"></a>00100 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00101"></a>00101 <span class="comment"></span><span class="comment"> //! number of significant bits = Degree() + 1</span>
<a name="l00102"></a>00102 <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> BitCount() <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00103"></a>00103 <span class="comment"> //! number of significant bytes = ceiling(BitCount()/8)</span>
<a name="l00104"></a>00104 <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ByteCount() <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00105"></a>00105 <span class="comment"> //! number of significant words = ceiling(ByteCount()/sizeof(word))</span>
<a name="l00106"></a>00106 <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> WordCount() <span class="keyword">const</span>;
<a name="l00107"></a>00107 <span class="comment"></span>
<a name="l00108"></a>00108 <span class="comment"> //! return the n-th bit, n=0 being the least significant bit</span>
<a name="l00109"></a><a class="code" href="class_polynomial_mod2.html#a3b038b16ea02fb77cd3a122a2d0b58d7">00109</a> <span class="comment"></span> <span class="keywordtype">bool</span> <a class="code" href="class_polynomial_mod2.html#a3b038b16ea02fb77cd3a122a2d0b58d7" title="return the n-th bit, n=0 being the least significant bit">GetBit</a>(<span class="keywordtype">size_t</span> n)<span class="keyword"> const </span>{<span class="keywordflow">return</span> GetCoefficient(n)!=0;}<span class="comment"></span>
<a name="l00110"></a>00110 <span class="comment"> //! return the n-th byte</span>
<a name="l00111"></a>00111 <span class="comment"></span> byte GetByte(<span class="keywordtype">size_t</span> n) <span class="keyword">const</span>;
<a name="l00112"></a>00112 <span class="comment"></span>
<a name="l00113"></a>00113 <span class="comment"> //! the zero polynomial will return a degree of -1</span>
<a name="l00114"></a><a class="code" href="class_polynomial_mod2.html#ae274b547e478a6cc0065089b7b915e47">00114</a> <span class="comment"></span> <span class="keywordtype">signed</span> <span class="keywordtype">int</span> <a class="code" href="class_polynomial_mod2.html#ae274b547e478a6cc0065089b7b915e47" title="the zero polynomial will return a degree of -1">Degree</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> BitCount()-1;}<span class="comment"></span>
<a name="l00115"></a>00115 <span class="comment"> //! degree + 1</span>
<a name="l00116"></a><a class="code" href="class_polynomial_mod2.html#afecb67038bff52fc044bc755537fd643">00116</a> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="class_polynomial_mod2.html#afecb67038bff52fc044bc755537fd643" title="degree + 1">CoefficientCount</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> BitCount();}<span class="comment"></span>
<a name="l00117"></a>00117 <span class="comment"> //! return coefficient for x^i</span>
<a name="l00118"></a><a class="code" href="class_polynomial_mod2.html#af9c08444fe0f2eb5602e36fc992f9ac8">00118</a> <span class="comment"></span> <span class="keywordtype">int</span> GetCoefficient(<span class="keywordtype">size_t</span> i)<span class="keyword"> const</span>
<a name="l00119"></a>00119 <span class="keyword"> </span>{<span class="keywordflow">return</span> (i/WORD_BITS < reg.size()) ? <span class="keywordtype">int</span>(reg[i/WORD_BITS] >> (i % WORD_BITS)) & 1 : 0;}<span class="comment"></span>
<a name="l00120"></a>00120 <span class="comment"> //! return coefficient for x^i</span>
<a name="l00121"></a><a class="code" href="class_polynomial_mod2.html#abfbd3eee725068a94239e7581b43fe45">00121</a> <span class="comment"></span> <span class="keywordtype">int</span> <a class="code" href="class_polynomial_mod2.html#abfbd3eee725068a94239e7581b43fe45" title="return coefficient for x^i">operator[]</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const </span>{<span class="keywordflow">return</span> GetCoefficient(i);}
<a name="l00122"></a>00122 <span class="comment"></span>
<a name="l00123"></a>00123 <span class="comment"> //!</span>
<a name="l00124"></a>00124 <span class="comment"></span> <span class="keywordtype">bool</span> IsZero()<span class="keyword"> const </span>{<span class="keywordflow">return</span> !*<span class="keyword">this</span>;}<span class="comment"></span>
<a name="l00125"></a>00125 <span class="comment"> //!</span>
<a name="l00126"></a>00126 <span class="comment"></span> <span class="keywordtype">bool</span> Equals(<span class="keyword">const</span> PolynomialMod2 &rhs) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00127"></a>00127 <span class="comment"> //@}</span>
<a name="l00128"></a>00128 <span class="comment"></span><span class="comment"></span>
<a name="l00129"></a>00129 <span class="comment"> //! \name MANIPULATORS</span>
<a name="l00130"></a>00130 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00131"></a>00131 <span class="comment"></span><span class="comment"> //!</span>
<a name="l00132"></a>00132 <span class="comment"></span> PolynomialMod2& operator=(<span class="keyword">const</span> PolynomialMod2& t);<span class="comment"></span>
<a name="l00133"></a>00133 <span class="comment"> //!</span>
<a name="l00134"></a>00134 <span class="comment"></span> PolynomialMod2& operator&=(<span class="keyword">const</span> PolynomialMod2& t);<span class="comment"></span>
<a name="l00135"></a>00135 <span class="comment"> //!</span>
<a name="l00136"></a>00136 <span class="comment"></span> PolynomialMod2& operator^=(<span class="keyword">const</span> PolynomialMod2& t);<span class="comment"></span>
<a name="l00137"></a>00137 <span class="comment"> //!</span>
<a name="l00138"></a>00138 <span class="comment"></span> PolynomialMod2& operator+=(<span class="keyword">const</span> PolynomialMod2& t) {<span class="keywordflow">return</span> *<span class="keyword">this</span> ^= t;}<span class="comment"></span>
<a name="l00139"></a>00139 <span class="comment"> //!</span>
<a name="l00140"></a>00140 <span class="comment"></span> PolynomialMod2& operator-=(<span class="keyword">const</span> PolynomialMod2& t) {<span class="keywordflow">return</span> *<span class="keyword">this</span> ^= t;}<span class="comment"></span>
<a name="l00141"></a>00141 <span class="comment"> //!</span>
<a name="l00142"></a>00142 <span class="comment"></span> PolynomialMod2& operator*=(<span class="keyword">const</span> PolynomialMod2& t);<span class="comment"></span>
<a name="l00143"></a>00143 <span class="comment"> //!</span>
<a name="l00144"></a>00144 <span class="comment"></span> PolynomialMod2& operator/=(<span class="keyword">const</span> PolynomialMod2& t);<span class="comment"></span>
<a name="l00145"></a>00145 <span class="comment"> //!</span>
<a name="l00146"></a>00146 <span class="comment"></span> PolynomialMod2& operator%=(<span class="keyword">const</span> PolynomialMod2& t);<span class="comment"></span>
<a name="l00147"></a>00147 <span class="comment"> //!</span>
<a name="l00148"></a>00148 <span class="comment"></span> PolynomialMod2& operator<<=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);<span class="comment"></span>
<a name="l00149"></a>00149 <span class="comment"> //!</span>
<a name="l00150"></a>00150 <span class="comment"></span> PolynomialMod2& operator>>=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00151"></a>00151 <span class="comment"></span>
<a name="l00152"></a>00152 <span class="comment"> //!</span>
<a name="l00153"></a>00153 <span class="comment"></span> <span class="keywordtype">void</span> Randomize(<a class="code" href="class_random_number_generator.html" title="interface for random number generators">RandomNumberGenerator</a> &rng, <span class="keywordtype">size_t</span> bitcount);
<a name="l00154"></a>00154 <span class="comment"></span>
<a name="l00155"></a>00155 <span class="comment"> //!</span>
<a name="l00156"></a>00156 <span class="comment"></span> <span class="keywordtype">void</span> SetBit(<span class="keywordtype">size_t</span> i, <span class="keywordtype">int</span> value = 1);<span class="comment"></span>
<a name="l00157"></a>00157 <span class="comment"> //! set the n-th byte to value</span>
<a name="l00158"></a>00158 <span class="comment"></span> <span class="keywordtype">void</span> SetByte(<span class="keywordtype">size_t</span> n, byte value);
<a name="l00159"></a>00159 <span class="comment"></span>
<a name="l00160"></a>00160 <span class="comment"> //!</span>
<a name="l00161"></a>00161 <span class="comment"></span> <span class="keywordtype">void</span> SetCoefficient(<span class="keywordtype">size_t</span> i, <span class="keywordtype">int</span> value) {SetBit(i, value);}
<a name="l00162"></a>00162 <span class="comment"></span>
<a name="l00163"></a>00163 <span class="comment"> //!</span>
<a name="l00164"></a>00164 <span class="comment"></span> <span class="keywordtype">void</span> swap(PolynomialMod2 &a) {reg.swap(a.reg);}<span class="comment"></span>
<a name="l00165"></a>00165 <span class="comment"> //@}</span>
<a name="l00166"></a>00166 <span class="comment"></span><span class="comment"></span>
<a name="l00167"></a>00167 <span class="comment"> //! \name UNARY OPERATORS</span>
<a name="l00168"></a>00168 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00169"></a>00169 <span class="comment"></span><span class="comment"> //!</span>
<a name="l00170"></a>00170 <span class="comment"></span> <span class="keywordtype">bool</span> operator!() <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00171"></a>00171 <span class="comment"> //!</span>
<a name="l00172"></a>00172 <span class="comment"></span> PolynomialMod2 operator+()<span class="keyword"> const </span>{<span class="keywordflow">return</span> *<span class="keyword">this</span>;}<span class="comment"></span>
<a name="l00173"></a>00173 <span class="comment"> //!</span>
<a name="l00174"></a>00174 <span class="comment"></span> PolynomialMod2 operator-()<span class="keyword"> const </span>{<span class="keywordflow">return</span> *<span class="keyword">this</span>;}<span class="comment"></span>
<a name="l00175"></a>00175 <span class="comment"> //@}</span>
<a name="l00176"></a>00176 <span class="comment"></span><span class="comment"></span>
<a name="l00177"></a>00177 <span class="comment"> //! \name BINARY OPERATORS</span>
<a name="l00178"></a>00178 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00179"></a>00179 <span class="comment"></span><span class="comment"> //!</span>
<a name="l00180"></a>00180 <span class="comment"></span> PolynomialMod2 And(<span class="keyword">const</span> PolynomialMod2 &b) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00181"></a>00181 <span class="comment"> //!</span>
<a name="l00182"></a>00182 <span class="comment"></span> PolynomialMod2 Xor(<span class="keyword">const</span> PolynomialMod2 &b) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00183"></a>00183 <span class="comment"> //!</span>
<a name="l00184"></a>00184 <span class="comment"></span> PolynomialMod2 Plus(<span class="keyword">const</span> PolynomialMod2 &b)<span class="keyword"> const </span>{<span class="keywordflow">return</span> Xor(b);}<span class="comment"></span>
<a name="l00185"></a>00185 <span class="comment"> //!</span>
<a name="l00186"></a>00186 <span class="comment"></span> PolynomialMod2 Minus(<span class="keyword">const</span> PolynomialMod2 &b)<span class="keyword"> const </span>{<span class="keywordflow">return</span> Xor(b);}<span class="comment"></span>
<a name="l00187"></a>00187 <span class="comment"> //!</span>
<a name="l00188"></a>00188 <span class="comment"></span> PolynomialMod2 Times(<span class="keyword">const</span> PolynomialMod2 &b) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00189"></a>00189 <span class="comment"> //!</span>
<a name="l00190"></a>00190 <span class="comment"></span> PolynomialMod2 DividedBy(<span class="keyword">const</span> PolynomialMod2 &b) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00191"></a>00191 <span class="comment"> //!</span>
<a name="l00192"></a>00192 <span class="comment"></span> PolynomialMod2 Modulo(<span class="keyword">const</span> PolynomialMod2 &b) <span class="keyword">const</span>;
<a name="l00193"></a>00193 <span class="comment"></span>
<a name="l00194"></a>00194 <span class="comment"> //!</span>
<a name="l00195"></a>00195 <span class="comment"></span> PolynomialMod2 operator>>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00196"></a>00196 <span class="comment"> //!</span>
<a name="l00197"></a>00197 <span class="comment"></span> PolynomialMod2 operator<<(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n) <span class="keyword">const</span>;<span class="comment"></span>
<a name="l00198"></a>00198 <span class="comment"> //@}</span>
<a name="l00199"></a>00199 <span class="comment"></span><span class="comment"></span>
<a name="l00200"></a>00200 <span class="comment"> //! \name OTHER ARITHMETIC FUNCTIONS</span>
<a name="l00201"></a>00201 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00202"></a>00202 <span class="comment"></span><span class="comment"> //! sum modulo 2 of all coefficients</span>
<a name="l00203"></a>00203 <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> Parity() <span class="keyword">const</span>;
<a name="l00204"></a>00204 <span class="comment"></span>
<a name="l00205"></a>00205 <span class="comment"> //! check for irreducibility</span>
<a name="l00206"></a>00206 <span class="comment"></span> <span class="keywordtype">bool</span> IsIrreducible() <span class="keyword">const</span>;
<a name="l00207"></a>00207 <span class="comment"></span>
<a name="l00208"></a>00208 <span class="comment"> //! is always zero since we're working modulo 2</span>
<a name="l00209"></a><a class="code" href="class_polynomial_mod2.html#a528024a9bff9a7145e6c9cac165ce258">00209</a> <span class="comment"></span> PolynomialMod2 <a class="code" href="class_polynomial_mod2.html#a528024a9bff9a7145e6c9cac165ce258" title="is always zero since we&#39;re working modulo 2">Doubled</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> Zero();}<span class="comment"></span>
<a name="l00210"></a>00210 <span class="comment"> //!</span>
<a name="l00211"></a>00211 <span class="comment"></span> PolynomialMod2 Squared() <span class="keyword">const</span>;
<a name="l00212"></a>00212 <span class="comment"></span>
<a name="l00213"></a>00213 <span class="comment"> //! only 1 is a unit</span>
<a name="l00214"></a><a class="code" href="class_polynomial_mod2.html#ae106fdd2fe4747f2f7fa677543070822">00214</a> <span class="comment"></span> <span class="keywordtype">bool</span> <a class="code" href="class_polynomial_mod2.html#ae106fdd2fe4747f2f7fa677543070822" title="only 1 is a unit">IsUnit</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> Equals(One());}<span class="comment"></span>
<a name="l00215"></a>00215 <span class="comment"> //! return inverse if *this is a unit, otherwise return 0</span>
<a name="l00216"></a><a class="code" href="class_polynomial_mod2.html#af93d5dd751be38de7a66413217f56f17">00216</a> <span class="comment"></span> PolynomialMod2 <a class="code" href="class_polynomial_mod2.html#af93d5dd751be38de7a66413217f56f17" title="return inverse if *this is a unit, otherwise return 0">MultiplicativeInverse</a>()<span class="keyword"> const </span>{<span class="keywordflow">return</span> IsUnit() ? One() : Zero();}
<a name="l00217"></a>00217 <span class="comment"></span>
<a name="l00218"></a>00218 <span class="comment"> //! greatest common divisor</span>
<a name="l00219"></a>00219 <span class="comment"></span> <span class="keyword">static</span> PolynomialMod2 CRYPTOPP_API Gcd(<span class="keyword">const</span> PolynomialMod2 &a, <span class="keyword">const</span> PolynomialMod2 &n);<span class="comment"></span>
<a name="l00220"></a>00220 <span class="comment"> //! calculate multiplicative inverse of *this mod n</span>
<a name="l00221"></a>00221 <span class="comment"></span> PolynomialMod2 InverseMod(<span class="keyword">const</span> PolynomialMod2 &) <span class="keyword">const</span>;
<a name="l00222"></a>00222 <span class="comment"></span>
<a name="l00223"></a>00223 <span class="comment"> //! calculate r and q such that (a == d*q + r) && (deg(r) < deg(d))</span>
<a name="l00224"></a>00224 <span class="comment"></span> <span class="keyword">static</span> <span class="keywordtype">void</span> CRYPTOPP_API Divide(PolynomialMod2 &r, PolynomialMod2 &q, <span class="keyword">const</span> PolynomialMod2 &a, <span class="keyword">const</span> PolynomialMod2 &d);<span class="comment"></span>
<a name="l00225"></a>00225 <span class="comment"> //@}</span>
<a name="l00226"></a>00226 <span class="comment"></span><span class="comment"></span>
<a name="l00227"></a>00227 <span class="comment"> //! \name INPUT/OUTPUT</span>
<a name="l00228"></a>00228 <span class="comment"></span><span class="comment"> //@{</span>
<a name="l00229"></a>00229 <span class="comment"></span><span class="comment"> //!</span>
<a name="l00230"></a>00230 <span class="comment"></span> <span class="keyword">friend</span> std::ostream& operator<<(std::ostream& out, <span class="keyword">const</span> PolynomialMod2 &a);<span class="comment"></span>
<a name="l00231"></a>00231 <span class="comment"> //@}</span>
<a name="l00232"></a>00232 <span class="comment"></span>
<a name="l00233"></a>00233 <span class="keyword">private</span>:
<a name="l00234"></a>00234 <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="class_g_f2_n_t.html" title="GF(2^n) with Trinomial Basis.">GF2NT</a>;
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <a class="code" href="class_sec_block.html">SecWordBlock</a> reg;
<a name="l00237"></a>00237 };
<a name="l00238"></a>00238 <span class="comment"></span>
<a name="l00239"></a>00239 <span class="comment">//!</span>
<a name="l00240"></a>00240 <span class="comment"></span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b)
<a name="l00241"></a>00241 {<span class="keywordflow">return</span> a.Equals(b);}<span class="comment"></span>
<a name="l00242"></a>00242 <span class="comment">//!</span>
<a name="l00243"></a>00243 <span class="comment"></span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b)
<a name="l00244"></a>00244 {<span class="keywordflow">return</span> !(a==b);}<span class="comment"></span>
<a name="l00245"></a>00245 <span class="comment">//! compares degree</span>
<a name="l00246"></a><a class="code" href="gf2n_8h.html#a3522cfe7b5843a5572165b964ea79c67">00246</a> <span class="comment"></span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="gf2n_8h.html#a3522cfe7b5843a5572165b964ea79c67" title="compares degree">operator> </a>(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b)
<a name="l00247"></a>00247 {<span class="keywordflow">return</span> a.Degree() > b.Degree();}<span class="comment"></span>
<a name="l00248"></a>00248 <span class="comment">//! compares degree</span>
<a name="l00249"></a><a class="code" href="gf2n_8h.html#ab2c528cac1c470a5c25eb7afe6641b89">00249</a> <span class="comment"></span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="gf2n_8h.html#ab2c528cac1c470a5c25eb7afe6641b89" title="compares degree">operator>=</a>(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b)
<a name="l00250"></a>00250 {<span class="keywordflow">return</span> a.Degree() >= b.Degree();}<span class="comment"></span>
<a name="l00251"></a>00251 <span class="comment">//! compares degree</span>
<a name="l00252"></a><a class="code" href="gf2n_8h.html#abe7b3406821884ed8df76bf9e8266efb">00252</a> <span class="comment"></span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="gf2n_8h.html#abe7b3406821884ed8df76bf9e8266efb" title="compares degree">operator< </a>(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b)
<a name="l00253"></a>00253 {<span class="keywordflow">return</span> a.Degree() < b.Degree();}<span class="comment"></span>
<a name="l00254"></a>00254 <span class="comment">//! compares degree</span>
<a name="l00255"></a><a class="code" href="gf2n_8h.html#ad2556fc49e5ac64d904b4a9f54738908">00255</a> <span class="comment"></span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="gf2n_8h.html#ad2556fc49e5ac64d904b4a9f54738908" title="compares degree">operator<=</a>(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b)
<a name="l00256"></a>00256 {<span class="keywordflow">return</span> a.Degree() <= b.Degree();}<span class="comment"></span>
<a name="l00257"></a>00257 <span class="comment">//!</span>
<a name="l00258"></a>00258 <span class="comment"></span><span class="keyword">inline</span> CryptoPP::PolynomialMod2 operator&(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b) {<span class="keywordflow">return</span> a.And(b);}<span class="comment"></span>
<a name="l00259"></a>00259 <span class="comment">//!</span>
<a name="l00260"></a>00260 <span class="comment"></span><span class="keyword">inline</span> CryptoPP::PolynomialMod2 operator^(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b) {<span class="keywordflow">return</span> a.Xor(b);}<span class="comment"></span>
<a name="l00261"></a>00261 <span class="comment">//!</span>
<a name="l00262"></a>00262 <span class="comment"></span><span class="keyword">inline</span> CryptoPP::PolynomialMod2 operator+(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b) {<span class="keywordflow">return</span> a.Plus(b);}<span class="comment"></span>
<a name="l00263"></a>00263 <span class="comment">//!</span>
<a name="l00264"></a>00264 <span class="comment"></span><span class="keyword">inline</span> CryptoPP::PolynomialMod2 operator-(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b) {<span class="keywordflow">return</span> a.Minus(b);}<span class="comment"></span>
<a name="l00265"></a>00265 <span class="comment">//!</span>
<a name="l00266"></a>00266 <span class="comment"></span><span class="keyword">inline</span> CryptoPP::PolynomialMod2 operator*(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b) {<span class="keywordflow">return</span> a.Times(b);}<span class="comment"></span>
<a name="l00267"></a>00267 <span class="comment">//!</span>
<a name="l00268"></a>00268 <span class="comment"></span><span class="keyword">inline</span> CryptoPP::PolynomialMod2 operator/(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b) {<span class="keywordflow">return</span> a.DividedBy(b);}<span class="comment"></span>
<a name="l00269"></a>00269 <span class="comment">//!</span>
<a name="l00270"></a>00270 <span class="comment"></span><span class="keyword">inline</span> CryptoPP::PolynomialMod2 operator%(<span class="keyword">const</span> CryptoPP::PolynomialMod2 &a, <span class="keyword">const</span> CryptoPP::PolynomialMod2 &b) {<span class="keywordflow">return</span> a.Modulo(b);}
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="comment">// CodeWarrior 8 workaround: put these template instantiations after overloaded operator declarations,</span>
<a name="l00273"></a>00273 <span class="comment">// but before the use of QuotientRing<EuclideanDomainOf<PolynomialMod2> > for VC .NET 2003</span>
<a name="l00274"></a>00274 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_abstract_group.html">AbstractGroup<PolynomialMod2></a>;
<a name="l00275"></a>00275 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_abstract_ring.html">AbstractRing<PolynomialMod2></a>;
<a name="l00276"></a>00276 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_abstract_euclidean_domain.html">AbstractEuclideanDomain<PolynomialMod2></a>;
<a name="l00277"></a>00277 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_euclidean_domain_of.html">EuclideanDomainOf<PolynomialMod2></a>;
<a name="l00278"></a>00278 CRYPTOPP_DLL_TEMPLATE_CLASS <a class="code" href="class_quotient_ring.html" title="Quotient Ring.">QuotientRing<EuclideanDomainOf<PolynomialMod2></a> >;
<a name="l00279"></a>00279 <span class="comment"></span>
<a name="l00280"></a>00280 <span class="comment">//! GF(2^n) with Polynomial Basis</span>
<a name="l00281"></a><a class="code" href="class_g_f2_n_p.html">00281</a> <span class="comment"></span><span class="keyword">class </span>CRYPTOPP_DLL <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a> : <span class="keyword">public</span> <a class="code" href="class_quotient_ring.html" title="Quotient Ring.">QuotientRing</a><EuclideanDomainOf<PolynomialMod2> >
<a name="l00282"></a>00282 {
<a name="l00283"></a>00283 <span class="keyword">public</span>:
<a name="l00284"></a>00284 <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a>(<span class="keyword">const</span> PolynomialMod2 &modulus);
<a name="l00285"></a>00285
<a name="l00286"></a>00286 <span class="keyword">virtual</span> <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a> * Clone()<span class="keyword"> const </span>{<span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a>(*<span class="keyword">this</span>);}
<a name="l00287"></a>00287 <span class="keyword">virtual</span> <span class="keywordtype">void</span> DEREncode(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &bt)<span class="keyword"> const</span>
<a name="l00288"></a>00288 <span class="keyword"> </span>{assert(<span class="keyword">false</span>);} <span class="comment">// no ASN.1 syntax yet for general polynomial basis</span>
<a name="l00289"></a>00289
<a name="l00290"></a>00290 <span class="keywordtype">void</span> DEREncodeElement(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &out, <span class="keyword">const</span> Element &a) <span class="keyword">const</span>;
<a name="l00291"></a>00291 <span class="keywordtype">void</span> BERDecodeElement(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &in, Element &a) <span class="keyword">const</span>;
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="keywordtype">bool</span> Equal(<span class="keyword">const</span> Element &a, <span class="keyword">const</span> Element &b)<span class="keyword"> const</span>
<a name="l00294"></a>00294 <span class="keyword"> </span>{assert(a.Degree() < m_modulus.Degree() && b.Degree() < m_modulus.Degree()); <span class="keywordflow">return</span> a.Equals(b);}
<a name="l00295"></a>00295
<a name="l00296"></a>00296 <span class="keywordtype">bool</span> IsUnit(<span class="keyword">const</span> Element &a)<span class="keyword"> const</span>
<a name="l00297"></a>00297 <span class="keyword"> </span>{assert(a.Degree() < m_modulus.Degree()); <span class="keywordflow">return</span> !!a;}
<a name="l00298"></a>00298
<a name="l00299"></a>00299 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MaxElementBitLength()<span class="keyword"> const</span>
<a name="l00300"></a>00300 <span class="keyword"> </span>{<span class="keywordflow">return</span> m;}
<a name="l00301"></a>00301
<a name="l00302"></a>00302 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MaxElementByteLength()<span class="keyword"> const</span>
<a name="l00303"></a>00303 <span class="keyword"> </span>{<span class="keywordflow">return</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)BitsToBytes(MaxElementBitLength());}
<a name="l00304"></a>00304
<a name="l00305"></a>00305 Element SquareRoot(<span class="keyword">const</span> Element &a) <span class="keyword">const</span>;
<a name="l00306"></a>00306
<a name="l00307"></a>00307 Element HalfTrace(<span class="keyword">const</span> Element &a) <span class="keyword">const</span>;
<a name="l00308"></a>00308
<a name="l00309"></a>00309 <span class="comment">// returns z such that z^2 + z == a</span>
<a name="l00310"></a>00310 Element SolveQuadraticEquation(<span class="keyword">const</span> Element &a) <span class="keyword">const</span>;
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="keyword">protected</span>:
<a name="l00313"></a>00313 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m;
<a name="l00314"></a>00314 };
<a name="l00315"></a>00315 <span class="comment"></span>
<a name="l00316"></a>00316 <span class="comment">//! GF(2^n) with Trinomial Basis</span>
<a name="l00317"></a><a class="code" href="class_g_f2_n_t.html">00317</a> <span class="comment"></span><span class="keyword">class </span>CRYPTOPP_DLL <a class="code" href="class_g_f2_n_t.html" title="GF(2^n) with Trinomial Basis.">GF2NT</a> : <span class="keyword">public</span> <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a>
<a name="l00318"></a>00318 {
<a name="l00319"></a>00319 <span class="keyword">public</span>:
<a name="l00320"></a>00320 <span class="comment">// polynomial modulus = x^t0 + x^t1 + x^t2, t0 > t1 > t2</span>
<a name="l00321"></a>00321 <a class="code" href="class_g_f2_n_t.html" title="GF(2^n) with Trinomial Basis.">GF2NT</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t0, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t1, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t2);
<a name="l00322"></a>00322
<a name="l00323"></a>00323 <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a> * Clone()<span class="keyword"> const </span>{<span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="class_g_f2_n_t.html" title="GF(2^n) with Trinomial Basis.">GF2NT</a>(*<span class="keyword">this</span>);}
<a name="l00324"></a>00324 <span class="keywordtype">void</span> DEREncode(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &bt) <span class="keyword">const</span>;
<a name="l00325"></a>00325
<a name="l00326"></a>00326 <span class="keyword">const</span> Element& Multiply(<span class="keyword">const</span> Element &a, <span class="keyword">const</span> Element &b) <span class="keyword">const</span>;
<a name="l00327"></a>00327
<a name="l00328"></a>00328 <span class="keyword">const</span> Element& <a class="code" href="class_square.html" title="Square">Square</a>(<span class="keyword">const</span> Element &a)<span class="keyword"> const</span>
<a name="l00329"></a>00329 <span class="keyword"> </span>{<span class="keywordflow">return</span> Reduced(a.Squared());}
<a name="l00330"></a>00330
<a name="l00331"></a>00331 <span class="keyword">const</span> Element& MultiplicativeInverse(<span class="keyword">const</span> Element &a) <span class="keyword">const</span>;
<a name="l00332"></a>00332
<a name="l00333"></a>00333 <span class="keyword">private</span>:
<a name="l00334"></a>00334 <span class="keyword">const</span> Element& Reduced(<span class="keyword">const</span> Element &a) <span class="keyword">const</span>;
<a name="l00335"></a>00335
<a name="l00336"></a>00336 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t0, t1;
<a name="l00337"></a>00337 <span class="keyword">mutable</span> PolynomialMod2 result;
<a name="l00338"></a>00338 };
<a name="l00339"></a>00339 <span class="comment"></span>
<a name="l00340"></a>00340 <span class="comment">//! GF(2^n) with Pentanomial Basis</span>
<a name="l00341"></a><a class="code" href="class_g_f2_n_p_p.html">00341</a> <span class="comment"></span><span class="keyword">class </span>CRYPTOPP_DLL <a class="code" href="class_g_f2_n_p_p.html" title="GF(2^n) with Pentanomial Basis.">GF2NPP</a> : <span class="keyword">public</span> <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a>
<a name="l00342"></a>00342 {
<a name="l00343"></a>00343 <span class="keyword">public</span>:
<a name="l00344"></a>00344 <span class="comment">// polynomial modulus = x^t0 + x^t1 + x^t2 + x^t3 + x^t4, t0 > t1 > t2 > t3 > t4</span>
<a name="l00345"></a>00345 <a class="code" href="class_g_f2_n_p_p.html" title="GF(2^n) with Pentanomial Basis.">GF2NPP</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t0, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t1, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t2, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t3, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t4)
<a name="l00346"></a>00346 : <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a>(<a class="code" href="class_polynomial_mod2.html#a507094d47020af3d23a9fd68cc4b527d" title="return x^t0 + x^t1 + x^t2 + x^t3 + x^t4">PolynomialMod2::Pentanomial</a>(t0, t1, t2, t3, t4)), t0(t0), t1(t1), t2(t2), t3(t3) {}
<a name="l00347"></a>00347
<a name="l00348"></a>00348 <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a> * Clone()<span class="keyword"> const </span>{<span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="class_g_f2_n_p_p.html" title="GF(2^n) with Pentanomial Basis.">GF2NPP</a>(*<span class="keyword">this</span>);}
<a name="l00349"></a>00349 <span class="keywordtype">void</span> DEREncode(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &bt) <span class="keyword">const</span>;
<a name="l00350"></a>00350
<a name="l00351"></a>00351 <span class="keyword">private</span>:
<a name="l00352"></a>00352 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> t0, t1, t2, t3;
<a name="l00353"></a>00353 };
<a name="l00354"></a>00354
<a name="l00355"></a>00355 <span class="comment">// construct new GF2NP from the ASN.1 sequence Characteristic-two</span>
<a name="l00356"></a>00356 CRYPTOPP_DLL <a class="code" href="class_g_f2_n_p.html" title="GF(2^n) with Polynomial Basis.">GF2NP</a> * CRYPTOPP_API BERDecodeGF2NP(<a class="code" href="class_buffered_transformation.html" title="interface for buffered transformations">BufferedTransformation</a> &bt);
<a name="l00357"></a>00357
<a name="l00358"></a>00358 NAMESPACE_END
<a name="l00359"></a>00359
<a name="l00360"></a>00360 <span class="preprocessor">#ifndef __BORLANDC__</span>
<a name="l00361"></a>00361 <span class="preprocessor"></span>NAMESPACE_BEGIN(std)
<a name="l00362"></a>00362 template<> inline <span class="keywordtype">void</span> swap(CryptoPP::PolynomialMod2 &a, CryptoPP::PolynomialMod2 &b)
<a name="l00363"></a>00363 {
<a name="l00364"></a>00364 a.swap(b);
<a name="l00365"></a>00365 }
<a name="l00366"></a>00366 NAMESPACE_END
<a name="l00367"></a>00367 <span class="preprocessor">#endif</span>
<a name="l00368"></a>00368 <span class="preprocessor"></span>
<a name="l00369"></a>00369 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Tue Feb 8 2011 for Crypto++ by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </small></address>
</body>
</html>
