📄 rng_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++: rng.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>rng.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// rng.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">#include "rng.h"</span><a name="l00006"></a>00006 <span class="preprocessor">#include "<a class="code" href="fips140_8h.html">fips140.h</a>"</span><a name="l00007"></a>00007 <a name="l00008"></a>00008 <span class="preprocessor">#include <time.h></span><a name="l00009"></a>00009 <span class="preprocessor">#include <math.h></span><a name="l00010"></a>00010 <a name="l00011"></a>00011 NAMESPACE_BEGIN(CryptoPP)<a name="l00012"></a>00012 <a name="l00013"></a>00013 <span class="comment">// linear congruential generator</span><a name="l00014"></a>00014 <span class="comment">// originally by William S. England</span><a name="l00015"></a>00015 <a name="l00016"></a>00016 <span class="comment">// do not use for cryptographic purposes</span><a name="l00017"></a>00017 <a name="l00018"></a>00018 <span class="comment">/*</span><a name="l00019"></a>00019 <span class="comment">** Original_numbers are the original published m and q in the</span><a name="l00020"></a>00020 <span class="comment">** ACM article above. John Burton has furnished numbers for</span><a name="l00021"></a>00021 <span class="comment">** a reportedly better generator. The new numbers are now</span><a name="l00022"></a>00022 <span class="comment">** used in this program by default.</span><a name="l00023"></a>00023 <span class="comment">*/</span><a name="l00024"></a>00024 <a name="l00025"></a>00025 <span class="preprocessor">#ifndef LCRNG_ORIGINAL_NUMBERS</span><a name="l00026"></a>00026 <span class="preprocessor"></span><span class="keyword">const</span> word32 LC_RNG::m=2147483647L;<a name="l00027"></a>00027 <span class="keyword">const</span> word32 LC_RNG::q=44488L;<a name="l00028"></a>00028 <a name="l00029"></a>00029 <span class="keyword">const</span> word16 LC_RNG::a=(<span class="keywordtype">unsigned</span> int)48271L;<a name="l00030"></a>00030 <span class="keyword">const</span> word16 LC_RNG::r=3399;<a name="l00031"></a>00031 <span class="preprocessor">#else</span><a name="l00032"></a>00032 <span class="preprocessor"></span><span class="keyword">const</span> word32 LC_RNG::m=2147483647L;<a name="l00033"></a>00033 <span class="keyword">const</span> word32 LC_RNG::q=127773L;<a name="l00034"></a>00034 <a name="l00035"></a>00035 <span class="keyword">const</span> word16 LC_RNG::a=16807;<a name="l00036"></a>00036 <span class="keyword">const</span> word16 LC_RNG::r=2836;<a name="l00037"></a>00037 <span class="preprocessor">#endif</span><a name="l00038"></a>00038 <span class="preprocessor"></span><a name="l00039"></a><a class="code" href="class_l_c___r_n_g.html#b2f22bacb77dab778008f3301daa3ad6">00039</a> <span class="keywordtype">void</span> <a class="code" href="class_l_c___r_n_g.html#b2f22bacb77dab778008f3301daa3ad6" title="generate random array of bytes">LC_RNG::GenerateBlock</a>(byte *output, <span class="keywordtype">size_t</span> size)<a name="l00040"></a>00040 {<a name="l00041"></a>00041 <span class="keywordflow">while</span> (size--)<a name="l00042"></a>00042 {<a name="l00043"></a>00043 word32 hi = seed/q;<a name="l00044"></a>00044 word32 lo = seed%q;<a name="l00045"></a>00045 <a name="l00046"></a>00046 <span class="keywordtype">long</span> test = a*lo - r*hi;<a name="l00047"></a>00047 <a name="l00048"></a>00048 <span class="keywordflow">if</span> (test > 0)<a name="l00049"></a>00049 seed = test;<a name="l00050"></a>00050 <span class="keywordflow">else</span><a name="l00051"></a>00051 seed = test+ m;<a name="l00052"></a>00052 <a name="l00053"></a>00053 *output++ = (GETBYTE(seed, 0) ^ GETBYTE(seed, 1) ^ GETBYTE(seed, 2) ^ GETBYTE(seed, 3));<a name="l00054"></a>00054 }<a name="l00055"></a>00055 }<a name="l00056"></a>00056 <a name="l00057"></a>00057 <span class="comment">// ********************************************************</span><a name="l00058"></a>00058 <a name="l00059"></a>00059 <span class="preprocessor">#ifndef CRYPTOPP_IMPORTS</span><a name="l00060"></a>00060 <span class="preprocessor"></span><a name="l00061"></a><a class="code" href="class_x917_r_n_g.html#b837988957a82bb9903eeedd4bce1bd5">00061</a> <a class="code" href="class_x917_r_n_g.html#b837988957a82bb9903eeedd4bce1bd5">X917RNG::X917RNG</a>(<a class="code" href="class_block_transformation.html" title="interface for the data processing part of block ciphers">BlockTransformation</a> *c, <span class="keyword">const</span> byte *seed, <span class="keyword">const</span> byte *deterministicTimeVector)<a name="l00062"></a>00062 : cipher(c),<a name="l00063"></a>00063 S(cipher->BlockSize()),<a name="l00064"></a>00064 dtbuf(S),<a name="l00065"></a>00065 randseed(seed, S),<a name="l00066"></a>00066 m_lastBlock(S),<a name="l00067"></a>00067 m_deterministicTimeVector(deterministicTimeVector, deterministicTimeVector ? S : 0)<a name="l00068"></a>00068 {<a name="l00069"></a>00069 <span class="keywordflow">if</span> (!deterministicTimeVector)<a name="l00070"></a>00070 {⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -