A Robust Low Power Chaos-Based Truly Random Number Generator

This paper presents a low power,truly random number generator （TRNG） based on a simple chaotic map of the Bernoulli shift,which is extended to remain robustness in implementation. The map is realized by switched-current techniques that can fully integrate it in a cryptosystem on a chip. A pipelined architecture post-processed by a simple XOR circuit is used to improve the entropy. The TRNG is fabricated in an HJTC 0.18μm CMOS mixed signal process,and the statistical properties are investigated by measurement results. The power consumption is only 1.42mW and the truly random output bit rate is 10Mbit/s.

Pseudo Random Number Generator Based on Back Propagation Neural Network

Random numbers play an increasingly important role in secure wire and wireless communication. Thus the design quality of random number generator(RNG) is significant in information security. A novel pseudo RNG is proposed for improving the security of network communication. The back propagation neural network(BPNN) is nonlinear, which can be used to improve the traditional RNG. The novel pseudo RNG is based on BPNN techniques. The result of test suites standardized by the U.S shows that the RNG can satisfy the security of communication.

A Hybrid Random Number Generator Using Single Electron Tunneling Junctions and MOS Transistors

This paper proposes a novel single electron random number generator （RNG）. The generator consists of multiple tunneling junctions （MTJ） and a hybrid single electron transistor （SET）/MOS output circuit. It is an oscillator-based RNG. MTJ is used to implement a high-frequency oscillator, which uses the inherent physical randomness in tunneling events of the MTJ to achieve large frequency drift. The hybrid SET and MOS output circuit is used to amplify and buffer the output signal of the MTJ oscillator. The RNG circuit generates high-quality random digital sequences with a simple structure. The operation speed of this circuit is as high as 1GHz. The circuit also has good driven capability and low power dissipation. This novel random number generator is a promising device for future cryptographic systems and communication applications.

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 universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism

A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.

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.

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.

Towards Post-Quantum Cryptography Using Thermal Noise Theory and True Random Numbers Generation

The advent of quantum computers and algorithms challenges the semantic security of symmetric and asymmetric cryptosystems. Thus, the implementation of new cryptographic primitives is essential. They must follow the breakthroughs and properties of quantum calculators which make vulnerable existing cryptosystems. In this paper, we propose a random number generation model based on evaluation of the thermal noise power of the volume elements of an electronic system with a volume of 58.83 cm3. We prove through the sampling of the temperature of each volume element that it is difficult for an attacker to carry out an exploit. In 12 seconds, we generate for 7 volume elements, a stream of randomly generated keys of 187 digits that will be transmitted from source to destination through the properties of quantum cryptography.

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.

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.

Physical generation of random numbers using an asymmetrical Boolean network

Autonomous Boolean networks(ABNs)have been successfully applied to the generation of random number due to their complex nonlinear dynamics and convenient on-chip integration.Most of the ABNs used for random number generators show a symmetric topology,despite their oscillations dependent on the inconsistency of time delays along links.To address this issue,we suggest an asymmetrical autonomous Boolean network(aABN)and show numerically that it provides large amplitude oscillations by using equal time delays along links and the same logical gates.Experimental results show that the chaotic features of aABN are comparable to those of symmetric ABNs despite their being made of fewer nodes.Finally,we put forward a random number generator based on aABN and show that it generates the random numbers passing the NIST test suite at 100 Mbits/s.The unpredictability of the random numbers is analyzed by restarting the random number generator repeatedly.The aABN may replace symmetrical ABNs in many applications using fewer nodes and,in turn,reducing power consumption.

Thermal Noise Random Number Generator Based on LFSR

With the rapid development of cryptography, the strength of security protocols and encryption algorithms consumedly relies on the quality of random number. In many cryptography applications, higher speed is one of the references required. A new security random number generator architecture is presented. Its philosophy architecture is implemented with FPGA, based on the thermal noise and linear feedback shift register(LFSR). The thermal noise initializes LFSRs and is used as the disturbed source of the system to ensure the unpredictability of the produced random number and improve the security strength of the system. Parallel LFSRs can produce the pseudo-random numbers with long period and higher speed. The proposed architecture can meet the requirements of high quality and high speed in cryptography.

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.

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.

An Efficient Image Cipher Based on 2D Scrambled Image and Random Numbers

Security of images plays an import role in communication in current era due to the popularity and high usage ofmultimedia content in the Internet.Image security is described as applying an encryption algorithm over the given plaintext images to produce cipher images that can be transmitted safely over the open channel,the Internet.The problem which plagues these image ciphers is that they are too much time consuming,and that do not meet the dictates of the present times.In this paper,we aim to provide an efficient image cipher.The previous studies employed many constructs like Langton’s Ant,15 puzzle game and Castle in the 2D scrambled image based image ciphers,which had grave implications related to the high execution time of the ciphers.The current study directly made use of the 2D scrambled image to realize the purpose.Moreover,no compromise has been made over the security of the proposed image cipher.Random numbers have been generated by triggering the Intertwining Logistic Chaotic map.The cipher has been subjected to many important validation metrics like key space,information entropy,correlation coefficient,crop attack and lastly time complexity to demonstrate its immunity to the various attacks,and its realworld application.In this paper,our proposed image cipher exhibits an encryption speed of 0.1797 s,which is far better than many of the existing encryption ciphers.

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.

Distribution of the Maximum and Minimum of a Random Number of Bounded Random Variables

We study a new family of random variables that each arise as the distribution of the maximum or minimum of a random number N of i.i.d. random variables X1, X2,…, XN, each distributed as a variable X with support on [0, 1]. The general scheme is first outlined, and several special cases are studied in detail. Wherever appropriate, we find estimates of the parameter θ in the one-parameter family in question.

An Algorithm for Generating Random Numbers with Normal Distribution

A new algorithm is suggested based on the central limit theorem for generating pseudo-random numbers with a specified normal or Gaussian probability density function. The suggested algorithm is very simple but highly accurate, with an efficiency that falls between those of the Box-Muller and von Neumann rejection methods.