📄 gf2n_8cpp-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.cpp 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.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// gf2n.cpp - written and placed in the public domain by Wei Dai</span><a name="l00002"></a>00002 <a name="l00003"></a>00003 <span class="preprocessor">#include "pch.h"</span><a name="l00004"></a>00004 <a name="l00005"></a>00005 <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span><a name="l00006"></a>00006 <span class="preprocessor"></span><a name="l00007"></a>00007 <span class="preprocessor">#include "<a class="code" href="gf2n_8h.html">gf2n.h</a>"</span><a name="l00008"></a>00008 <span class="preprocessor">#include "algebra.h"</span><a name="l00009"></a>00009 <span class="preprocessor">#include "words.h"</span><a name="l00010"></a>00010 <span class="preprocessor">#include "randpool.h"</span><a name="l00011"></a>00011 <span class="preprocessor">#include "asn.h"</span><a name="l00012"></a>00012 <span class="preprocessor">#include "oids.h"</span><a name="l00013"></a>00013 <a name="l00014"></a>00014 <span class="preprocessor">#include <iostream></span><a name="l00015"></a>00015 <a name="l00016"></a>00016 NAMESPACE_BEGIN(CryptoPP)<a name="l00017"></a>00017 <a name="l00018"></a><a class="code" href="class_polynomial_mod2.html#c67d4fb61b199c101f5de08d3aa2e782">00018</a> <a class="code" href="class_polynomial_mod2.html" title="Polynomial with Coefficients in GF(2).">PolynomialMod2</a>::<a class="code" href="class_polynomial_mod2.html" title="Polynomial with Coefficients in GF(2).">PolynomialMod2</a>()<a name="l00019"></a>00019 {<a name="l00020"></a>00020 }<a name="l00021"></a>00021 <a name="l00022"></a><a class="code" href="class_polynomial_mod2.html#51790dcfe87a449169e8cb5c0f20da7e">00022</a> <a class="code" href="class_polynomial_mod2.html#c67d4fb61b199c101f5de08d3aa2e782" title="creates the zero polynomial">PolynomialMod2::PolynomialMod2</a>(word value, <span class="keywordtype">size_t</span> bitLength)<a name="l00023"></a>00023 : reg(BitsToWords(bitLength))<a name="l00024"></a>00024 {<a name="l00025"></a>00025 assert(value==0 || reg.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>()>0);<a name="l00026"></a>00026 <a name="l00027"></a>00027 <span class="keywordflow">if</span> (reg.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>() > 0)<a name="l00028"></a>00028 {<a name="l00029"></a>00029 reg[0] = value;<a name="l00030"></a>00030 SetWords(reg+1, 0, reg.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>()-1);<a name="l00031"></a>00031 }<a name="l00032"></a>00032 }<a name="l00033"></a>00033 <a name="l00034"></a><a class="code" href="class_polynomial_mod2.html#6866391c010ebef60c452df7961e809c">00034</a> <a class="code" href="class_polynomial_mod2.html#c67d4fb61b199c101f5de08d3aa2e782" title="creates the zero polynomial">PolynomialMod2::PolynomialMod2</a>(<span class="keyword">const</span> <a class="code" href="class_polynomial_mod2.html" title="Polynomial with Coefficients in GF(2).">PolynomialMod2</a>& t)<a name="l00035"></a>00035 : reg(t.reg.size())<a name="l00036"></a>00036 {<a name="l00037"></a>00037 CopyWords(reg, t.<a class="code" href="class_polynomial_mod2.html#68853b1b5d6d0361cd0b16f1889466a4">reg</a>, reg.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>());<a name="l00038"></a>00038 }<a name="l00039"></a>00039 <a name="l00040"></a><a class="code" href="class_polynomial_mod2.html#7021f18e89d4494b6f2ddede2ac29b3a">00040</a> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#7021f18e89d4494b6f2ddede2ac29b3a">PolynomialMod2::Randomize</a>(<a class="code" href="class_random_number_generator.html" title="interface for random number generators">RandomNumberGenerator</a> &rng, <span class="keywordtype">size_t</span> nbits)<a name="l00041"></a>00041 {<a name="l00042"></a>00042 <span class="keyword">const</span> <span class="keywordtype">size_t</span> nbytes = nbits/8 + 1;<a name="l00043"></a>00043 <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> buf(nbytes);<a name="l00044"></a>00044 rng.<a class="code" href="class_random_number_generator.html#497145546d24e6d4abaf10b7e0f1ba17" title="generate random array of bytes">GenerateBlock</a>(buf, nbytes);<a name="l00045"></a>00045 buf[0] = (byte)Crop(buf[0], nbits % 8);<a name="l00046"></a>00046 <a class="code" href="class_polynomial_mod2.html#dc611fe09c3a9b919dce7b8b45cec29d">Decode</a>(buf, nbytes);<a name="l00047"></a>00047 }<a name="l00048"></a>00048 <a name="l00049"></a><a class="code" href="class_polynomial_mod2.html#bf3ecc0dafe04c57dacea983a9a6690e">00049</a> <a class="code" href="class_polynomial_mod2.html" title="Polynomial with Coefficients in GF(2).">PolynomialMod2</a> <a class="code" href="class_polynomial_mod2.html#bf3ecc0dafe04c57dacea983a9a6690e" title="return x^(n-1) + ... + x + 1">PolynomialMod2::AllOnes</a>(<span class="keywordtype">size_t</span> bitLength)<a name="l00050"></a>00050 {<a name="l00051"></a>00051 <a class="code" href="class_polynomial_mod2.html" title="Polynomial with Coefficients in GF(2).">PolynomialMod2</a> result((word)0, bitLength);<a name="l00052"></a>00052 SetWords(result.<a class="code" href="class_polynomial_mod2.html#68853b1b5d6d0361cd0b16f1889466a4">reg</a>, ~(word)0, result.<a class="code" href="class_polynomial_mod2.html#68853b1b5d6d0361cd0b16f1889466a4">reg</a>.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>());<a name="l00053"></a>00053 <span class="keywordflow">if</span> (bitLength%WORD_BITS)<a name="l00054"></a>00054 result.<a class="code" href="class_polynomial_mod2.html#68853b1b5d6d0361cd0b16f1889466a4">reg</a>[result.<a class="code" href="class_polynomial_mod2.html#68853b1b5d6d0361cd0b16f1889466a4">reg</a>.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>()-1] = (word)Crop(result.<a class="code" href="class_polynomial_mod2.html#68853b1b5d6d0361cd0b16f1889466a4">reg</a>[result.<a class="code" href="class_polynomial_mod2.html#68853b1b5d6d0361cd0b16f1889466a4">reg</a>.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>()-1], bitLength%WORD_BITS);<a name="l00055"></a>00055 <span class="keywordflow">return</span> result;<a name="l00056"></a>00056 }<a name="l00057"></a>00057 <a name="l00058"></a><a class="code" href="class_polynomial_mod2.html#b3855a5f77e9bbc7d82a4239ccf59329">00058</a> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#b3855a5f77e9bbc7d82a4239ccf59329">PolynomialMod2::SetBit</a>(<span class="keywordtype">size_t</span> n, <span class="keywordtype">int</span> value)<a name="l00059"></a>00059 {<a name="l00060"></a>00060 <span class="keywordflow">if</span> (value)<a name="l00061"></a>00061 {<a name="l00062"></a>00062 reg.<a class="code" href="class_sec_block.html#4ef9516e973051e6afa38bba526da3e9" title="change size only if newSize > current size. contents are preserved and additional...">CleanGrow</a>(n/WORD_BITS + 1);<a name="l00063"></a>00063 reg[n/WORD_BITS] |= (word(1) << (n%WORD_BITS));<a name="l00064"></a>00064 }<a name="l00065"></a>00065 <span class="keywordflow">else</span><a name="l00066"></a>00066 {<a name="l00067"></a>00067 <span class="keywordflow">if</span> (n/WORD_BITS < reg.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>())<a name="l00068"></a>00068 reg[n/WORD_BITS] &= ~(word(1) << (n%WORD_BITS));<a name="l00069"></a>00069 }<a name="l00070"></a>00070 }<a name="l00071"></a>00071 <a name="l00072"></a><a class="code" href="class_polynomial_mod2.html#7a24a5ec904f384e4285d133dbe07757">00072</a> byte <a class="code" href="class_polynomial_mod2.html#7a24a5ec904f384e4285d133dbe07757" title="return the n-th byte">PolynomialMod2::GetByte</a>(<span class="keywordtype">size_t</span> n)<span class="keyword"> const</span><a name="l00073"></a>00073 <span class="keyword"></span>{<a name="l00074"></a>00074 <span class="keywordflow">if</span> (n/WORD_SIZE >= reg.<a class="code" href="class_sec_block.html#f5999bffe3193e62719cc0792b0282a7">size</a>())<a name="l00075"></a>00075 <span class="keywordflow">return</span> 0;<a name="l00076"></a>00076 <span class="keywordflow">else</span><a name="l00077"></a>00077 <span class="keywordflow">return</span> byte(reg[n/WORD_SIZE] >> ((n%WORD_SIZE)*8));<a name="l00078"></a>00078 }<a name="l00079"></a>00079 <a name="l00080"></a><a class="code" href="class_polynomial_mod2.html#f15c7ead361d1f7ea23d5e4bd5535989">00080</a> <span class="keywordtype">void</span> <a class="code" href="class_polynomial_mod2.html#f15c7ead361d1f7ea23d5e4bd5535989" title="set the n-th byte to value">PolynomialMod2::SetByte</a>(<span class="keywordtype">size_t</span> n, byte value)<a name="l00081"></a>00081 {<a name="l00082"></a>00082 reg.<a class="code" href="class_sec_block.html#4ef9516e973051e6afa38bba526da3e9" title="change size only if newSize > current size. contents are preserved and additional...">CleanGrow</a>(BytesToWords(n+1));<a name="l00083"></a>00083 reg[n/WORD_SIZE] &= ~(word(0xff) << 8*(n%WORD_SIZE));<a name="l00084"></a>00084 reg[n/WORD_SIZE] |= (word(value) << 8*(n%WORD_SIZE));<a name="l00085"></a>00085 }<a name="l00086"></a>00086 ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -