An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response.
Ontology highlight
ABSTRACT:
SUBMITTER: Stipcevic M
PROVIDER: S-EPMC4460820 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.
| S-EPMC4740897 | biostudies-literature
Project description:Quantum random numbers distinguish themselves from others by their intrinsic unpredictability arising from the principles of quantum mechanics. As such they are extremely useful in many scientific and real-world applications with considerable efforts going into their realizations. Most demonstrations focus on high asymptotic generation rates. For this goal, a large number of repeated trials are required to accumulate a significant store of certifiable randomness, resulting in a high latency between the initial request and the delivery of the requested random bits. Here we demonstrate low-latency real-time certifiable randomness generation from measurements on photonic time-bin states. For this, we develop methods to certify randomness taking into account adversarial imperfections in both the state preparation and the measurement apparatus. Every 0.12 s we generate a block of 8192 random bits which are certifiable against all quantum adversaries with an error bounded by 2-64. Our quantum random number generator is thus well suited for realizing a continuously-operating, high-security and high-speed quantum randomness beacon.
| S-EPMC7904850 | biostudies-literature
Project description:Quantum random number generators promise perfectly unpredictable random numbers. A popular approach to quantum random number generation is homodyne measurements of the vacuum state, the ground state of the electro-magnetic field. Here we experimentally implement such a quantum random number generator, and derive a security proof that considers quantum side-information instead of classical side-information only. Based on the assumptions of Gaussianity and stationarity of noise processes, our security analysis furthermore includes correlations between consecutive measurement outcomes due to finite detection bandwidth, as well as analog-to-digital converter imperfections. We characterize our experimental realization by bounding measured parameters of the stochastic model determining the min-entropy of the system's measurement outcomes, and we demonstrate a real-time generation rate of 2.9 Gbit/s. Our generator follows a trusted, device-dependent, approach. By treating side-information quantum mechanically an important restriction on adversaries is removed, which usually was reserved to semi-device-independent and device-independent schemes.
| S-EPMC7840728 | biostudies-literature
Project description:Random numbers are commonly used in many different fields, ranging from simulations in fundamental science to security applications. In some critical cases, as Bell's tests and cryptography, the random numbers are required to be both private and to be provided at an ultra-fast rate. However, practical generators are usually considered trusted, but their security can be compromised in case of imperfections or malicious external actions. In this work we introduce an efficient protocol which guarantees security and speed in the generation. We propose a source-device-independent protocol based on generic Positive Operator Valued Measurements and then we specialize the result to heterodyne measurements. Furthermore, we experimentally implemented the protocol, reaching a secure generation rate of 17.42 Gbit/s, without the need of an initial source of randomness. The security of the protocol has been proven for general attacks in the finite key scenario.
| S-EPMC6299089 | biostudies-other
Project description:Laser-based light detection and ranging (LiDAR) is key to many applications in science and industry. For many use cases, compactness and power efficiency are key, especially in high-volume applications such as industrial sensing, navigation of autonomous objects, or digitization of 3D scenes using hand-held devices. In this context, comb-based ranging systems are of particular interest, combining high accuracy with high measurement speed. However, the technical complexity of miniaturized comb sources is still prohibitive for many applications, in particular when high optical output powers and high efficiency are required. Here we show that quantum-dash mode-locked laser diodes (QD-MLLD) offer a particularly attractive route towards high-performance chip-scale ranging systems. QD-MLLDs are compact, can be easily operated by a simple DC drive current, and provide spectrally flat frequency combs with bandwidths in excess of 2 THz, thus lending themselves to coherent dual-comb ranging. In our experiments, we show measurement rates of up to 500 MHz-the highest rate demonstrated with any ranging system so far. We attain reliable measurement results with optical return powers of only - 40 dBm, corresponding to a total loss of 49 dB in the ranging path, which corresponds to the highest loss tolerance demonstrated so far for dual-comb ranging with chip-scale comb sources. Combing QD-MLLDs with advanced silicon photonic receivers offers an attractive route towards robust and technically simple chip-scale LiDAR systems.
| S-EPMC8776879 | biostudies-literature
Project description:The intrinsic stochasticity of the memristor can be used to generate true random numbers, essential for non-decryptable hardware-based security devices. Here, we propose a novel and advanced method to generate true random numbers utilizing the stochastic oscillation behavior of a NbOx mott memristor, exhibiting self-clocking, fast and variation tolerant characteristics. The random number generation rate of the device can be at least 40 kb s-1, which is the fastest record compared with previous volatile memristor-based TRNG devices. Also, its dimensionless operating principle provides high tolerance against both ambient temperature variation and device-to-device variation, enabling robust security hardware applicable in harsh environments.
| S-EPMC8131590 | biostudies-literature
Project description:The future security of Internet of Things is a key concern in the cyber-security field. One of the key issues is the ability to generate random numbers with strict power and area constrains. "True Random Number Generators" have been presented as a potential solution to this problem but improvements in output bit rate, power consumption, and design complexity must be made. In this work we present a novel and experimentally verified "True Random Number Generator" that uses exclusively conventional CMOS technology as well as offering key improvements over previous designs in complexity, output bitrate, and power consumption. It uses the inherent randomness of telegraph noise in the channel current of a single CMOS transistor as an entropy source. For the first time multi-level and abnormal telegraph noise can be utilised, which greatly reduces device selectivity and offers much greater bitrates. The design is verified using a breadboard and FPGA proof of concept circuit and passes all 15 of the NIST randomness tests without any need for post-processing of the generated bitstream. The design also shows resilience against machine learning attacks performed by the LSTM neural network.
| S-EPMC7560754 | biostudies-literature
Project description:The volume of securely encrypted data transmission increases continuously in modern society with all things connected. Towards this end, true random numbers generated from physical sources are highly required for guaranteeing security of encryption and decryption schemes for exchanging sensitive information. However, majority of true random number generators (TRNGs) are mechanically rigid, and thus cannot be compatibly integrated with some specific flexible platforms. Herein, we present a flexible and stretchable bionic TRNG inspired by the uniqueness and randomness of biological architectures. The flexible TRNG film is molded from the surface microstructures of natural plants (e.g., ginkgo leaf) via a simple, low-cost, and environmentally friendly manufacturing process. In our proof-of-principle experiment, the TRNG exhibits a fast generation speed of up to 1.04 Gbit/s, in which random numbers are fully extracted from laser speckle patterns with a high extraction rate of 72%. Significantly, the resulting random bit streams successfully pass all randomness test suites including NIST, TestU01, and DIEHARDER. Even after 10,000 times cyclic stretching or bending tests, or during temperature shock (-25-80 °C), the bionic TRNG still reveals robust mechanical reliability and thermal stability. Such a flexible TRNG shows a promising potential in information security of emerging flexible networked electronics.Electronic supplementary materialSupplementary material (light path diagram of transmitted laser speckle, pseudo random pattern, statistical distribution of bionic microstructures, haze of the bionic TRNG film, multi-layer circular laser intensity pattern, percentage of bit 0/1 for different hashed images, Pearson correlation coefficient between 100 different speckle images, the whole process of randomness extraction, SEM images of the flexible TRNG film after 10,000 times stretching and bending, continuous work stability of the TRNG at low or high temperature, light path diagram of reflective laser speckle, and detailed randomness test results of NIST, TestU01, and DIEHARDER) is available in the online version of this article at 10.1007/s12274-022-4109-9.
| S-EPMC8902273 | biostudies-literature
Project description:Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary behaviors, such as parameter configuration in machine learning, gaming, cryptography, and simulation. A PRNG is commonly validated through a statistical test suite, such as NIST SP 800-22rev1a (NIST test suite), to evaluate its robustness and the randomness of the numbers. In this paper, we propose a Wasserstein distance-based generative adversarial network (WGAN) approach to generating PRNGs that fully satisfy the NIST test suite. In this approach, the existing Mersenne Twister (MT) PRNG is learned without implementing any mathematical programming code. We remove the dropout layers from the conventional WGAN network to learn random numbers distributed in the entire feature space because the nearly infinite amount of data can suppress the overfitting problems that occur without dropout layers. We conduct experimental studies to evaluate our learned pseudo-random number generator (LPRNG) by adopting cosine-function-based numbers with poor random number properties according to the NIST test suite as seed numbers. The experimental results show that our LPRNG successfully converted the sequence of seed numbers to random numbers that fully satisfy the NIST test suite. This study opens the way for the "democratization" of PRNGs through the end-to-end learning of conventional PRNGs, which means that PRNGs can be generated without deep mathematical know-how. Such tailor-made PRNGs will effectively enhance the unpredictability and nonarbitrariness of a wide range of information systems, even if the seed numbers can be revealed by reverse engineering. The experimental results also show that overfitting was observed after about 450,000 trials of learning, suggesting that there is an upper limit to the number of learning counts for a fixed-size neural network, even when learning with unlimited data.
| S-EPMC10266608 | biostudies-literature
Project description:We design a cryptographic transistor (cryptoristor)-based true random number generator (tRNG) with low power consumption and small footprint. This is the first attempt to use irregular and unpredictable operation-induced randomness of a cryptoristor as an entropy source. To extract discrete random numbers with a binary code from the cryptoristor, we developed a noise-coupling analog-to-digital converter. This converter not only converts analog signals to digital random bits but also improves the randomness of the entropy source with low power consumption. The randomness of the cryptoristor is attributed to the random carrier multiplications with the creation and stochastic carrier escape as destruction, which occurs iteratively as long as the input current is fed. The cryptoristor-based tRNG passed 15 randomness test suites of NIST Special Publication 800-22. It is robust to iterative operational stresses and to ambient temperature changes, making it an attractive option for hardware-based security solutions in the Internet of Things due to its low power consumption and small size.
| S-EPMC10889348 | biostudies-literature