Analysis of pseudo-random number generators in QMC-SSE method

In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process.Here,we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion(SSE)algorithm.To quantitatively compare them,we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms.After testing several representative observables of the Heisenberg model in one and two dimensions,we recommend the linear congruential generator as the best choice of PRNG.Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.

Energy distribution and effective components analysis of 2^(n) sequence pseudo-random signal

In order to extract usable harmonics from real 2^(n) sequence pseudo-random data,a technical method is proposed.An equation for predicting the average amplitude of the main frequencies is proposed to guide the choice of signal type for different exploration tasks.By the threshold of the amplitude of the transmitted signal,a set of candidate frequencies are first selected.Then,by operating a spectrum envelope method at these candidate frequencies on received data,effective components in data are extracted.A frequency density calculation method is proposed based on a logical number summation method,to reasonably characterize the frequency density in different frequency bands.By applying this method to real data in Sichuan,China,with signal Type 13,75 effective components are extracted,including both main frequencies and harmonics.The result suggests that the number of effective frequencies in the 2^(n) sequence pseudo-random signal can be increased by extracting usable harmonics,without any additional fieldwork.

Application of pseudo-random frequency domain electromagnetic method in mining areas with strong interferences

Due to the strong electromagnetic interferences and human interference,traditional electromagnetic methods cannot obtain high quality resistivity data of mineral deposits in Chinese mines.The wide field electromagnetic method(WFEM),in which the pseudo-random signal is taken as the transmitter source,can extract high quality resistivity data in areas with sever interference by only measuring the electric field component.We use the WFEM to extract the resistivity information of the Dongguashan mine in southeast China.Compared with the audio magnetotelluric(AMT)method,and the controlled source audio-frequency magnetotelluric(CSAMT) method,the WFEM can obtain data with higher quality and simpler operations.The inversion results indicate that the WFEM can accurately identify the location of the main ore-body,which can be used for deep mine exploration in areas with strong interference.

Pseudo-Random Sequences Generator Based on Discrete Hyperchaotic Systems

We first design a discrete hyperchaotic system via piece-wise linear state feedback. The states of the closed loop system are locally expanding in two directions but absolutely bounded on the whole, which implies hyperchaos. Then, we use three suchlike hyperchaotic systems with different feedback gain matrices to design a pseudo-random sequence generator (PRSG). Through a threshold function, three sub-sequences generated from the output of piecewise linear functions are changed into 0-1 sequences. Then, followed by XOR operation, an unpredictable pseudo-random sequence (PRS) is ultimately obtained. The analysis and simulation results indicate that the PRS, generated with hyperchaotic systems, has desirable statistical features.

Blind parameter estimation of pseudo-random binary code-linear frequency modulation signal based on Duffing oscillator at low SNR

Conventional parameter estimation methods for pseudo-random binary code-linear frequency modulation(PRBC-LFM)signals require prior knowledge,are computationally complex,and exhibit poor performance at low signal-to-noise ratios(SNRs).To overcome these problems,a blind parameter estimation method based on a Duffing oscillator array is proposed.A new relationship formula among the state of the Duffing oscillator,the pseudo-random sequence of the PRBC-LFM signal,and the frequency difference between the PRBC-LFM signal and the periodic driving force signal of the Duffing oscillator is derived,providing the theoretical basis for blind parameter estimation.Methods based on amplitude method,short-time Fourier transform method,and power spectrum entropy method are used to binarize the output of the Duffing oscillator array,and their performance is compared.The pseudo-random sequence is estimated using Duffing oscillator array synchronization,and the carrier frequency parameters are obtained by the relational expressions and characteristics of the difference frequency.Simulation results show that this blind estimation method overcomes limitations in prior knowledge and maintains good parameter estimation performance up to an SNR of-35 dB.

HIERACHICAL STRUCTURES FOR GENERATING PSEUDO-RANDOM SEQUENCES AND ARRAYS

This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequence decimation(sampling). The kernal of the structures is a lower speed linear feedback shift register together with several high speed time-division multiplexers arranged hierarchically. These new structures have much higher speed compared with that of other schemes proposed before.

BIT COMMITMENT USING PSEUDO-RANDOM SYNTHESIZER

This paper presents two practical message commitment schemes: one is suitable for committing many bits, and another is useful for committing any bit-long message. They are provably secure based on pseudo-random synthesizers. In these schemes, the sender may be unbounded to polynomial time and the receiver is bounded. The advantage of these schemes is that the secure parameter may be small.

Pseudo-Random Coding Side-Lobe Suppression Method Based on CLEAN Algorithm

A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar＇s multi-target detection ability.

Adding Pseudo-Random Test Sequence Generator in the Test Simulator for DFT Approach

This paper presents modified version of a realistic test tool suitable to Design For Testability （DFT） and Built-ln Self Test （BIST） environments. A comprehensive tool is developed in the form of a test simulator. The simulator is capable of providing a required goal of test for the Circuit Under Test （CUT）. The simulator uses the approach of fault diagnostics with fault grading procedures to provide the optimum tests. The current version of the simulator embeds features of exhaustive and pseudo-random test generation schemes along with the search solutions of cost effective test goals. The simulator provides facilities of realizing all possible pseudo-random sequence generators with all possible combinations of seeds. The tool is developed on a common Personal Computer （PC） platform and hence no special software is required. Thereby, it is a low cost tool hence economical. The tool is very much suitable for determining realistic test sequences for a targeted goal of testing for any CUT. The developed tool incorporates flexible Graphical User Interface （GUI） procedures and can be operated without any special programming skill. The tool is debugged and tested with the results of many bench mark circuits. Further, this developed tool can be utilized for educational purposes for many courses such as fault-tolerant computing, fault diagnosis, digital electronics, and safe-reliable-testable digital logic designs.

基于伪随机数生成器的标量乘改进算法

标量乘算法是椭圆曲线密码体制中最基本、最耗时的算法,包含点加和倍点两种运算.传统的改进方法通过改造标量表示形式减少非零元位数来降低标量乘中的点加运算次数.为了进一步提高标量乘算法效率,根据标量的生成方式,提出了一种结合伪随机数生成器改进算法.利用斐波那契数列生成器的的循环迭代相加可以将标量乘运算由反复的点加和倍点运算转化为单一的点加运算.实验结果表明,改进算法相比传统的窗口NAF算法能够降低60%以上的运算量.

10 Gbit/s PRBS tester implemented in FPGA

The design of an FPGA（ field programmable gate array） based programmable SONET （synchronous optical network） OC-192 10 Gbit/s PRBS （pseudo-random binary sequence） generator and a bit interleaved polarity 8 （BIP-8） error detector is presented. Implemented in a parallel feedback configuration, this tester features PRBS generation of sequences with bit lengths of 2^7 - 1,2^10- 1,2^15 - 1,2^23 - land 2^31 - 1 for up to 10 Gbit/s applications with a 10 Gbit/s optical transceiver, via the SFI-4 （OC-192 serdes-framer interface）. In the OC-192 frame alignment circuit, a dichotomy search algorithm logic which performs the functions of word alignment and STM-64/OC192 de-frame speeds up the frame sync logic and reduces circuit complexity greatly. The system can be used as a low cost tester to evaluate the performance of OC-192 devices and components, taking the replacement of precious commercial PRBS testers.

Effect of pseudo-random number on the security of quantum key distribution protocol

In the process of quantum key distribution(QKD), the communicating parties need to randomly determine quantum states and measurement bases. To ensure the security of key distribution, we aim to use true random sequences generated by true random number generators as the source of randomness. In practical systems, due to the difficulty of obtaining true random numbers, pseudo-random number generators are used instead. Although the random numbers generated by pseudorandom number generators are statistically random, meeting the requirements of uniform distribution and independence,they rely on an initial seed to generate corresponding pseudo-random sequences. Attackers may predict future elements from the initial elements of the random sequence, posing a security risk to quantum key distribution. This paper analyzes the problems existing in current pseudo-random number generators and proposes corresponding attack methods and applicable scenarios based on the vulnerabilities in the pseudo-random sequence generation process. Under certain conditions, it is possible to obtain the keys of the communicating parties with very low error rates, thus effectively attacking the quantum key system. This paper presents new requirements for the use of random numbers in quantum key systems, which can effectively guide the security evaluation of quantum key distribution protocols.

PERFECT PUNCTURED BINARY SEQUENCE PAIRS

This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-random binary sequences satisfy these conditions. Computer calculation verifies that the pseudo-random binary sequences with length up to N=127 can be easily turned into perfect punctured binary sequence pairs.

Distributed wide field electromagnetic method based on high-order 2^(n) sequence pseudo random signal

To make three-dimensional electromagnetic exploration achievable,the distributed wide field electromagnetic method(WFEM)based on the high-order 2^(n) sequence pseudo-random signal is proposed and realized.In this method,only one set of high-order pseudo-random waveforms,which contains all target frequencies,is needed.Based on high-order sequence pseudo-random signal construction algorithm,the waveform can be customized according to different exploration tasks.And the receivers are independent with each other and dynamically adjust the acquisition parameters according to different requirements.A field test in the deep iron ore of Qihe−Yucheng showed that the distributed WFEM based on high-order pseudo-random signal realizes the high-efficiency acquisition of massive electromagnetic data in quite a short time.Compared with traditional controlled-source electromagnetic methods,the distributed WFEM is much more efficient.Distributed WFEM can be applied to the large scale and high-resolution exploration for deep resources and minerals.

Designing a Secure Round Function Based on Chaos

A round function based on chaos is designed combining Feistel structure’s pseudo-randomness, chaotic system’s parameter sensitivity and image data characteristics. The round function composes of two parts--data transformation based on Feistel(abbreviated as FST) and sampling output based on chaos(abbreviated as SMP). FST bases on Feistel structure and several efficient operations including bitwise xor, permutation and circulating shift. SMP is a chaos based pseudo-random sampling algorithm. It is from theoretical analysis that the round function is a pseudo-random function. The upper bounds of the average maximum differential probability and average maximum linear probability are p^2 and q^2 respectively. Finally, the good pseudo-randomness of the round function is examined with the NIST random test. The design of this round function provides an important cryptographic component for the design of chaotic image encryption algorithm.

A CLASS OF RANDOM NUMBER GENERATORS BASED ON WEYL SEQUENCE

The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a class of random number generators （RNGs） based on Weyl sequence is proposed. The uniformity of those RNGs is proved theoretically. Statistical and numerical computations show the efficiency of the methods.

Adaptive and Dynamic Mobile Phone Data Encryption Method

To enhance the security of user data in the clouds,we present an adaptive and dynamic data encryption method to encrypt user data in the mobile phone before it is uploaded.Firstly,the adopted data encryption algorithm is not static and uniform.For each encryption,this algorithm is adaptively and dynamically selected from the algorithm set in the mobile phone encryption system.From the mobile phone's character,the detail encryption algorithm selection strategy is confirmed based on the user's mobile phone hardware information,personalization information and a pseudo-random number.Secondly,the data is rearranged with a randomly selected start position in the data before being encrypted.The start position's randomness makes the mobile phone data encryption safer.Thirdly,the rearranged data is encrypted by the selected algorithm and generated key.Finally,the analysis shows this method possesses the higher security because the more dynamics and randomness are adaptively added into the encryption process.

动力学系统中连续白噪声的数字仿真

在对有连续高斯白噪声作输入的线性连续动力学系统作数字仿真时，必须慎重选择随机数发生器的统计性质，以使系统得到“忠实”的反映。本文给出了随机数产生器的统计性质和连续随机过程的统计性质之间的关系，指出前者不仅依赖于后者及系统本身，还依赖于数字仿真中所采用的积分方法和积分步长。最后，以Ｅｕｌｅｒ积分和Ｒｕｎｇｅ－ｋｕｔｔａ积分为例，分别给出了相应的公式。

A Self-Adaptive Parallel Encryption Algorithm Based on Discrete 2D-Logistic Map

A self-adaptive parallel encryption algorithm based on discrete 2D-Logistic map is developed according to the position scrambling and diffusion of multi-direction in variable space of spatial chaos. The binary sequences b1b2b3···bn are obtained according to the user key, in which the binary sequence 0 and 1 denote distribution mode of processors and the number of binary sequence n denotes cycle number. Then the pseudorandom 2D matrix is generated by 2D-Logistic map, and adaptive segmentation is applied in image matrix and pseudorandom matrix according to the value and the number of binary sequence. The parallel operation is used among blocks to improve efficiency and meet real-time demand in transmission processes. However, the pixel permutation is applied in partitioned matrix through ergodic matrix generated by pseudo-random matrix-block to decrease the correlation of adjacent pixels. Then the pixel substitution is used for fully diffusing through cipher block chaining mode until n cycles. The proposed algorithm can meet the three requirements of parallel operation in image encryption and the real-time requirement in transmission processes. The security is proved by theoretical analysis and simulation results.

True random coded photon counting Lidar

A true random coded photon counting Lidar system is proposed in this paper,in which a single photon detector acts as the true random sequence signal generator instead of the traditional function generator.Compared with the traditional pseudo-random coded method,the true random coded method not only improves the anti-crosstalk capability of the system,but more importantly,it effectively overcomes the adverse effect of the detector’s dead time on the ranging performance.The experiment results show that the ranging performance of the true random coded method is obviously better than that of the pseudo-random coded method.As a result,a three-dimensional scanning imaging of a model car is completed by the true random coded method.