There are many applications to random sequences of bits, such as in computer science and cryptography.In this paper, we propose a low-complexity technique for generating sequences of correlated or uncorrelated bits.This technique allows the generation of different pairs of bits with the same correlation, as also controls if the bits are equiprobable on {0, 1} or not.Additionally, we derived an expression and a numerical approximation to the performance of a binary symmetric channel obtained from the binary expansion of transformed Gaussian correlated random variables, which is related to a recently proposed scheme for quantum key distribution with continuous variables.Simulation of this binary symmetric channel agrees with the obtained expression and numerical approximation.
There are many applications to random sequences of bits, such as in computer science and cryptography.In this paper, we propose a low-complexity technique for generating sequences of correlated or uncorrelated bits.This technique allows the generation of different pairs of bits with the same correlation, as also controls if the bits are equiprobable on {0, 1} or not.Additionally, we derived an expression and a numerical approximation to the performance of a binary symmetric channel obtained from the binary expansion of transformed Gaussian correlated random variables, which is related to a recently proposed scheme for quantum key distribution with continuous variables.Simulation of this binary symmetric channel agrees with the obtained expression and numerical approximation.
Providing secure communication links between devices of low computational power has been increasingly investigated during recent years. The need for fast and easy-to-implement security for computationally weak wireless devices has lead to the development of physical layer based key generation approaches. The generation of symmetric cryptographic keys out of wireless channel properties turned out to be a promising approach comprising advantages of symmetric as well as asymmetric cryptography. Numerous quantization schemes have been proposed in previous works to increase the Key Generation Rate (KGR). Also by increasing the sampling rate, the input data can be generated faster. However, due to fast sampling rates, redundancy of subsequent bits will increase. This lowers the quality, that is, the randomness of the generated secret key and makes the system more vulnerable to brute-force attacks. We present and analyze different techniques for transforming a temporally correlated sequence into a compressed sequence of decorrelated bits and, therefore, assure non-redundant key sequences.
Quantum mechanical phenomena are revolutionizing classical engineering fields such as signal processing or cryptography. When randomness plays an important role, like in cryptography where random bit sequences guarantee certain levels of security, quantum mechanical phenomena allow new ways of generating random bit sequences. Such sequences have a lot of applications in the communication sector, e.g., regarding data transmission, simulation, sensors or radars, and beyond. They can be generated deterministically (e.g., by using polynomials, resulting in pseudo-random sequences) or in a non-deterministic way (e.g., by using physical noise sources like external devices or sensors, resulting in random sequences). Important characteristics of such binary sequences can be modelled by gap processes in conjunction with the probability theory. Recently, all-optical approaches have attracted a lot of research interest. In this work, an adaptation of the quantum key distribution setup is utilized for generating randomised bit sequences. The simulation results show that all-optically generated sequences very well resemble the theoretically ideal probability density characteristic. Additionally, an experimental optical setup is developed that confirms the simulation results. Furthermore, m-sequences show very promising results as well as Gold sequences. Additionally, the level of burstiness, i.e., the distribution of ones and zeros throughout the sequence, is studied for the different sequences. The results enable the finding that generator polynomials with concentrated non-zero coefficients lead to more bursty bit sequences.
Quantum mechanical phenomena are revolutionizing classical engineering fields such as signal processing or cryptography. When randomness plays an important role, like in cryptography where random bit sequences guarantee certain levels of security, quantum mechanical phenomena allow new ways of generating random bit sequences. Such sequences have a lot of applications in the communication sector and beyond. They can be generated deterministically (e.g. by using polynomials, resulting in pseudo-random sequences) or in a non-deterministic way (e.g. by using physical noise sources like external devices or sensors, resulting in random sequences). Important characteristics of such binary sequences can be modelled by gap processes in conjunction with the probability theory. Recently, all-optical approaches have attracted a lot of research interest. In this work, an adaptation of the quantum key distribution (QKD) setup is utilized for generating randomised bit sequences. The simulation results show that all-optically generated sequences very well resemble the theoretically ideal probability density characteristic. Furthermore, m-sequences show very promising results as well as Gold sequences. Additionally, the level of burstiness, i. e. the distribution of one’s and zero’s throughout the sequence, is studied for the different sequences. The results lead to the finding that generator polynomials with concentrated non-zero coefficients lead to more bursty bit sequences.
Two parties, Alice and Bob, wish to distill a binary secret key out of a list of correlated variables that they share after running a quantum key distribution (QKD) protocol based on continuous-spectrum quantum carriers. We present a novel construction that allows the legitimate parties to get equal bit strings out of correlated variables by using a classical channel, with as little leaked information as possible. This opens the way to securely correcting nonbinary key elements. In particular, the construction is refined to the case of Gaussian variables as it applies directly to recent continuous-variable protocols for QKD.
An efficient method for enhancement of a random bit generation rate from a physical source of randomness is proposed. It is based on the repeated application of the operation of symmetrization of random data. This procedure allows one to transform asymptotically any nonsymmetrical distribution into a perfectly symmetrical one. As a result, one can extract up to 46 uncorrelated and unbiased bits from each variate, increasing an effective rate up to 46 times with respect to the mean frequency of random events. The method was tested with spontaneous switchings in a bistable vertical cavity laser. A statistical analysis of the generated random bit sequences which passed the standard randomness tests (ENT, NIST Statistical Test Suites, and Diehard) is presented.
Common randomness (CR), as a resource, is not commonly used in existing practical communication systems. In the common randomness framework, both sender and receiver, often described as terminals, aim to generate a common random variable observable to both, perhaps with low error probability. The knowledge of this CR allows to implement correlated random protocols that could lead to faster and more efficient algorithms. We characterize CR over Gaussian channels for their practical relevance in many communication situations by deriving the CR capacity for both Gaussian Single-Input Single-Output (SISO) and Multiple-Input Multiple-Output (MIMO) cases. Furthermore, CR plays a key role in the identification scheme. In many new applications such as several machine-to-machine and human-to-machine systems and the tactile internet, which demand ultra-reliable low latency, the identification or also called post-Shannon scheme is proved to be more efficient than the classical transmission. It has been proved that through CR generation, the post-Shannon communication task allows to achieve an enormous performance gain. We consider a correlation-assisted secure identification scheme over Gaussian wiretap channels (GWC) and develop a lower bound on the corresponding secure identification capacity.