We experimentally demonstrate fast physical random bit generation from bandwidth-enhanced chaos by using three-cascaded semiconductor lasers. The bandwidth-enhanced chaos is obtained with the standard bandwidth of 35.2 GHz, the effective bandwidth of 26.0 GHz and the flatness of 5.6 dB, whose waveform is used for random bit generation. Two schemes of single-bit and multi-bit extraction methods for random bit generation are carried out to evaluate the entropy rate and the maximum random bit generation rate. For single-bit generation, the generation rate at 20 Gb/s is obtained for physical random bit sequences. For multi-bit generation, the maximum generation rate at 1.2 Tb/s ( = 100 GS/s × 6 bits × 2 data) is equivalently achieved for physical random bit sequences whose randomness is verified by using both NIST Special Publication 800-22 and TestU01.
Random number generators are essential for applications in information security and numerical simulations. Most optical-chaos-based random number generators produce random bit sequences by offline post-processing with large optical components. We demonstrate a real-time hardware implementation of a fast physical random number generator with a photonic integrated circuit and a field programmable gate array (FPGA) electronic board. We generate 1-Tbit random bit sequences and evaluate their statistical randomness using NIST Special Publication 800-22 and TestU01. All of the BigCrush tests in TestU01 are passed using 410-Gbit random bit sequences. A maximum real-time generation rate of 21.1 Gb/s is achieved for random bit sequences in binary format stored in a computer, which can be directly used for applications involving secret keys in cryptography and random seeds in large-scale numerical simulations.
We demonstrate physical implementation of information-theoretic secure oblivious transfer based on bounded observability using optical correlated randomness in semiconductor lasers driven by common random light broadcast over optical fibers. We demonstrate that the scheme can achieve one-out-oftwo oblivious transfer with effective key generation rate of 110 kb/s. The results show that this scheme is a promising approach to achieve information-theoretic secure oblivious transfer over long distances for future applications of secure computation such as privacy-preserving database mining, auctions and electronic-voting.With the rapid evolution of big data and cloud computing systems there is increasing interest in practical schemes for secure operations on information on large scales. One example is secure computation which would allow computation of functions over data without revealing the data [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15] . Practical large scale implementations of secure computation are needed to realize applications such as private information retrieval, privacy preserving database mining, auctions, and electronic voting systems.A key component for secure computation is oblivious transfer. Oblivious transfer is message transfer in which a sender sends encoded messages in such a way that the receiver can only decode some of the messages and the sender does not know which messages were decoded. The original notion of oblivious transfer using an erasure channel was given by Rabin 16 . Later, one-out-of-two oblivious transfer was considered by Even et al. 17 . Naor and Pinkas 18, 19 gave an oblivious transfer protocol based on the Diffie-Hellman assumption, where the protocol relies on computational complexity. It has been known that the Naor-Pinkas protocol is time-consuming, and large amount of computation is required. The oblivious transfer extension technique of Ishai et al. 20 and follow up work has been aimed at achieving faster and more efficient oblivious transfer.Various schemes for oblivious transfer based on information-theoretic security have also been proposed. Information-theoretic oblivious transfer can be secure with respect to adversaries that are computationally unbounded. Moreover, information-theoretic oblivious transfer can be future proof in the sense that secrets will not be revealed by future advances in computational power. Information-theoretic schemes are based on the idea of distilling a secret bit, or string of secret bits, from a statistical advantage in correlation of bits acquired from a probabilistic system. Different models can be distinguished based on specific features of the probabilistic model of the system. Following the original notion of the erasure channel 16 , there have been schemes proposed based on noisy channels [21][22][23][24] , bounded storage 25 , wireless communication systems 26 , quantum mechanical systems [27][28][29][30] , and network behaviors 31,32 . In the noisy channel model, users observe a random sequence from a common source (such...
We propose the bias of the probability of correspondence between a random bit sequence and its delayed bit sequence to evaluate correlation of random bits generated from chaotic semiconductor lasers.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.