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 br...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.展开更多
The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k sym...The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.展开更多
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-no...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.展开更多
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 hype...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.展开更多
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 sequen...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.展开更多
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 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.展开更多
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 synthe...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.展开更多
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 cl...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.展开更多
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 tran...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.展开更多
Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network ...Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network security. From a random sequencing viewpoint, both sequences of HC-256 and real DNA data may have intrinsic pseudo-random properties respectively. In a recent decade, many DNA sequencing projects are developed on cells, plants and animals over the world into huge DNA databases. Researchers notice that mammalian genomes encode thousands of large noncoding RNAs (lncRNAs), interact with chromatin regulatory complexes, and are thought to play a role in localizing these complexes to target loci across the genome. It is a challenge target using higher dimensional visualization tools to organize various complex interactive properties as visual maps. The Variant Map System (VMS) as an emerging scheme is systematically proposed in this paper to apply multiple maps that used four Meta symbols as same as DNA or RNA representations. System architecture of key components and core mechanism on the VMS are described. Key modules, equations and their I/O parameters are discussed. Applying the VM System, two sets of real DNA sequences from both sample human (noncoding DNA) and corn (coding DNA) genomes are collected in comparison with pseudo DNA sequences generated by HC-256 to show their intrinsic properties in higher levels of similar relationships among relevant DNA sequences on 2D maps. Sample 2D maps are listed and their characteristics are illustrated under controllable environment. Visual results are briefly analyzed to explore their intrinsic properties on selected genome sequences.展开更多
Source-generated energy in seismic vibrator records high frequency harmonic behavior. Conventional vibrator-earth coupling model was set up on the linear system. Some assumptions in the application of linear theory to...Source-generated energy in seismic vibrator records high frequency harmonic behavior. Conventional vibrator-earth coupling model was set up on the linear system. Some assumptions in the application of linear theory to the vibrator problem play an insignificant role in the overall coupling structure. Obviously, non-linear behaviors can be modeled using a “hard-spring” form of the Duffing equation. Model dedicates that a qualitatively similar harmonic component is present for a broad range of possible mathematical descriptions. After some qualitative analysis about the non-linear system, some conclusion can be drawn. Firstly, The design of the vibrator weight should be abided by two points as followed: In order to avoid decoupling for the vibrator to the earth, the weight should be greater than the peak of the driving force amplitude as to keep the resultant force pointing to the earth’s core. On the other hand, for the limited energy output, the vibrator overweight may damage the system high-frequency ability.Secondly, as the driving force frequency approaching to the ground hard-spring inherent frequency, the energy transmission was found to climb its peak from the system energy absorbed curve. At last, due to the non-linear coupling model system, its load curve would come into unstable frequency range, which might limit the application of the Vibroseis conventional sweeping pattern-linear sweep. A new sweeping pattern was listed: the driving signal was the pseudo-random sequence modulated by a fixed frequency cosine signal satisfying with the exploration precision and absorbing efficiency. The synthesized signal was ready to be realized by the electromagnetic driven system. Even the side-lobes noise of its auto-correlation function was restrained well. The theory coming from the Vibrator-earth coupling model was applied to the design of the Portable High-frequency Vibrator System (PHVS), and the good result was obtained. By the analysis of the vibrator base plate signal, the model was proved to be true. The exploration research on PHVS made a first step on its following optimal design.展开更多
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 sequenc...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.展开更多
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 wit...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.展开更多
Cryptographic properties of the single cycle T-function's output sequences are investigated.Bounds of autocorrelation functions of the kth coordinate sequence and bounds of state output sequence are calculated res...Cryptographic properties of the single cycle T-function's output sequences are investigated.Bounds of autocorrelation functions of the kth coordinate sequence and bounds of state output sequence are calculated respectively.The Maximum Sidelobe Ratio(MSR) of the kth coordinate sequence and the MSR of state output sequence are given respectively.The bounds of autocorrelation functions show that the values of autocorrelation functions are large when shifts are small.Comparisons of the autocorrelations between the state output sequence and coordinate output sequence are illustrated.The autocorrelation properties demonstrate that T-functions have cryptographic weaknesses and the illustration result shows coordinate output sequences have better autocorrelation than that of state output sequences.展开更多
Discrete memristor has become a hotspot since it was proposed recently.However,the design of chaotic maps based on discrete memristor is in its early research stage.In this paper,a memristive seed chaotic map is propo...Discrete memristor has become a hotspot since it was proposed recently.However,the design of chaotic maps based on discrete memristor is in its early research stage.In this paper,a memristive seed chaotic map is proposed by combining a quadratic discrete memristor with the sine function.Furthermore,by applying the chaotification method,we obtain a high-dimensional chaotic map.Numerical analysis shows that it can generate hyperchaos.With the increase of cascade times,the generated map has more positive Lyapunov exponents and larger hyperchaotic range.The National Institute of Standards and Technology(NIST)test results show that the chaotic pseudo-random sequence generated by cascading two seed maps has good unpredictability,and it indicates the potential in practical application.展开更多
A memristive Hopfield neural network(MHNN)with a special activation gradient is proposed by adding a suitable memristor to the Hopfield neural network(HNN)with a special activation gradient.The MHNN is simulated and d...A memristive Hopfield neural network(MHNN)with a special activation gradient is proposed by adding a suitable memristor to the Hopfield neural network(HNN)with a special activation gradient.The MHNN is simulated and dynamically analyzed,and implemented on FPGA.Then,a new pseudo-random number generator(PRNG)based on MHNN is proposed.The post-processing unit of the PRNG is composed of nonlinear post-processor and XOR calculator,which effectively ensures the randomness of PRNG.The experiments in this paper comply with the IEEE 754-1985 high precision32-bit floating point standard and are done on the Vivado design tool using a Xilinx XC7 Z020 CLG400-2 FPGA chip and the Verilog-HDL hardware programming language.The random sequence generated by the PRNG proposed in this paper has passed the NIST SP800-22 test suite and security analysis,proving its randomness and high performance.Finally,an image encryption system based on PRNG is proposed and implemented on FPGA,which proves the value of the image encryption system in the field of data encryption connected to the Internet of Things(Io T).展开更多
A family of binary sequences were constructed by using an elliptic curve and its twisted curves over finite fields. It was shown that these sequences possess "good" cryptographie properties of 0-1 distribution, long...A family of binary sequences were constructed by using an elliptic curve and its twisted curves over finite fields. It was shown that these sequences possess "good" cryptographie properties of 0-1 distribution, long period and large linear complexity. The results indicate that such se quences provide strong potential applications in cryptography.展开更多
A correlation-based digital background calibration algorithm for pipelined Analog-to- Digital Converters (ADCs) is presented in this paper. The merit of the calibration algorithm is that the main errors information, w...A correlation-based digital background calibration algorithm for pipelined Analog-to- Digital Converters (ADCs) is presented in this paper. The merit of the calibration algorithm is that the main errors information, which include the capacitor mismatches and residue amplifier distortion, are extracted integrally. A modified 1st pipelined stage is adopted to solve the signal overflow caused by the Pseudo-random Noise (PN) sequences. Behavioral simulation results verify the effectiveness of the algorithm. It improves the Signal-to-Noise-plus-Distortion Ratio (SNDR) and Spurious-Free-Dynamic-Range (SFDR) of the pipelined ADC from 41.8 dB to 78.3 dB and 55.6 dB to 98.6 dB, respectively, which is comparable to the prior arts.展开更多
Primitive elements play important roles in the Diffie-Hellman protocol for establishment of secret communication keys, in the design of the ElGamal cryptographic system and as generators of pseudo-random numbers. In g...Primitive elements play important roles in the Diffie-Hellman protocol for establishment of secret communication keys, in the design of the ElGamal cryptographic system and as generators of pseudo-random numbers. In general, a deterministic algorithm that searches for primitive elements is currently unknown. In information-hiding schemes, where a primitive element is the key factor, there is the freedom in selection of a modulus. This paper provides a fast deterministic algorithm, which computes every primitive element in modular arithmetic with special moduli. The algorithm requires at most O(log2p) digital operations for computation of a generator. In addition, the accelerated-descend algorithm that computes small generators is described in this paper. Several numeric examples and tables illustrate the algorithms and their properties.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.12274046,11874094,and 12147102)Chongqing Natural Science Foundation(Grant No.CSTB2022NSCQ-JQX0018)Fundamental Research Funds for the Central Universities(Grant No.2021CDJZYJH-003).
文摘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.
基金supported by the National Natural Science Foundation of China under Grant No. 61063041the Program for New Century Excellent Talents of Universities in Fujian Province under Grant No. JK2010047the Funds of the Education Department of Gansu Province under Grant No. 1001-09
文摘The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.
基金the National Natural Science Foundation of China(Grant Nos.61973037 and 61673066).
文摘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.
基金This project was supported by the National Natural Science Foundation of China (69874025).
文摘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.
文摘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.
文摘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.
文摘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.
基金Supported by National Natural Science Foundation of China (19871047)and National Key Basic Research Special Fund(1998020306).
文摘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.
基金the National Natural Science Foundation of China (Grant No. 61601517)basic and advanced technology research project of Henan Province, China (Grant No. 2014302703)
文摘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.
文摘Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network security. From a random sequencing viewpoint, both sequences of HC-256 and real DNA data may have intrinsic pseudo-random properties respectively. In a recent decade, many DNA sequencing projects are developed on cells, plants and animals over the world into huge DNA databases. Researchers notice that mammalian genomes encode thousands of large noncoding RNAs (lncRNAs), interact with chromatin regulatory complexes, and are thought to play a role in localizing these complexes to target loci across the genome. It is a challenge target using higher dimensional visualization tools to organize various complex interactive properties as visual maps. The Variant Map System (VMS) as an emerging scheme is systematically proposed in this paper to apply multiple maps that used four Meta symbols as same as DNA or RNA representations. System architecture of key components and core mechanism on the VMS are described. Key modules, equations and their I/O parameters are discussed. Applying the VM System, two sets of real DNA sequences from both sample human (noncoding DNA) and corn (coding DNA) genomes are collected in comparison with pseudo DNA sequences generated by HC-256 to show their intrinsic properties in higher levels of similar relationships among relevant DNA sequences on 2D maps. Sample 2D maps are listed and their characteristics are illustrated under controllable environment. Visual results are briefly analyzed to explore their intrinsic properties on selected genome sequences.
文摘Source-generated energy in seismic vibrator records high frequency harmonic behavior. Conventional vibrator-earth coupling model was set up on the linear system. Some assumptions in the application of linear theory to the vibrator problem play an insignificant role in the overall coupling structure. Obviously, non-linear behaviors can be modeled using a “hard-spring” form of the Duffing equation. Model dedicates that a qualitatively similar harmonic component is present for a broad range of possible mathematical descriptions. After some qualitative analysis about the non-linear system, some conclusion can be drawn. Firstly, The design of the vibrator weight should be abided by two points as followed: In order to avoid decoupling for the vibrator to the earth, the weight should be greater than the peak of the driving force amplitude as to keep the resultant force pointing to the earth’s core. On the other hand, for the limited energy output, the vibrator overweight may damage the system high-frequency ability.Secondly, as the driving force frequency approaching to the ground hard-spring inherent frequency, the energy transmission was found to climb its peak from the system energy absorbed curve. At last, due to the non-linear coupling model system, its load curve would come into unstable frequency range, which might limit the application of the Vibroseis conventional sweeping pattern-linear sweep. A new sweeping pattern was listed: the driving signal was the pseudo-random sequence modulated by a fixed frequency cosine signal satisfying with the exploration precision and absorbing efficiency. The synthesized signal was ready to be realized by the electromagnetic driven system. Even the side-lobes noise of its auto-correlation function was restrained well. The theory coming from the Vibrator-earth coupling model was applied to the design of the Portable High-frequency Vibrator System (PHVS), and the good result was obtained. By the analysis of the vibrator base plate signal, the model was proved to be true. The exploration research on PHVS made a first step on its following optimal design.
文摘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.
基金This work was supported by the National Natural Science Foundation of China(NSFC)(61805249)the Youth Innovation Promotion Association CAS(2019369).
文摘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.
基金supported by National Natural Science Foundation of China under Grant No.60833008,60970119the Scientific Research Foundation of Education of Department of Shaanxi Provincial Government of China under Grant No.11JK0503+1 种基金Youth Science and Technology Foundation of Xi'an University of Architecture and Technology under Grant No.QN0831,QN1024Foundation of Guangxi Key Laboratory of Information and Communications under Grant No.20902
文摘Cryptographic properties of the single cycle T-function's output sequences are investigated.Bounds of autocorrelation functions of the kth coordinate sequence and bounds of state output sequence are calculated respectively.The Maximum Sidelobe Ratio(MSR) of the kth coordinate sequence and the MSR of state output sequence are given respectively.The bounds of autocorrelation functions show that the values of autocorrelation functions are large when shifts are small.Comparisons of the autocorrelations between the state output sequence and coordinate output sequence are illustrated.The autocorrelation properties demonstrate that T-functions have cryptographic weaknesses and the illustration result shows coordinate output sequences have better autocorrelation than that of state output sequences.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61901530,62071496,and 62061008)
文摘Discrete memristor has become a hotspot since it was proposed recently.However,the design of chaotic maps based on discrete memristor is in its early research stage.In this paper,a memristive seed chaotic map is proposed by combining a quadratic discrete memristor with the sine function.Furthermore,by applying the chaotification method,we obtain a high-dimensional chaotic map.Numerical analysis shows that it can generate hyperchaos.With the increase of cascade times,the generated map has more positive Lyapunov exponents and larger hyperchaotic range.The National Institute of Standards and Technology(NIST)test results show that the chaotic pseudo-random sequence generated by cascading two seed maps has good unpredictability,and it indicates the potential in practical application.
基金supported by the Scientific Research Fund of Hunan Provincial Education Department(Grant No.21B0345)the Postgraduate Scientific Research Innovation Project of Changsha University of Science and Technology(Grant Nos.CX2021SS69 and CX2021SS72)+3 种基金the Postgraduate Scientific Research Innovation Project of Hunan Province,China(Grant No.CX20200884)the Natural Science Foundation of Hunan Province,China(Grant Nos.2019JJ50648,2020JJ4622,and 2020JJ4221)the National Natural Science Foundation of China(Grant No.62172058)the Special Funds for the Construction of Innovative Provinces of Hunan Province,China(Grant Nos.2020JK4046 and 2022SK2007)。
文摘A memristive Hopfield neural network(MHNN)with a special activation gradient is proposed by adding a suitable memristor to the Hopfield neural network(HNN)with a special activation gradient.The MHNN is simulated and dynamically analyzed,and implemented on FPGA.Then,a new pseudo-random number generator(PRNG)based on MHNN is proposed.The post-processing unit of the PRNG is composed of nonlinear post-processor and XOR calculator,which effectively ensures the randomness of PRNG.The experiments in this paper comply with the IEEE 754-1985 high precision32-bit floating point standard and are done on the Vivado design tool using a Xilinx XC7 Z020 CLG400-2 FPGA chip and the Verilog-HDL hardware programming language.The random sequence generated by the PRNG proposed in this paper has passed the NIST SP800-22 test suite and security analysis,proving its randomness and high performance.Finally,an image encryption system based on PRNG is proposed and implemented on FPGA,which proves the value of the image encryption system in the field of data encryption connected to the Internet of Things(Io T).
基金Supported by the National Natural Science Foun-dation of China (60473028) the Natural Science Foundation of FujianProvince (A0540011) +1 种基金the Science and Technology Foundation of Fu-jian Educational Committee (JA04264) the Science and Technolo-gy Foundation of Putian City (2005S04)
文摘A family of binary sequences were constructed by using an elliptic curve and its twisted curves over finite fields. It was shown that these sequences possess "good" cryptographie properties of 0-1 distribution, long period and large linear complexity. The results indicate that such se quences provide strong potential applications in cryptography.
基金Supported by the Doctoral Program Foundation of Institutions of Higher Education of China (No.20120111120008)State Key Lab of ASIC & System(Fudan University) (No. 11KF001)Special Fund for Doctoral Program (Hefei University of Technology) (No.2011HGBZ0953)
文摘A correlation-based digital background calibration algorithm for pipelined Analog-to- Digital Converters (ADCs) is presented in this paper. The merit of the calibration algorithm is that the main errors information, which include the capacitor mismatches and residue amplifier distortion, are extracted integrally. A modified 1st pipelined stage is adopted to solve the signal overflow caused by the Pseudo-random Noise (PN) sequences. Behavioral simulation results verify the effectiveness of the algorithm. It improves the Signal-to-Noise-plus-Distortion Ratio (SNDR) and Spurious-Free-Dynamic-Range (SFDR) of the pipelined ADC from 41.8 dB to 78.3 dB and 55.6 dB to 98.6 dB, respectively, which is comparable to the prior arts.
文摘Primitive elements play important roles in the Diffie-Hellman protocol for establishment of secret communication keys, in the design of the ElGamal cryptographic system and as generators of pseudo-random numbers. In general, a deterministic algorithm that searches for primitive elements is currently unknown. In information-hiding schemes, where a primitive element is the key factor, there is the freedom in selection of a modulus. This paper provides a fast deterministic algorithm, which computes every primitive element in modular arithmetic with special moduli. The algorithm requires at most O(log2p) digital operations for computation of a generator. In addition, the accelerated-descend algorithm that computes small generators is described in this paper. Several numeric examples and tables illustrate the algorithms and their properties.