📄 gf2n_8h-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: gf2n.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.2 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="namespaces.html"><span>Namespaces</span></a></li> <li><a href="classes.html"><span>Classes</span></a></li> <li class="current"><a href="files.html"><span>Files</span></a></li> </ul></div><div class="tabs"> <ul> <li><a href="files.html"><span>File List</span></a></li> <li><a href="globals.html"><span>File Members</span></a></li> </ul></div><h1>gf2n.h</h1><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><a class="code" href="class_polynomial_mod2_1_1_divide_by_zero.html#c44eb02a0f4cb7a8d1ff728d2875ac2f">00026</a> <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><a class="code" href="class_polynomial_mod2.html#7027d2803057b129738a862611faf3d2">00029</a> <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#dc62dcb615c688c00c924775920c752d">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#ba40ce289e5ffaa47542391ead80aa85">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#455d995dd1eee03b8412eacae4c61186">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#00c84f8cb2e7262de75e4c1e28760d43">00077</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> MinEncodedSize()<span class="keyword"> const </span>{<span class="keywordflow">return</span> STDMAX(1U, ByteCount());}<a name="l00078"></a>00078 <span class="comment"></span>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -