📄 dsa_8cpp-source.html
字号:
<a name="l00053"></a>00053 r.<a class="code" href="class_integer.html#9d6226e12e1ac0b957ad84ac54a15ce9" title="encode absolute value in OpenPGP format, return length of output">OpenPGPEncode</a>(sink);<a name="l00054"></a>00054 s.<a class="code" href="class_integer.html#9d6226e12e1ac0b957ad84ac54a15ce9" title="encode absolute value in OpenPGP format, return length of output">OpenPGPEncode</a>(sink);<a name="l00055"></a>00055 <span class="keywordflow">break</span>;<a name="l00056"></a>00056 }<a name="l00057"></a>00057 <a name="l00058"></a>00058 <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)sink.<a class="code" href="class_array_sink.html#36374569bfaf3711c3a7a306a46ea6d9">TotalPutLength</a>();<a name="l00059"></a>00059 }<a name="l00060"></a>00060 <a name="l00061"></a><a class="code" href="struct_d_s_a.html#48eab0da4234a2d20f3ef7250fbad5f5">00061</a> <span class="keywordtype">bool</span> <a class="code" href="struct_d_s_a.html#48eab0da4234a2d20f3ef7250fbad5f5" title="Generate DSA primes according to NIST standard.">DSA::GeneratePrimes</a>(<span class="keyword">const</span> byte *seedIn, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> g, <span class="keywordtype">int</span> &counter,<a name="l00062"></a>00062 <a class="code" href="class_integer.html" title="multiple precision integer and basic arithmetics">Integer</a> &p, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> L, <a class="code" href="class_integer.html" title="multiple precision integer and basic arithmetics">Integer</a> &q, <span class="keywordtype">bool</span> useInputCounterValue)<a name="l00063"></a>00063 {<a name="l00064"></a>00064 assert(g%8 == 0);<a name="l00065"></a>00065 <a name="l00066"></a>00066 <a class="code" href="class_s_h_a1.html" title="SHA-1">SHA</a> sha;<a name="l00067"></a>00067 <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> seed(seedIn, g/8);<a name="l00068"></a>00068 <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> U(<a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a>);<a name="l00069"></a>00069 <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> temp(<a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a>);<a name="l00070"></a>00070 <a class="code" href="class_sec_block.html" title="a block of memory allocated using A">SecByteBlock</a> W(((L-1)/160+1) * <a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a>);<a name="l00071"></a>00071 <span class="keyword">const</span> <span class="keywordtype">int</span> n = (L-1) / 160;<a name="l00072"></a>00072 <span class="keyword">const</span> <span class="keywordtype">int</span> b = (L-1) % 160;<a name="l00073"></a>00073 <a class="code" href="class_integer.html" title="multiple precision integer and basic arithmetics">Integer</a> X;<a name="l00074"></a>00074 <a name="l00075"></a>00075 sha.<a class="code" href="class_hash_transformation.html#f8124c4fca23b74bbdc43660bdae692c" title="use this if your input is in one piece and you don't want to call Update() and Final()...">CalculateDigest</a>(U, seed, g/8);<a name="l00076"></a>00076 <a name="l00077"></a>00077 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=g/8-1, carry=<span class="keyword">true</span>; i>=0 && carry; i--)<a name="l00078"></a>00078 carry=!++seed[i];<a name="l00079"></a>00079 <a name="l00080"></a>00080 sha.<a class="code" href="class_hash_transformation.html#f8124c4fca23b74bbdc43660bdae692c" title="use this if your input is in one piece and you don't want to call Update() and Final()...">CalculateDigest</a>(temp, seed, g/8);<a name="l00081"></a>00081 xorbuf(U, temp, <a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a>);<a name="l00082"></a>00082 <a name="l00083"></a>00083 U[0] |= 0x80;<a name="l00084"></a>00084 U[<a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a>-1] |= 1;<a name="l00085"></a>00085 q.<a class="code" href="class_integer.html#e91fee9e9873f3412f47e6d647545099">Decode</a>(U, <a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a>);<a name="l00086"></a>00086 <a name="l00087"></a>00087 <span class="keywordflow">if</span> (!IsPrime(q))<a name="l00088"></a>00088 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00089"></a>00089 <a name="l00090"></a>00090 <span class="keywordtype">int</span> counterEnd = useInputCounterValue ? counter+1 : 4096;<a name="l00091"></a>00091 <a name="l00092"></a>00092 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c < counterEnd; c++)<a name="l00093"></a>00093 {<a name="l00094"></a>00094 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k=0; k<=n; k++)<a name="l00095"></a>00095 {<a name="l00096"></a>00096 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=g/8-1, carry=<span class="keyword">true</span>; i>=0 && carry; i--)<a name="l00097"></a>00097 carry=!++seed[i];<a name="l00098"></a>00098 <span class="keywordflow">if</span> (!useInputCounterValue || c == counter)<a name="l00099"></a>00099 sha.<a class="code" href="class_hash_transformation.html#f8124c4fca23b74bbdc43660bdae692c" title="use this if your input is in one piece and you don't want to call Update() and Final()...">CalculateDigest</a>(W+(n-k)*<a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a>, seed, g/8);<a name="l00100"></a>00100 }<a name="l00101"></a>00101 <span class="keywordflow">if</span> (!useInputCounterValue || c == counter)<a name="l00102"></a>00102 {<a name="l00103"></a>00103 W[<a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a> - 1 - b/8] |= 0x80;<a name="l00104"></a>00104 X.<a class="code" href="class_integer.html#e91fee9e9873f3412f47e6d647545099">Decode</a>(W + <a class="code" href="class_iterated_hash_with_static_transform.html#86286d03ba76ccdd7bf3007088250859">SHA::DIGESTSIZE</a> - 1 - b/8, L/8);<a name="l00105"></a>00105 p = X-((X % (2*q))-1);<a name="l00106"></a>00106 <a name="l00107"></a>00107 <span class="keywordflow">if</span> (p.<a class="code" href="class_integer.html#0e377d23bde55fc7dc6ea2208c587d19" title="return the i-th bit, i=0 being the least significant bit">GetBit</a>(L-1) && IsPrime(p))<a name="l00108"></a>00108 {<a name="l00109"></a>00109 counter = c;<a name="l00110"></a>00110 <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00111"></a>00111 }<a name="l00112"></a>00112 }<a name="l00113"></a>00113 }<a name="l00114"></a>00114 <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00115"></a>00115 }<a name="l00116"></a>00116 <a name="l00117"></a>00117 NAMESPACE_END<a name="l00118"></a>00118 <a name="l00119"></a>00119 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Jun 1 11:11:20 2007 for Crypto++ by <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>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -