THE EXISTENCE AND MOMENTS OF CANONICAL BRANCHING CHAIN IN RANDOM ENVIRONMENT

The concepts of branching chain in random environmnet and canonical branching chain in random environment are introduced. Moreover the existence of these chains is proved. Finally the exact formulas of mathematical expectation and variance of branching chain in random environment are also given.

Post-processing Free Quantum Random Number Generator Based on Avalanche Photodiode Array

Quantum random number generators adopting single negligible dead time of avalanche photodiodes （APDs） photon detection have been restricted due to the non- We propose a new approach based on an APD array to improve the generation rate of random numbers significantly. This method compares the detectors＇ responses to consecutive optical pulses and generates the random sequence. We implement a demonstration experiment to show its simplicity, compactness and scalability. The generated numbers are proved to be unbiased, post-processing free, ready to use, and their randomness is verified by using the national institute of standard technology statistical test suite. The random bit generation efficiency is as high as 32.8% and the potential generation rate adopting the 32× 32 APD array is up to tens of Gbits/s.

RECURRENCE FOR THE GENERALIZED BIRTH-DEATH CHAINS IN A RANDOM ENVIRONMENT

This is a study of one dimensional generalized birth-death chains in a random environment (GBDIRE). We give two sufficient conditions of recurrence for GBDIRE.

THE CONSTRUCTION OF MULTITYPE CANONICAL MARKOV BRANCHING CHAINS IN RANDOM ENVIRONMENTS

The investigation for branching processes has a long history by their strong physics background, but only a few authors have investigated the branching processes in random environments. First of all, the author introduces the concepts of the multitype canonical Markov branching chain in random environment （CMBCRE） and multitype Markov branching chain in random environment （MBCRE） and proved that CMBCRE must be MBCRE, and any MBCRE must be equivalent to another CMBCRE in distribution. The main results of this article are the construction of CMBCRE and some of its probability properties.

Parametric characteristic of the random vibration response of nonlinear systems

Volterra series is a powerful mathematical tool for nonlinear system analysis,and there is a wide range of nonlinear engineering systems and structures that can be represented by a Volterra series model.In the present study,the random vibration of nonlinear systems is investigated using Volterra series.Analytical expressions were derived for the calculation of the output power spectral density（PSD） and input-output cross-PSD for nonlinear systems subjected to Gaussian excitation.Based on these expressions,it was revealed that both the output PSD and the input-output crossPSD can be expressed as polynomial functions of the nonlinear characteristic parameters or the input intensity.Numerical studies were carried out to verify the theoretical analysis result and to demonstrate the effectiveness of the derived relationship.The results reached in this study are of significance to the analysis and design of the nonlinear engineering systems and structures which can be represented by a Volterra series model.

Biased Random Number Generator Based on Bell's Theorem

We propose a biased random number generation protocol whose randomness is based on the violation of the Clauser Home inequality. Non-maximally entangled state is used to maximize the Bell violation. Due to the rotational asymmetry of the quantum state, the ratio of Os to ls varies with the measurement bases. The experimental partners can then use their measurement outcomes to generate the biased random bit string. The bias of their bit string can be adjusted by altering their choices of measurement bases. When this protocol is implemented in a device-independent way, we show that the bias of the bit string can still be ensured under the collective attack.

Parameter analysis of chaotic superlattice true random number source

Superlattices in chaotic state can be used as a key part of a true random number generator. The chaotic characteristics of the signal generated in the superlattice are mostly affected by the parameters of the superlattice and the applied voltage, while the latter is easier to adjust. In this paper, the model of the superlattice is first established. Then, based on this model, the chaotic characteristics of the generated signal are studied under different voltages. The results demonstrate that the onset of chaos in the superlattice is typically accompanied by the mergence of multistability, and there are voltage intervals in each of which the generated signal is chaotic.

Image encryption using random sequence generated from generalized information domain

A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security.

Design of Hybrid True Random Number Generator for Cryptographic Applications

In real-time applications,unpredictable random numbers play a major role in providing cryptographic and encryption processes.Most of the existing random number generators are embedded with the complex nature of an amplifier,ring oscillators,or comparators.Hence,this research focused more on implementing a Hybrid Nature of a New Random Number Generator.The key objective of the proposed methodology relies on the utilization of True random number generators.The randomness is unpredictable.The additions of programmable delay lines will reduce the processing time and maintain the quality of randomizing.The performance comparisons are carried out with power,delay,and lookup table.The proposed architecture was executed and verified using Xilinx.The Hybrid TRNG is evaluated under simulation and the obtained results outperform the results of the conventional random generators based on Slices,area and Lookup Tables.The experimental observations show that the proposed Hybrid True Random Number Generator(HTRNG)offers high operating speed and low power consumption.

A hybrid-type quantum random number generator

This paper proposes a well-performing hybrid-type truly quantum random number generator based on the time interval between two independent single-photon detection signals, which is practical and intuitive, and generates the initial random number sources from a combination of multiple existing random number sources. A time-to-amplitude converter and multichannel analyzer are used for qualitative analysis to demonstrate that each and every step is random. Furthermore, a carefully designed data acquisition system is used to obtain a high-quality random sequence. Our scheme is simple and proves that the random number bit rate can be dramatically increased to satisfy practical requirements.

THE BRANCHING CHAIN WITH DRIFT IN SPACE-TIME RANDOM ENVIRONMENT(I):MODEL,MARKOV PROPERTY,MOMENTS

There are three parts in this article. In Section 1, we establish the model of branching chain with drift in space-time random environment （BCDSTRE）, i.e., the coupling of branching chain and random walk. In Section 2, we prove that any BCDSTRE must be a Markov chain in time random environment when we consider the distribution of the particles in space as a random element. In Section 3, we calculate the first-order moments and the second-order moments of BCDSTRE.

Phase-Coding Self-Testing Quantum Random Number Generator

How to estimate the randomness of the measurement outcomes generated by a given device is an important issue in quantum information theory. Recently, Brunner et al. [Phys. Rev. Lett. 112 （2014）140407] proposed a prepare-and-measure quantum random number generation scenario with device-independent assumption, which indicates a method to test the randomness of bit strings according to the generation process rather than the results. Based on this protocol, we implement a quantum random number generator with an intrinsic stable phase-encoded quantum key distribution system. The system has been continuously running for more than 200 h, a stable witness W with the average value of 0.9752 and a standard deviation of 0.0024 are obtained. More than 1 G random bits are generated and the results pass all items of NIST test suite.

True Random Number Generator Realized by Extracting Entropy from a Negative-Inductance Superconducting Quantum Interference Device

A new type of superconductive true random number generator (TRNG) based on a negative-inductance superconducting quantum interference device (nSQUID) is proposed. The entropy harnessed to generate random numbers comes from the phenomenon of symmetry breaking in the nSQUID. The experimental circuit is fabricated by the Nb-based lift-off process. Low-temperature tests of the circuit verify the basic function of the proposed TRNG. The frequency characteristics of the TRNG have been analyzed by simulation. The generation rate of random numbers is expected to achieve hundreds of megahertz to tens of gigahertz.

Ensuring Quality of Random Numbers from TRNG: Design and Evaluation of Post-Processing Using Genetic Algorithm

Random numbers generated by pseudo-random and true random number generators (TRNG) are used in a wide variety of important applications. A TRNG relies on a non-deterministic source to sample random numbers. In this paper, we improve the post-processing stage of TRNGs using a heuristic evolutionary algorithm. Our post-processing algorithm decomposes the problem of improving the quality of random numbers into two phases: (i) Exact Histogram Equalization: it modifies the random numbers distribution with a specified output distribution;(ii) Stationarity Enforcement: using genetic algorithms, the output of (ii) is permuted until the random numbers meet wide-sense stationarity. We ensure that the quality of the numbers generated from the genetic algorithm is within a specified level of error defined by the user. We parallelize the genetic algorithm for improved performance. The post-processing is based on the power spectral density of the generated numbers used as a metric. We propose guideline parameters for the evolutionary algorithm to ensure fast convergence, within the first 100 generations, with a standard deviation over the specified quality level of less than 0.45. We also include a TestU01 evaluation over the random numbers generated.

Generalized Master Equation for Space-Time Coupled Continuous Time Random Walk

The generalized master equation for the space-time coupled continuous time random walk is derived analytically, in which the space-time coupling is considered through the correlated function 9（t） ～ t^γ, 0 ≤ γ 〈 2, and the probability density function ω（t） of a particle＇s waiting time t follows a power law form for large t： ω（t） ～t^-（1＋α）, 0 〈 α 〈 1. The results indicate that the expressions of the generalized master equation are determined by the correlation exponent 7 and the long-tailed index α of the waiting time. Moreover, the diffusion results obtained from the generalized master equation are in accordance with the previous known results and the numerical simulation results.

A high-speed true random number generator based on Ag/SiNx/n-Si memristor

The intrinsic variability of memristor switching behavior can be used as a natural source of randomness,this variability is valuable for safe applications in hardware,such as the true random number generator(TRNG).However,the speed of TRNG is still be further improved.Here,we propose a reliable Ag/SiNx/n-Si volatile memristor,which exhibits a typical threshold switching device with stable repeat ability and fast switching speed.This volatile-memristor-based TRNG is combined with nonlinear feedback shift register(NFSR)to form a new type of high-speed dual output TRNG.Interestingly,the bit generation rate reaches a high speed of 112 kb/s.In addition,this new TRNG passed all 15 National Institute of Standards and Technology(NIST)randomness tests without post-processing steps,proving its performance as a hardware security application.This work shows that the SiNx-based volatile memristor can realize TRNG and has great potential in hardware network security.

Navigating the Quantum Threat Landscape: Addressing Classical Cybersecurity Challenges

This research paper analyzes the urgent topic of quantum cybersecurity and the current federal quantum-cyber landscape. Quantum-safe implementations within existing and future Internet of Things infrastructure are discussed, along with quantum vulnerabilities in public key infrastructure and symmetric cryptographic algorithms. Other relevant non-encryption-specific areas within cybersecurity are similarly raised. The evolution and expansion of cyberwarfare as well as new developments in cyber defense beyond post-quantum cryptography and quantum key distribution are subsequently explored, with an emphasis on public and private sector awareness and vigilance in maintaining strong security posture.

Low Area PRESENT Cryptography in FPGA Using TRNG-PRNG Key Generation

Lightweight Cryptography(LWC)is widely used to provide integrity,secrecy and authentication for the sensitive applications.However,the LWC is vulnerable to various constraints such as high-power consumption,time consumption,and hardware utilization and susceptible to the malicious attackers.In order to overcome this,a lightweight block cipher namely PRESENT architecture is proposed to provide the security against malicious attacks.The True Random Number Generator-Pseudo Random Number Generator(TRNG-PRNG)based key generation is proposed to generate the unpredictable keys,being highly difficult to predict by the hackers.Moreover,the hardware utilization of PRESENT architecture is optimized using the Dual port Read Only Memory(DROM).The proposed PRESENT-TRNGPRNG architecture supports the 64-bit input with 80-bit of key value.The performance of the PRESENT-TRNG-PRNG architecture is evaluated by means of number of slice registers,flip flops,number of slices Look Up Table(LUT),number of logical elements,slices,bonded input/output block(IOB),frequency,power and delay.The input retrieval performances analyzed in this PRESENT-TRNG-PRNG architecture are Peak Signal to Noise Ratio(PSNR),Structural Similarity Index(SSIM)and Mean-Square Error(MSE).The PRESENT-TRNG-PRNG architecture is compared with three different existing PRESENT architectures such as PRESENT On-TheFly(PERSENT-OTF),PRESENT Self-Test Structure(PRESENT-STS)and PRESENT-Round Keys(PRESENT-RK).The operating frequency of the PRESENT-TRNG-PRNG is 612.208 MHz for Virtex 5,which is high as compared to the PRESENT-RK.

A voltage-controlled chaotic oscillator based on carbon nanotube field-effect transistor for low-power embedded systems

This paper presents a compact and low-power-based discrete-time chaotic oscillator based on a carbon nanotube field-effect transistor implemented using Wong and Deng＇s well-known model. The chaotic circuit is composed of a nonlinear circuit that creates an adjustable chaos map, two sample and hold cells for capture and delay functions, and a voltage shifter that works as a buffer and adjusts the output voltage for feedback. The operation of the chaotic circuit is verified with the SPICE software package, which uses a supply voltage of 0.9 V at a frequency of 20 kHz. The time series, frequency spectra, transitions in phase space, sensitivity with the initial condition diagrams, and bifurcation phenomena are presented. The main advantage of this circuit is that its chaotic signal can be generated while dissipating approximately 7.8 μW of power, making it suitable for embedded systems where many chaos-signal generators are required on a single chip.

Construction and Optimization of TRNG Based Substitution Boxes for Block Encryption Algorithms

Internet of Things is an ecosystem of interconnected devices that are accessible through the internet.The recent research focuses on adding more smartness and intelligence to these edge devices.This makes them susceptible to various kinds of security threats.These edge devices rely on cryptographic techniques to encrypt the pre-processed data collected from the sensors deployed in the field.In this regard,block cipher has been one of the most reliable options through which data security is accomplished.The strength of block encryption algorithms against different attacks is dependent on its nonlinear primitive which is called Substitution Boxes.For the design of S-boxes mainly algebraic and chaos-based techniques are used but researchers also found various weaknesses in these techniques.On the other side,literature endorse the true random numbers for information security due to the reason that,true random numbers are purely non-deterministic.In this paper firstly a natural dynamical phenomenon is utilized for the generation of true random numbers based S-boxes.Secondly,a systematic literature review was conducted to know which metaheuristic optimization technique is highly adopted in the current decade for the optimization of S-boxes.Based on the outcome of Systematic Literature Review(SLR),genetic algorithm is chosen for the optimization of s-boxes.The results of our method validate that the proposed dynamic S-boxes are effective for the block ciphers.Moreover,our results showed that the proposed substitution boxes achieve better cryptographic strength as compared with state-of-the-art techniques.