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.

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.

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.

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.

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.

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.

Random-injection-based two-channel chaos with enhanced bandwidth and suppressed time-delay signature by mutually coupled lasers: Proposal and numerical analysis

Simultaneous bandwidth(BW) enhancement and time-delay signature(TDS) suppression of chaotic lasing over a wide range of parameters by mutually coupled semiconductor lasers(MCSLs) with random optical injection are proposed and numerically investigated. The influences of system parameters on TDS suppression(characterized by autocorrelation function(ACF) and permutation entropy(PE) around characteristic time) and chaos BW are investigated. The results show that, with the increasing bias current, the ranges of parameters(detuning and injection strength) for the larger BW(> 20 GHz) are broadened considerably, while the parameter range for optimized TDS(< 0.1) is not shrunk obviously.Under optimized parameters, the system can simultaneously achieve two chaos outputs with enhanced BW(> 20 GHz)and perfect TDS suppression. In addition, the system can generate two-channel high-speed truly physical random number sequences at 200 Gbits/s for each channel.

Modelling of the behavior of marine oil spills: applications based on random walk techniques

A numerical model has been developed to simulate the transport and fate of oil spilled at sea. The model combines the transport and fate processes of spilled oil with the random walk technique. Oil movement under the influence of tidal currents, wind driven currents, and turbulent eddies is simulated by the PLUME RW dispersion model developed by HR Wallingford. The weathering processes in the model represent physical and chemical changes of soil slicks with time, and comprise mechanical spreading, dispersion, evaporation and emulsification. Shoreline stranding is determined approximately using a capacity method for different shoreline types. This paper presents details of the model, and describe the results of various sensitivity tests. The model is suitable for oil spill contingency planning.

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.

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.

Improved quantum randomness amplification with finite number of untrusted devices based on a novel extractor

Quantum randomness amplification protocols have increasingly attracted attention tbr their tantastic ability to ampllI~, weak randomness to almost ideal randomness by utilizing quantum systems. Recently, a realistic noise-tolerant randomness amplification protocol using a finite number of untrusted devices was proposed. The protocol has the composable security against non-signalling eavesdroppers and could produce a single bit of randomness from weak randomness sources, which is certified by the violation of certain Bell inequalities. However, the protocol has a non-ignorable limitation on the min- entropy of independent sources. In this paper, we further develop the randomness amplification method and present a novel quantum randomness amplification protocol based on an explicit non-malleable two independent-source randomness extractor, which could remarkably reduce the above-mentioned specific limitation. Moreover, the composable security of our improved protocol is also proposed. Our results could significantly expand the application range for practical quantum randomness amplification, and provide a new insight on the practical design method for randomness extraction.

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.

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.

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.

Equilibrium Arrivals to Preemptive Queueing System with Fixed and Random Population Size

A single-server queueing system with preemptive access is considered.Each customer has one attempt to enter the system at its working interval[0,T].As soon as the customer request enters the system,the server immediately starts the service.But when the next request arrives in the system,the previous one leaves the system even he has not finished his service yet.We study a non-cooperative game in which the customers wish to maximize their probability of obtaining service within a certain period of time.We characterize the Nash equilibrium and the price of anarchy,which is defined as the ratio between the optimal and equilibrium social utility.Two models are considered.In the first model the number of players is fixed,while in the second it is random and obeys the Poisson distribution.We demonstrate that there exists a unique symmetric equilibrium for both models.Finally,we calculate the price of anarchy for both models and show that the price of anarchy is not monotone with respect to the number of customers.

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.